BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alex Iosevich (University of Rochester)
DTSTART:20200605T203000Z
DTEND:20200605T205500Z
DTSTAMP:20260423T011240Z
UID:CANT2020/70
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/70/
 ">On discrete and continuous variants of the distance graph</a>\nby Alex I
 osevich (University of Rochester) as part of Combinatorial and additive nu
 mber theory (CANT 2021)\n\n\nAbstract\nGiven ${\\Bbb R}^d$ or ${\\Bbb F}_q
 ^d$\, where ${\\Bbb F}_q$ is the finite field with $q$ elements\, and a sc
 alar $t$\, either in ${\\Bbb R}$ or ${\\Bbb F}_q$\, we can define the dist
 ance graph by taking the vertices to be the points in ${\\Bbb R}^d$ (or ${
 \\Bbb F}_q^d$) and connecting two vertices $x$ and $y$ by an edge if \n$$ 
 {(x_1-y_1)}^2+\\dots+{(x_d-y_d)}^2=t.$$ \nOver the past 15 years\, the the
 ory of these graphs has undergone rapid development. We are going to descr
 ibe what is known and the challenges that lie ahead.\n
LOCATION:https://researchseminars.org/talk/CANT2020/70/
END:VEVENT
END:VCALENDAR