| Wednesday 4 September 2024 | |
| Events for day: Wednesday 08 November 2023 |
| 11:00 - 12:00 Wednesday Weekly Seminar - meeting Nuclear corrections on the charged hadron fragmentation functions in a Neural Network global QCD analysis School PARTICLES AND ACCELERATORS Abstract: In this work, we present new global QCD analyses, referred to as PKHFF.23, for charged pion, kaon, and unidentified light hadrons. We utilize a Neural Network to fit the high-energy lepton-lepton and lepton-hadron scattering data, enabling us to determine parton-to-hadron fragmentation functions (FFs) at next-to-leading-order (NLO) accuracy. The analyses include all available single-inclusive e+e? annihilation (SIA) and semi-inclusive deep-inelastic scattering (SIDIS) data from the COMPASS Collaboration for charged pions, kaons, and unidentified light hadrons. Taking into account the most recent nuclear parton ... 12:30 - 13:30 Geometry and Differential Equations Seminar Quantum Hall Effect on Kahler Manifolds School MATHEMATICS We study the asymptotics of the Landau level energy of the integer quantum Hall effect on Kahler manifolds and obtain a geometric characterization of such an expansion employing the asymptotics of the Bergman kernel in the Kahler geometry. Venue: Niavaran, Lecture Hall 1 ... 13:30 - 15:00 Weekly Seminar THE ISAAC NEWTON TELESCOPE MONITORING SURVEY OF LOCAL GROUP DWARF GALAXIES. VI. THE STAR FORMATION HISTORY AND DUST PRODUCTION IN ANDROMEDA IX School ASTRONOMY We present a photometric study of the resolved stellar populations in And IX, the closest satellite to the M31, a metal-poor and low-mass dwarf spheroidal galaxy. We estimate a distance modulus of 24.56+0.05?0.15 mag based on the tip of the red giant branch (TRGB). By probing the variability of asymptotic giant branch stars (AGB), we study the star formation history of And IX. We identified 50 long period variables (LPVs) in And IX using the Isaac Newton Telescope (INT) in two filters, Sloan ... 14:00 - 15:00 Combinatorics and Computing Weekly Seminar The $(t-1)$-chromatic Ramsey Number for Paths School MATHEMATICS The following relaxation of the classical problem of determining Ramsey number of a fixed graph has first been proposed by ErdH{o}s, Hajnal and Rado over 50 years ago. Given a graph $G$ and an integer $tgeqslant 2$, determine the minimum number $N$ such that in any $t$-colored complete graph on $N$ vertices there is a copy of $G$ using only edges of some $t-1$ colors. In this talk, we discuss the answer when $G$ is a path. https://us06web.zoom.us/j/83407340293?pwd=cXarB4geUkQrP9MMwe8Z71K94wYPpT.1 Meeting ID : 834 0734 0293 Passcode : 36288 ... |