University of Cambridge > Talks.cam > arXiv:scrolling.club [gr-qc]

arXiv:scrolling.club [gr-qc]

Add to your list(s) Send you e-mail reminders Further detail
Subscribe using ical/vcal (Help)

A scrolling club for the general relativity and quantum cosmology [gr-qc] sub-arXiv.

This is a joint initiative between the Central European Institute for Cosmology (CEICO), Institute of Physics of the Czech Academy of Sciences, Observatoire astronomique de Strasbourg, the University of Gdańsk, and the University of Cambridge.

The following, informal algorithm has been shown to work with similar arXiv clubs. The host screen-shares and scrolls slowly through all submissions (gr-qc and cross-list) since the last meeting. The attendees request numbers, whose abstracts are sequestered in new tabs. At the end of each day’s submissions, the tabs are reviewed. Whomever requested the abstract is obliged to lead the discussion. The discussion may even consist of just asking “Does anyone know what X means?”, i.e. it should be student-friendly. In interesting cases, the discussion may lead to the preprint being opened. Keep an eye on the clock, you need to get through a whole week in about an hour!

Time: 15:30—17:00 GMT /BST or 16:30-17:00 CET /CEST on Thursdays.

Online venue:

Topic: arXiv:Scrolling.Club [gr-qc] Join Zoom Meeting https://ucph-ku.zoom.us/j/62879628973?pwd=cWJhdkxOSWI0dFBqSk9aeGR4NGhJZz09 Meeting ID: 628 7962 8973 Passcode: gravity

In-person venue:

Strasbourg: meeting room of the East Building Cambridge: Ryle Seminar Room, KICC Gdańsk: not fixed

Tell a friend about this list:

If you have a question about this list, please contact: Will Barker. If you have a question about a specific talk, click on that talk to find its organiser.

0 upcoming talks and 1 talk in the archive.

Title to be confirmed

UserSpeaker to be confirmed.

HouseLarge Martin Ryle Seminar Room, KICC.

ClockThursday 11 May 2023, 15:30-17:00

Please see above for contact details for this list.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity