BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Robert Hough (SUNY at Stony Brook)
DTSTART:20200601T130000Z
DTEND:20200601T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/1
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/1/">The 15 puzzle problem</a>\nby Robert Hough (SUNY at Stony Brook) a
 s part of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstra
 ct\nAn $n^2-1$ puzzle is a children's toy with $n^2-1$ numbered pieces on 
 an $n \\times n$ grid\, \nwith one missing piece.  A move in the puzzle co
 nsists of sliding an adjacent numbered piece \ninto the location of the mi
 ssing piece.  I will discuss joint work with Yang Chu which studies \nthe 
 asymptotic mixing of an $n^2-1$ puzzle when random moves are made.  \nThe 
 techniques involve characteristic function methods for studying the renewa
 l process \ndescribed by the sequence of moves of one or several pieces.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mel Nathanson (CUNY)
DTSTART:20200601T133000Z
DTEND:20200601T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/2
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/2/">Fundamental theorems in additive number theory</a>\nby Mel Nathans
 on (CUNY) as part of Combinatorial and additive number theory (CANT 2021)\
 n\n\nAbstract\nLet $A$ be a subset of the integers $\\mathbf Z$\, of the l
 attice ${\\mathbf Z}^n$\, \nor of any additive abelian semigroup $X$.   \n
 The central problem in additive number theory is to understand the $h$-fol
 d sumset \n\\[\nhA = \\{a_1+\\cdots + a_h : a_i \\in A \\text{ for all } i
 =1\,\\ldots\, h \\}.\n\\]\nIf $A$ is finite\, what is the size of the sums
 et $hA$?  If $A$ is infinite\, what is the density \nof $hA$?   What is th
 e structure of the sumset $hA$?   \nDescribe this for small $h$\, and also
  asymptotically as $h \\rightarrow \\infty$.  \nIn how many ways can an el
 ement $x \\in X$ be represented as the sum of $h$ elements \nof $A$?   For
  fixed $r$\, what is the subset of $hA$ consisting of elements that have \
 nat least $r$ representations? \nClassical problems consider sums of squar
 es\, of $k$th powers\, and of primes\, \nbut the general case is also impo
 rtant.  \nThis talk will discuss both old and very recent results about su
 msets.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Peter Pal Pach (Budapest University of Technology and Economics)
DTSTART:20200601T140000Z
DTEND:20200601T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/3
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/3/">Counting subsets avoiding certain multiplicative configurations</a
 >\nby Peter Pal Pach (Budapest University of Technology and Economics) as 
 part of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract
 \nWe will discuss results about enumerating subsets of $\\{1\,2\,\\dots\,n
 \\}$ avoiding certain \nmultiplicative configurations. Namely\, we will co
 unt primitive sets\, $h$-primitive sets \n(where none of the elements divi
 de the product of $h$ other elements) and multiplicative \nSidon sets. Mos
 t of these problems were raised by Cameron and Erdős.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Aled Walker (CRM\, Montreal\, and Trinity College\, Cambridge)
DTSTART:20200601T143000Z
DTEND:20200601T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/4
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/4/">A tight structure theorem for sumsets</a>\nby Aled Walker (CRM\, M
 ontreal\, and Trinity College\, Cambridge) as part of Combinatorial and ad
 ditive number theory (CANT 2021)\n\n\nAbstract\nIn joint work with Andrew 
 Granville and George Shakan\, we show that for any finite set \n$$A=\\{ 0=
 a_0 < a_1< \\cdots < a_{m+1}=b\\}$$ of integers\, $NA$ is as predicted whe
 never \n$N\\geq b-m$\, and that this bound is "best possible" in several f
 amilies of cases.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alfred Geroldinger (University of Graz\, Austria)
DTSTART:20200601T150000Z
DTEND:20200601T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/5
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/5/">Zero-sum sequences over finite abelian groups and their sets of le
 ngths</a>\nby Alfred Geroldinger (University of Graz\, Austria) as part of
  Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\nLet $
 G$ be an additively written abelian group.  \nA (finite unordered) sequenc
 e $S = g_1 \\ldots g_{\\ell}$ of terms from $G$ (with repetition allowed)\
 n is said to be a \\emph{zero-sum sequence} if $g_1 + \\ldots + g_{\\ell} 
 = 0$. \n Every zero-sum sequence $S$ can be factored into minimal zero-sum
  sequences\, \n say $S = S_1 \\ldots S_k$. Then $k$ is called a factorizat
 ion length of $S$ and  \n $\\mathsf L (S) \\subset \\mathbb N$ denotes the
  set of all factorization lengths of $S$.  \n We consider the system $\\ma
 thcal L (G) = \\big\\{ \\mathsf L (S) \\colon S \\  \\text{is a zero-sum s
 equence over $G$} \\big\\}$ of all sets of lengths.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arindam Biswas (Technion - Israel Institute of Technology)
DTSTART:20200601T153000Z
DTEND:20200601T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/6
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/6/">On minimal complements and co-minimal pairs in groups</a>\nby Arin
 dam Biswas (Technion - Israel Institute of Technology) as part of Combinat
 orial and additive number theory (CANT 2021)\n\n\nAbstract\nGiven two non-
 empty subsets $W\,W'\\subseteq G$ in a group $G$\, the set $W'$ is said \n
 to be a complement to $W$ if $W\\cdot W'=G$ and it is minimal if no proper
  subset of $W'$ is a \ncomplement to $W$. The notion was introduced by Nat
 hanson in the course of his study of natural \narithmetic analogues of the
  metric concept of nets in the setting of the integers.  \nA notion strong
 er than minimal complements is that of a co-minimal pair.  \nA pair of sub
 sets $(W\,W')$ is a co-minimal pair if $W\\cdot W' = G$ and $W$ is minimal
  \nwith respect to $W'$ and vice-versa. In this talk we shall mainly conce
 ntrate on abelian groups \nand show some recent developments on the existe
 nce and the non-existence \nof minimal complements and of co-minimal pairs
 .\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pierre-Yves Bienvenu (Universite de Lyon)
DTSTART:20200601T170000Z
DTEND:20200601T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/7
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/7/">Additive bases in infinite abelian semigroups\, I</a>\nby Pierre-Y
 ves Bienvenu (Universite de Lyon) as part of Combinatorial and additive nu
 mber theory (CANT 2021)\n\n\nAbstract\nAn additive basis $A$  of a semigro
 up $T$ is a subset such that every element of $T$\, \nup to a finite set o
 f exceptions\, may be written as a sum of one and the same number \n$h$ of
  elements from the basis.  The minimal such number $h$ is called the order
  of the basis. \nWe study bases in a class of infinite abelian semigroups\
 , which we term translatable semigroups. \nThese include all infinite abel
 ian groups as well as the semigroup of nonnegative integers.  \nWe analyze
  the ``robustness" of bases. \nSuch discussions have a long history in the
  semigroup ${\\mathbf N}$\, \noriginating in the work of Erd\\H os and Gra
 ham\, continued by Deschamps and Farhi\, \nNathanson and Nash\, Hegarty...
 .  Thus we consider essential subsets of a basis $A$\, \nthat is\, finite 
 sets $F$ such that $A \\setminus F$ \nis no longer a basis\, and which are
  minimal. We show that any basis has only finitely \nmany essential subset
 s\, and we bound the number of essential subsets of cardinality $k$ \nof a
  basis of order $h$ in terms of $h$ and $k$. \n\nJoint work with Benjamin 
 Girard and Thai Hoang Lˆe.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Thai Hoang Le (University of Mississippi)
DTSTART:20200601T173000Z
DTEND:20200601T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/8
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/8/">Additive bases in infinite abelian semigroups\, II</a>\nby Thai Ho
 ang Le (University of Mississippi) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\n\nAbstract\nThis talk is a continuation of par
 t I by Pierre-Yves Bienvenu\, though it will be self-contained.\n \nLet $T
 $ be a semigroup and $A$ be a basis $T$.  \nIf $F$ is a finite subset of $
 A$ and $A \\setminus F $ is still a basis $T$ (of a possibly different ord
 er)\, \ncan we bound the order of $A \\setminus F$ in terms of that of $A$
  and $|F|$? \nIn the semigroup $\\mathbf{N}$\, this question was first stu
 died by Erd\\H{o}s and Graham \nwhen $F$ is a singleton\, and by Nash and 
 Nathanson for general $F$. \nWe prove a general bound for all translatable
  semigroups. \nBesides studying the maximum order of $A \\setminus F$\, we
  also study its "typical" order.\n\nJoint work with Pierre-Yves Bienvenu a
 nd Benjamin Girard.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alex Cohen (Yale University)
DTSTART:20200601T180000Z
DTEND:20200601T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/9
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/9/">A Sylvester-Gallai result in the complex plane</a>\nby Alex Cohen 
 (Yale University) as part of Combinatorial and additive number theory (CAN
 T 2021)\n\n\nAbstract\nWe show that for a Sylvester-Gallai configuration i
 n $\\mathbb{C}^2$ lying on a family \nof $m$ concurrent lines\, each line 
 in the family can contain at most $3m-9$ points of the set\, \nnot includi
 ng the common point. This implies that many points lying on a family of co
 ncurrent lines \nmust admit an ordinary line. We also introduce a conjectu
 re which would improve this bound \nto $m-1$\, which is sharp. Our approac
 h involves ordering points by their real part\, \nwhich is a new technique
  for studying complex line arrangements.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Theresa C. Anderson (Brown University)
DTSTART:20200601T183000Z
DTEND:20200601T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/10
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/10/">How numbers interact with curves</a>\nby Theresa C. Anderson (Bro
 wn University) as part of Combinatorial and additive number theory (CANT 2
 021)\n\n\nAbstract\nWe show how discrete versions of averaging operators f
 rom harmonic analysis behave \ndrastically differently from their continuo
 us counterparts.  We do this through examples: \nstarting with a bit of hi
 story and ending by sampling recent results.  \nWe plan to discuss the cas
 e of the spherical maximal function\, introducing several variants\, \nsuc
 h as averaging along primes\, which allow us to describe precise lattice p
 oint distribution.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Bennett (University of British Columbia)
DTSTART:20200601T190000Z
DTEND:20200601T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/11
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/11/">Differences between perfect powers</a>\nby Michael Bennett (Unive
 rsity of British Columbia) as part of Combinatorial and additive number th
 eory (CANT 2021)\n\n\nAbstract\nIn this talk\, I will survey a variety of 
 arithmetic problems related to the sequence \nof differences between perfe
 ct powers\, highlighting what is known\, \nwhat is expected to be true\, a
 nd what is (possibly) within range of current technology. \nI shall discus
 s some recent  joint work with Samir Siksek on a number of related \nclass
 ical polynomial-exponential equations.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wolfgang Schmid (University of Paris 8\, Saint-Denis)
DTSTART:20200601T193000Z
DTEND:20200601T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/12
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/12/">Plus-minus weighted zero-sum sequences and applications to factor
 izations of norms of quadratic integers</a>\nby Wolfgang Schmid (Universit
 y of Paris 8\, Saint-Denis) as part of Combinatorial and additive number t
 heory (CANT 2021)\n\n\nAbstract\nLet $(G\,+)$ be a finite abelian group. A
  sequence $g_1\, \\dots\, g_k$ over $G$ \nis called a zero-sum sequence if
  $g_1 + \\dots + g_k = 0$ \n(we consider sequences that just differ by the
  ordering of the terms as equal).   \nThe concatenation of two zero-sum se
 quences is a zero-sum sequence and the set \nof all zero-sum sequences ove
 r $G$ is thus a monoid. The arithmetic of these monoids \nhas been the sub
 ject much investigation. \n\nA sequence is called a \\emph{plus-minus weig
 hted zero-sum sequence} if there is a choice \nof weights $w_i \\in \\{-1\
 , +1\\}$ such that \n$w_1g_1 + \\dots + w_k g_k = 0$. The set of all plus-
 minus weighted zero-sum sequences \nover $G$ is a monoid as well.\nWe pres
 ent some results on the arithmetic of these monoids.\nMoreover\, applicati
 ons to factorizations of norms of quadratic integers are discussed. \n\nJo
 int work with S. Boukheche\, K. Merito and O. Ordaz.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steve Senger (Missouri State University)
DTSTART:20200601T200000Z
DTEND:20200601T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/13
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/13/">Point configurations determined by dot products</a>\nby Steve Sen
 ger (Missouri State University) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\n\nAbstract\nErdős' unit distance problem has per
 plexed mathematicians for decades. \nIt asks for upper bounds on how often
  a fixed distance can occur in a large finite point set in the plane. \nWe
  offer novel bounds on a family of variants of this problem involving mult
 iple points\, \nand relationships determined by dot products. Specifically
 \, given a large finite set $E$ of points \nin the plane\, and a $(m \\tim
 es m)$ matrix $M$ of real numbers\, we offer bounds on the number \nof $m$
 -tuples of points from $E$\, $(x_1\, x_2\, \\dots\, x_m)\,$ satisfying $x_
 i \\cdot x_j = m_{ij}\,$ \nthe $(i\,j)$th entry of $M$.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeffrey C. Lagarias (University of Michigan)
DTSTART:20200601T203000Z
DTEND:20200601T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/14
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/14/">Partial factorizations of products of binomial coefficients</a>\n
 by Jeffrey C. Lagarias (University of Michigan) as part of Combinatorial a
 nd additive number theory (CANT 2021)\n\n\nAbstract\nLet $G_n$ denote the 
 product of the binomial coefficients in the $n$-th row of \nPascal's trian
 gle.  Then $\\log G_n$ is asymptotic to $\\frac{1}{2}n^2$ as $n \\to \\inf
 ty$.\nLet $G(n\,x)$ denote the product of the maximal prime powers of all 
 $p \\le x$ dividing $G_n$. \nWe determine asymptotics of $\\log G(n\, \\al
 pha n) \\sim f(\\alpha)n^2$ as $n \\to \\infty$\,\nwith error term. Here \
 n\\[\nf(\\alpha) = \\frac{1}{2}   -\\alpha \\left\\lfloor \\frac{1}{\\alph
 a} \\right\\rfloor\n+ \\frac{1}{2} \\alpha^2  \\left\\lfloor \\frac{1}{\\a
 lpha}\\right\\rfloor^2 + \\frac{1}{2} \\alpha^2  \\left\\lfloor \\frac{1}{
 \\alpha}\n \\right\\rfloor \n\\]\nfor $0< \\alpha \\le 1$.\n The result is
  based on  analysis of associated radix expansion statistics $A(n\,x)$ and
  $B(n\,x)$.\n The estimates relate to prime number theory\, and vice versa
 .\n\nJoint work with Lara Du.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paolo Leonetti (Universita Bocconi\, Italy)
DTSTART:20200602T130000Z
DTEND:20200602T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/15
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/15/">On the density of sumsets</a>\nby Paolo Leonetti (Universita Bocc
 oni\, Italy) as part of Combinatorial and additive number theory (CANT 202
 1)\n\n\nAbstract\nWe define a large family $\\mathcal{D}$ of partial set f
 unctions \n$\\mu: \\mathrm{dom}(\\mu) \\subseteq \\mathcal{P}(\\mathbf{N})
  \\to \\mathbf{R}$ satisfying certain axioms. \nExamples of "densities" $\
 \mu \\in \\mathcal{D}$ include the asymptotic\, Banach\, logarithmic\, ana
 lytic\, \nPólya\, and Buck densities. \nWe prove several results on sumse
 ts which were previously obtained for the asymptotic density. \nFor instan
 ce\, we show that for each $n \\in \\mathbf N^+$ and $\\alpha \\in [0\,1]$
 \, there exists \n$A \\subseteq \\mathbf{N}$ with $kA \\in \\text{dom}(\\m
 u)$ and $\\mu(kA) = \\alpha k/n$ \nfor every $\\mu \\in \\mathcal{D}$ and 
 every $k=1\,\\ldots\, n$\, where $kA$ denotes \nthe $k$-fold sumset $A+\\c
 dots+A$. \nJoint work with Salvatore Tringali.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kare Gjaldbaek (CUNY Graduate Center)
DTSTART:20200602T133000Z
DTEND:20200602T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/16
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/16/">Noninjectivity of nonzero discriminant polynomials and applicatio
 ns to packing polynomials</a>\nby Kare Gjaldbaek (CUNY Graduate Center) as
  part of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstrac
 t\nWe show that an integer-valued quadratic polynomial on $\\mathbb{R}^2$\
 ncan not be injective on the integer lattice points of any subset of $\\ma
 thbb{R}^2$\ncontaining an affine convex cone if its discriminant is nonzer
 o.\nA consequence is the non-existence of quadratic packing polynomials\no
 n irrational sectors of $\\mathbb{R}^2$.\nThe result also simplifies a cla
 ssical proof of the Fueter-Pólya Theorem\, \nwhich states that the two Ca
 ntor polynomials are the only\nquadratic polynomials bijectively mapping $
 \\mathbb{N}_0^2$ onto $\\mathbb{N}_0$.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gautami Bhowmik (Universite de Lille)
DTSTART:20200602T140000Z
DTEND:20200602T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/17
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/17/">Non-vanishing of products of $L$-functions</a>\nby Gautami Bhowmi
 k (Universite de Lille) as part of Combinatorial and additive number theor
 y (CANT 2021)\n\n\nAbstract\nAmong the analytic properties of $L$-function
 s\, we are interested in their mean values\,  \ncalled moments\, and in kn
 owing whether a positive proportion of families of these functions \nvanis
 h at a central point. \nHere we will treat mixed moments of the product of
  \nHecke $L$-functions and symmetric square $L$-functions\nassociated to p
 rimitive cusp forms. \n\nJoint work with O. Balkanova\, D. Frolenkov and N
 . Raulf.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lajos Hajdu (University of Debrecen)
DTSTART:20200602T143000Z
DTEND:20200602T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/18
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/18/">Skolem's conjecture for a family of exponential equations</a>\nby
  Lajos Hajdu (University of Debrecen) as part of Combinatorial and additiv
 e number theory (CANT 2021)\n\n\nAbstract\nAccording to Skolem's conjectur
 e\, if an exponential Diophantine equation is not solvable\, \nthen it is 
 not solvable modulo an appropriately chosen modulus. Besides several concr
 ete \nequations\, the conjecture has only been proved for rather special c
 ases. \nIn the talk we present a new theorem proving the conjecture for eq
 uations of the form \n$x^n-by_1^{k_1}\\dots y_\\ell^{k_\\ell}=\\pm 1$\, wh
 ere $b\,x\,y_1\,\\dots\,y_\\ell$ are fixed integers \nand $n\,k_1\,\\dots\
 ,k_\\ell$ are non-negative integral unknowns. Note that the family include
 s \nthe famous equations $x^n-y^k=1$ and $\\frac{x^n-1}{x-1}=y^k$ with $x\
 ,y$ fixed. \n\nJoint with A. Bérczes and R. Tijdeman.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Leonid Fel (Technion -- Israel Institute of Technology)
DTSTART:20200602T150000Z
DTEND:20200602T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/19
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/19/">A sum of negative degrees of the gaps values in two-generated num
 erical semigroups and identities for the Hurwitz zeta function</a>\nby Leo
 nid Fel (Technion -- Israel Institute of Technology) as part of Combinator
 ial and additive number theory (CANT 2021)\n\n\nAbstract\nWe derive an exp
 licit expression for an inverse power series over the gaps\nvalues of nume
 rical semigroups generated by two integers. It implies a set of\nidentitie
 s for the Hurwitz zeta function $\\zeta(n\,q)$ including the \nmultiplicat
 ion theorem for $\\zeta(n\,q)$. \n\nJoint work with Takao Komatsu and Ade 
 Irma Suriajaya.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:George E. Andrews (Pennsylvania State University)
DTSTART:20200602T153000Z
DTEND:20200602T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/20
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/20/">Separable integer partition (SIP) classes</a>\nby George E. Andre
 ws (Pennsylvania State University) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\n\nAbstract\nThree of the most classical and we
 ll-known identities in the theory of partitions concern: \n(1) the generat
 ing function for $p(n)$ (Euler)\; \n(2) the generating function for partit
 ions into distinct parts (Euler)\, and \n(3) the generating function for p
 artitions in which parts differ by at least 2 (Rogers-Ramanujan).  \nThe l
 ovely\, simple argument used to produce the relevant generating functions 
 is mostly never seen again.  \nActually\, there is a very general theorem 
 here which we shall present.  \nWe then apply it to prove two familiar the
 orems\; (1) G\\" ollnitz-Gordon\, and (2) Schur 1926.  \nWe also consider 
  an example where the series representation for the partitions in question
   is new.  \nWe close with an application to "partitions with n copies of 
 n."\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Norbert Hegyvari (Eotvos University and Renyi Institute\, Budapest
 )
DTSTART:20200602T170000Z
DTEND:20200602T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/21
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/21/">Hilbert cubes meet arithmetic sets</a>\nby Norbert Hegyvari (Eotv
 os University and Renyi Institute\, Budapest) as part of Combinatorial and
  additive number theory (CANT 2021)\n\n\nAbstract\nIn 1978\, Nathanson obt
 ained several results on sumsets contained in infinite sets of integers.  
 \nLater the author investigated how big a Hilbert cube avoiding a given {\
 \it infinite} \nsequence of integers can be.  \n\nIn the present talk\, we
  show that an additive Hilbert cube\, in {\\it prime fields} \nof sufficie
 ntly large dimension\, always meets certain kinds of arithmetic sets\, \nn
 amely\, product sets and reciprocal sets of sumsets satisfying certain tec
 hnical conditions.  \n\nJoint work with Peter P. Pach.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:George Shakan (University of  Oxford)
DTSTART:20200602T173000Z
DTEND:20200602T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/22
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/22/">An analytic approach to the cardinality of sumsets</a>\nby George
  Shakan (University of  Oxford) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\n\nAbstract\nWe describe some notions of additive 
 structure that are useful for studying the \nMinkowski sum of discrete set
 s in large dimensions. \n\nJoint work with Dávid Matolcsi\, Imre Ruzsa\, 
 and Dmitrii Zhelezov.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:I.D. Shkredov (Steklov Mathematical Institute\, Russia)
DTSTART:20200602T180000Z
DTEND:20200602T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/23
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/23/">Growth in Chevalley groups and some applications</a>\nby I.D. Shk
 redov (Steklov Mathematical Institute\, Russia) as part of Combinatorial a
 nd additive number theory (CANT 2021)\n\n\nAbstract\nGiven a Chevalley gro
 up ${\\mathbf G}(q)$ and a parabolic subgroup \n$P\\subset {\\mathbf G}(q)
 $\, we prove that for any set $A$ there is a certain growth of $A$\nrelati
 vely to $P$\, namely\, either $AP$ or $PA$ is much larger than $A$. Also\,
 \nwe study a question about intersection of $A^n$ with parabolic subgroups
  $P$\nfor large $n$. We apply our method to obtain some results on a modul
 ar form of\nZaremba's conjecture from the theory of continued fractions an
 d make the first\nstep towards Hensley's conjecture about some Cantor sets
  with Hausdorff\ndimension greater than $1/2$\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pablo Soberon (Baruch College (CUNY))
DTSTART:20200602T183000Z
DTEND:20200602T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/24
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/24/">The topological Tverberg problem beyond prime powers</a>\nby Pabl
 o Soberon (Baruch College (CUNY)) as part of Combinatorial and additive nu
 mber theory (CANT 2021)\n\n\nAbstract\nTverberg-type theory aims to establ
 ish sufficient conditions for a simplicial complex $\\Sigma$ such that \ne
 very continuous map $f\\colon \\Sigma \\to \\mathbb{R}^d$ maps $q$ points 
 from pairwise disjoint faces \nto the same point in~$\\mathbb{R}^d$. Such 
 results are plentiful for $q$ a power of a prime. \nHowever\, for $q$ with
  at least two distinct prime divisors\, results that guarantee the existen
 ce \nof $q$-fold points of coincidence are non-existent---aside from immed
 iate corollaries of the prime \npower case. Here we present a general meth
 od that yields such results beyond the case of prime powers. \n\nJoint wor
 k with Florian Frick.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Keith (Michigan Technological University)
DTSTART:20200602T190000Z
DTEND:20200602T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/25
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/25/">Part-frequency matrices of partitions: New developments and relat
 ed bijections</a>\nby William Keith (Michigan Technological University) as
  part of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstrac
 t\nAs one of those mathematical confluences that sometimes happen\,\n in r
 ecent years several researchers appear to have independently developed \n 
 the same generalization of Glaisher's\nbijection on partitions: a natural 
 matrix construction with wide\napplication in combinatorial proofs.  In th
 is talk we shall illustrate\nthe core idea\, give some new theorems employ
 ing it\, and suggest some\nquestions that might be of interest for further
  exploration.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ariane Masuda (New York City Tech (CUNY))
DTSTART:20200602T193000Z
DTEND:20200602T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/26
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/26/">Redei permutations with cycles of length $1$ and $p$</a>\nby Aria
 ne Masuda (New York City Tech (CUNY)) as part of Combinatorial and additiv
 e number theory (CANT 2021)\n\n\nAbstract\nLet $\\mathbb F_q$ be the finit
 e field of odd characteristic with $q$ elements \nand $\\mathbb P^1(\\math
 bb F_q):=\\mathbb F_q\\cup \\{\\infty\\}$. Consider the binomial expansion
  \n$\\displaystyle (x+\\sqrt y)^n = N(x\,y)+D(x\,y)\\sqrt{y}.$\nFor $n\\in
 \\mathbb N$ and $a \\in \\mathbb F_q$\, the <i>Rédei function</i>\n$R_{n\
 ,a}\\colon \\mathbb P^1(\\mathbb F_q)  \\to \\mathbb P^1(\\mathbb F_q)$ is
  defined by\n$$\nR_{n\,a}(x)=\n\\begin{cases} \\dfrac{N(x\,a)}{D(x\,a)} & 
 \\text{ if } D(x\,a)\\neq 0\,  x\\neq\\infty\\\\\n \n\\infty & \\text{ if 
 } D(x\,a)=0\, x\\neq\\infty\,  \\text{ or if } x=\\infty.\n\\end{cases}\n$
 $\nRédei functions have been used in several applications such as  crypto
 graphy and\n coding theory as well as in the generation of pseudorandom nu
 mbers and Pell equations. \n In this talk we will present results on R\\'e
 dei permutations that decompose in cycles \nof length $1$ and $p$\, where 
 $p$ is prime.  In particular\, we will describe \nall Rédei functions tha
 t are involutions. \n\nJoint work with  Juliane Capaverde and  Virgínia R
 odrigues.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Huixi Li (University of Nevado\, Reno)
DTSTART:20200602T200000Z
DTEND:20200602T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/27
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/27/">On the connection between the Goldbach conjecture and the Elliott
 -Halberstam conjecture</a>\nby Huixi Li (University of Nevado\, Reno) as p
 art of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\
 nIn this presentation we show that the binary Goldbach conjecture for suff
 iciently large even integers \nwould follow under the assumptions of both 
 the Elliott-Halberstam conjecture and a variant \nof the Elliott-Halbersta
 m conjecture twisted by the Möbius function\, provided that the sum \nof 
 their level of distributions exceeds 1. This continues the work of Pan. \n
 An analogous result for the twin prime conjecture is obtained by Ram Murty
  and Vatwani.  \nJoint work with Jing-Jing Huang.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brad Isaacson (New York City Tech (CUNY))
DTSTART:20200602T203000Z
DTEND:20200602T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/28
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/28/">Formulas for some exponential and trigonometric character sums</a
 >\nby Brad Isaacson (New York City Tech (CUNY)) as part of Combinatorial a
 nd additive number theory (CANT 2021)\n\n\nAbstract\nWe express three diff
 erent\, yet related\, character sums by generalized Bernoulli numbers.  \n
 Two of these sums are generalizations of sums introduced and studied by Be
 rndt \nand Arakawa-Ibukiyama-Kaneko in the context of the theory of modula
 r forms.  \nA third sum generalizes a sum already studied by Ramanujan in 
 the context of theta function \nidentities.  Our methods are elementary\, 
 relying on basic facts from algebra and number theory.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yong-Gao Chen (Nanjing Normal University\,  P. R. China)
DTSTART:20200603T130000Z
DTEND:20200603T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/29
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/29/">On a problem of Erdos\,  Nathanson and  Sarkozy</a>\nby Yong-Gao 
 Chen (Nanjing Normal University\,  P. R. China) as part of Combinatorial a
 nd additive number theory (CANT 2021)\n\n\nAbstract\nIn 1988\, Erdős\,  N
 athanson and  Sárközy proved that if $A$ is a\nset of nonnegative intege
 rs with lower asymptotic density\n$1/k$\, where $k$ is a positive integer\
 , then $(k+1) A$ must\ncontain an infinite arithmetic progression with dif
 ference at most\n$ k^2-k$\, where $(k+1) A$ is the set of all sums of $k+1
 $ elements\nof $A$.  They asked if $(k+1)A$ must contain an infinite arith
 metic\nprogression with difference at most $O(k)$. In this talk\, we\nansw
 er this problem negatively by proving that\, for every\nsufficiently large
  integer $k$\, there exists a set $A$ of\nnonnegative integers with the lo
 wer asymptotic density $1/k$ such\nthat  $(k+1)A$ does not contain an infi
 nite arithmetic progression\nwith difference less than $k^{1.5}$.  \n\nJoi
 nt work with Ya-Li Li.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Angel Kumchev (Towson University)
DTSTART:20200603T133000Z
DTEND:20200603T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/30
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/30/">Bounds for discrete maximal functions of codimension 3</a>\nby An
 gel Kumchev (Towson University) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\n\nAbstract\nWe study the bilinear discrete averag
 ing operator \n$T_{\\lambda}(f\,g)(x) = \\sum_{m\,n \\in V_{\\lambda}}  f(
 x-m) g(x-n)$\, \nwhere $f$ and $g$ are functions in $\\ell^p(\\mathbb Z^d)
 $ and $\\ell^q(\\mathbb Z^d)$ \nand the summation is over the integer solu
 tions $(m\,n) \\in \\mathbb Z^{2d}$ of the equations \n\\[ |m|^2 = |n|^2 =
  2m \\cdot n = \\lambda\, \\]\nwhere $|\\cdot|$ is the standard Euclidean 
 norm on $\\mathbb R^d$.  \nWe prove an approximation formula for the Fouri
 er multiplier of $T_{\\lambda}$ \nand establish the boundedness of the res
 pective maximal operator \nfrom $\\ell^p(\\mathbb Z^d \\times \\ell^q(\\ma
 thbb Z^d)$ to $\\ell^r(\\mathbb Z^d)$ \nfor a range of choices for $p\,q\,
 r$. Our work is related to classical work on simultaneous \nrepresentation
 s of integers by quadratic forms as well as to the study \nof point config
 urations in combinatorial geometry. \n\nJoint work with T.C. Anderson and 
 E.A. Palsson.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oriol Serra (Universitat Politecnica de Catalunya\, Barcelona)
DTSTART:20200603T140000Z
DTEND:20200603T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/31
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/31/">Extremal sets for Freiman's theorem</a>\nby Oriol Serra (Universi
 tat Politecnica de Catalunya\, Barcelona) as part of Combinatorial and add
 itive number theory (CANT 2021)\n\n\nAbstract\nThe well-known theorem of F
 reiman states that sets of integers with small doubling \nare dense subset
 s of $d$--dimensional arithmetic progressions.  \nIn connection with this 
 theorem\,  Freiman conjectured a precise upper bound on the volume \nof a 
 finite $d$--dimensional set $A$ in terms of the cardinality of $A$ and  of
  the sumset $A+A$. \nA set $A\\subset {\\mathbb Z}^d$ is $d$--dimensional 
 if it is not contained in a hyperplane. \nIts volume is the smallest numbe
 r of lattice points in the convex hull of a set $B$ that is Freiman \nisom
 orphic to $A$. The conjecture is equivalent to saying that the extremal se
 ts for this problem \nare long simplices\, consisting of a $d$--dimensiona
 l simplex and an extremal $1$--dimensional \nset in one of the dimensions.
  In this talk we will discuss a proof of the conjecture  for a wide class 
 \nof sets called chains.  A finite set is a chain if there is an ordering 
 of its elements such that initial \nsegments in this ordering are extremal
 . \n\nJoint work with G.A. Freiman.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bhuwanesh Rao Patil (PDF at IISER Berhampur\, India)
DTSTART:20200603T143000Z
DTEND:20200603T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/32
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/32/">Geometric progressions in syndetic sets</a>\nby Bhuwanesh Rao Pat
 il (PDF at IISER Berhampur\, India) as part of Combinatorial and additive 
 number theory (CANT 2021)\n\n\nAbstract\nIn this talk\, we will discuss th
 e presence of arbitrarily long geometric progressions \nin syndetic sets\,
  where a subset of $\\mathbb{N}$ (the set of all natural numbers) \nis cal
 led \\emph{syndetic} if it intersects every set of $l$ consecutive natural
  numbers \nfor some natural number $l$. In order to understand it\, we wil
 l explain the structure \nof the set $\\{\\frac{a}{b}\\in \\mathbb{N}: a\,
  b\\in A\\}$ for a given syndetic set $A$.\n\nTitle: A question of Bukh on
  sums of dilates \\\\ \nAbstract: There exists a $p<3$ with the property t
 hat for all real numbers $K$ and every finite subset $A$ \nof a commutativ
 e group that satisfies $|A+A| \\leq K |A|$\, the dilate sum \\[A+2 \\cdot 
 A = \\{ a + b+b : a\, b \\in A\\}\\] \nhas size at most $K^p |A|$. This an
 swers a question of Bukh. \n\nJoint work with Brandon Hanson.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amanda Montejano (Universidad Nacional Autonoma de Mexico)
DTSTART:20200603T150000Z
DTEND:20200603T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/33
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/33/">Zero-sum squares in bounded discrepancy $\\{-1\,1\\}$-matrices</a
 >\nby Amanda Montejano (Universidad Nacional Autonoma de Mexico) as part o
 f Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\nFor 
 $n\\ge 5$\, we prove that every $n\\times n$ $\\{-1\,1\\}$-matrix $M=(a_{i
 j})$ with discrepancy \n$\\text{disc}(M)=\\sum a_{ij} \\le n$ contains a z
 ero-sum square except for the diagonal matrix (up to symmetries). \nHere\,
  a square is a $2\\times 2$ sub-matrix of $M$ with entries $a_{i\,j}\, a_{
 i+s\,s}\, a_{i\,j+s}\, a_{i+s\,j+s}$ \nfor some $s\\ge 1$\, and the diagon
 al matrix is a matrix with all entries above the diagonal equal to $-1$ \n
 and all remaining entries equal to $1$. In particular\, we show that for $
 n\\ge 5$ every \nzero-sum $n\\times n$ $\\{-1\,1\\}$-matrix contains a zer
 o-sum square. \n\nJoint work with Edgardo Roldán-Pensado and Alma Aréval
 o.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jakub Konieczny (Hebrew University of Jerusalem\, Israel)
DTSTART:20200603T153000Z
DTEND:20200603T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/34
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/34/">Automatic multiplicative sequences</a>\nby Jakub Konieczny (Hebre
 w University of Jerusalem\, Israel) as part of Combinatorial and additive 
 number theory (CANT 2021)\n\n\nAbstract\nAutomatic sequences $-$ that is\,
  sequences computable by finite automata $-$ give rise \nto one of the mos
 t basic models of computation. As such\, for any class of sequences it is 
 natural \nto ask which sequences in it are automatic. In particular\, the 
 question of classifying automatic \nmultiplicative sequences has attracted
  considerable attention in the recent years. \nIn the completely multiplic
 ative case\, such classification was obtained independently \nby S. Li and
  O. Klurman and P. Kurlberg. The main topic of my talk will be the resolut
 ion \nof the general case\, obtained in a recent preprint with Lemańczyk 
 and C. Müllner. \nI will also discuss some early results on classificatio
 n of automatic semigroups\, \nwhich is the subject of ongoing work with O.
  Klurman.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carl Pomerance (Dartmouth College)
DTSTART:20200603T170000Z
DTEND:20200603T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/35
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/35/">Symmetric primes</a>\nby Carl Pomerance (Dartmouth College) as pa
 rt of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\n
 Two odd primes $p\,q$ are said to form a symmetric pair if\n$|p-q|=\\gcd(p
 -1\,q-1)$\, and we say a prime is symmetric if it belongs\nto some symmetr
 ic pair.  The concept comes from a standard proof\nof quadratic reciprocit
 y where one counts lattice points in the\n$p/2\\times q/2$ rectangle nestl
 ed in the first quadrant\, both above\nand below the diagonal:  $p$ and $q
 $ are a symmetric pair if and only if\nthese counts agree.  Over 20 years 
 ago\, Fletcher\, Lindgren\, and I\nshowed that most primes are {\\it not} 
 symmetric\, though the numerical \nevidence for this is very weak\n(only a
 bout $1/6$ of the primes to $10^6$ are asymmetric).  In a\nnew paper with 
 Banks and Pollack we get a conjecturally tight\nupper bound for the distri
 bution of symmetric primes and we prove\nthat there are infinitely many of
  them.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jared Duker Lichtman (University of Oxford)
DTSTART:20200603T173000Z
DTEND:20200603T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/36
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/36/">The Erdos primitive set conjecture</a>\nby Jared Duker Lichtman (
 University of Oxford) as part of Combinatorial and additive number theory 
 (CANT 2021)\n\n\nAbstract\nA set of integers larger than 1 is called <i>pr
 imitive</i> if no member divides another. \nErdős proved in 1935 that the
  sum of $1/(n\\log n)$ over $n$ in a primitive set $A$ \nis universally bo
 unded for any choice of $A$. In 1988\, he famously asked \nif this univers
 al bound is attained by the set of prime numbers. \nIn this talk we shall 
 discuss some recent progress towards this conjecture \nand related results
 \, drawing on ideas from analysis\, probability\, and combinatorics.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nathan McNew (Towson University)
DTSTART:20200603T180000Z
DTEND:20200603T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/37
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/37/">Primitive sets in function fields</a>\nby Nathan McNew (Towson Un
 iversity) as part of Combinatorial and additive number theory (CANT 2021)\
 n\n\nAbstract\nA set of integers is \\emph{primitive} if no element divide
 s another.  \nErdős showed that $f(A) = \\sum_{a \\in A}\\frac{1}{a\\log 
 a}$ converges for any primitive set $A$ of integers \ngreater than one\, a
 nd later conjectured this sum is maximized when $A$ is the set $P_1$ of pr
 imes.  \nBanks and Martin further conjectured that  \n$f(\\mathcal{P}_1) >
  \\ldots > f(\\mathcal{P}_k) > f(\\mathcal{P}_{k+1}) > \\ldots$\, \nwhere 
 $\\mathcal{P}_j$ denotes the integers with exactly $j$ prime factors. \nHo
 wever\, this was recently disproven by Lichtman.  \nWe consider the analog
 ous questions for polynomials over a finite field $\\mathbb{F}_q[x]$\, \no
 btaining bounds on the analogous sum\, and find that while the analogue of
  the Banks and Martin \nconjecture similarly fails for small values of $q$
 \, it seems likely to hold for larger values.  \n\nJoint work with Andrés
  Gómez-Colunga\, Charlotte Kavaler and Mirilla Zhu.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kevin O'Bryant (College of Staten Island and CUNY Graduate Center)
DTSTART:20200603T183000Z
DTEND:20200603T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/38
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/38/">Rigorous proofs of stupid inequalities</a>\nby Kevin O'Bryant (Co
 llege of Staten Island and CUNY Graduate Center) as part of Combinatorial 
 and additive number theory (CANT 2021)\n\n\nAbstract\nAn inequality is <i>
 stupid</i> if it is true\, but not for any particular reason. \nWe will gi
 ve a collection of techniques for proving stupid inequalities\, \neach of 
 which was useful in my recent work in explicit analytic number theory.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Filaseta (University of South Carolina)
DTSTART:20200603T190000Z
DTEND:20200603T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/39
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/39/">Two excursions in digitally delicate primes</a>\nby Michael Filas
 eta (University of South Carolina) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\n\nAbstract\nIn 1978\, Murray Klamkin asked whe
 ther there are prime numbers such that \nif any digit in the prime is repl
 aced by any other digit\, the resulting number is composite.  \nIn 1979\, 
 several examples were published together with a proof by Paul Erdős\nthat
  infinitely many such primes exist.  Following the terminology of Jackson 
 Hopper\nand Paul Pollack\, we call such primes ``digitally delicate."  \nT
 he smallest digitally delicate prime is 294001.  In this talk\, we discuss
  some of the history \nsurrounding digitally delicate primes\, implication
 s of prior work\, and recent work by the speaker \nwith Jeremiah Southwick
  and Jacob Juillerat.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wladimir Pribitkin (College of Staten Island and CUNY Graduate Cen
 ter)
DTSTART:20200603T200000Z
DTEND:20200603T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/40
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/40/">Recounting partitions in memory of Freeman Dyson</a>\nby Wladimir
  Pribitkin (College of Staten Island and CUNY Graduate Center) as part of 
 Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\nWe sha
 ll present a short proof of Rademacher's famous formula for the partition 
 function $p(n)$.\nAlthough the proof is old\, its joint publication (with 
 Brandon Williams) is not\, and the communication that\nit engendered with 
 Freeman Dyson is forever young.\nIf time permits\, we shall discuss a gene
 ralization to a broad class of functions.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Josiah Sugarman (CUNY Graduate Center)
DTSTART:20200603T203000Z
DTEND:20200603T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/41
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/41/">On the spectrum of the Conway-Radin operator</a>\nby Josiah Sugar
 man (CUNY Graduate Center) as part of Combinatorial and additive number th
 eory (CANT 2021)\n\n\nAbstract\nJohn Conway and Charles Radin introduced a
  hierarchical tiling of $\\mathbf{R}^3$ \nthey called a quaquaversal tilin
 g. The orientations of these tiles exhibit rapid equidistribution \nnot po
 ssible in two dimension. To study the distribution of these tiles Sadun an
 d Draco \nanalyzed the spectrum of the Hecke operator associated with this
  tiling. We shall discuss \na few results and conjectures related to the s
 pectrum of this operator.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sandor Kiss (Institute of Mathematics\, Budapest University of Tec
 hnology and Economics)
DTSTART:20200604T133000Z
DTEND:20200604T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/42
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/42/">Sidon sets and bases</a>\nby Sandor Kiss (Institute of Mathematic
 s\, Budapest University of Technology and Economics) as part of Combinator
 ial and additive number theory (CANT 2021)\n\n\nAbstract\nLet $h \\ge 2$ b
 e an integer.\nWe say a set $A$ of nonnegative integers is an asymptotic b
 asis of order $h$ if every large enough positive integer can be written as
  a sum of $h$ terms from \n$A$. The set of positive integers $A$ is\ncalle
 d an $h$-Sidon set if the number of representations\nof any positive integ
 er as the sum\nof $h$ terms from $A$ is bounded by $1$. In this talk I wil
 l speak about the existence of $h$-Sidon sets which are asymptotic bases o
 f order $2h+1$. \nThis is a joint work with Csaba Sándor.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Florian Luca (University of the Witwatersrand\, South Africa)
DTSTART:20200604T130000Z
DTEND:20200604T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/43
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/43/">Prime factors of the Ramanujan $\\tau$-function</a>\nby Florian L
 uca (University of the Witwatersrand\, South Africa) as part of Combinator
 ial and additive number theory (CANT 2021)\n\n\nAbstract\nLet $\\tau(n)$ b
 e the Ramanujan $\\tau$-function of $n$. \nIn this talk\, we prove some re
 sults about prime factors of $\\tau(n)$ and its iterates. \nAssuming the L
 ehmer conjecture that $\\tau(n)\\ne 0$ for all $n$\, \nwe show that if $n$
  is even and $k\\ge 1$\, then $\\tau^{(k)}(n)$ is divisible \nby a prime $
 p\\ge 3^{k-1}+1$. \nGiven a fixed finite set of odd primes $S=\\{p_1\,\\ld
 ots\,p_\\ell\\}$\, \nwe give a bound on the number of solutions of $n$ of 
 the equation \n$\\tau(n)=\\pm p_1^{a_1}\\cdots p_\\ell^{a_\\ell}$ for inte
 gers $a_1\,\\ldots\,a_\\ell$\nand in case $S:=\\{3\,5\,7\\}$\, we show tha
 t there is no such $n>1$.  \n\nJoint work with S. Mabaso and P. Stӑnicӑ.
 \n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hamed Mousavi (Georgia Tech)
DTSTART:20200603T193000Z
DTEND:20200603T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/44
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/44/">A class of sums with unexpectedly high cancellation</a>\nby Hamed
  Mousavi (Georgia Tech) as part of Combinatorial and additive number theor
 y (CANT 2021)\n\n\nAbstract\nA class of sums with unexpectedly high cancel
 lation\nAbstract: In this talk we report on the discovery of a general pri
 nciple leading to\nan unexpected cancellation of oscillating sums\, of whi
 ch $\\sum_{n^2\\leq x}(-1)^ne^{\\sqrt{x-n^2}}$\nis an example (to get the 
 idea of the result). It turns out that sums in the\nclass we consider are 
 much smaller than would be predicted by certain\nprobabilistic heuristics.
  After stating the motivation\,\nwe show a number of results in integer pa
 rtitions. For instance we show a ``weak" version of pentagonal number theo
 rem \n$$\n\\sum_{\\ell^2 < x} (-1)^\\ell p(x-\\ell^2)\\ \\sim\\ 2^{-3/4} x
 ^{-1/4} \\sqrt{p(x)}\,\n$$\nwhere $p(x)$ is the usual partition function. 
 \n\nJoint work with Ernie Croot.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oliver Roche-Newton (Johann Radon Institute for Computational and 
 Applied Mathematics (RICAM)\, Austria)
DTSTART:20200604T140000Z
DTEND:20200604T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/45
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/45/">Higher convexity and iterated sum sets</a>\nby Oliver Roche-Newto
 n (Johann Radon Institute for Computational and Applied Mathematics (RICAM
 )\, Austria) as part of Combinatorial and additive number theory (CANT 202
 1)\n\n\nAbstract\nAn important generalisation of the sum-product phenomeno
 n is the basic idea \nthat convex functions destroy additive structure. Th
 is idea has perhaps been most notably \nquantified in the work of Elekes\,
  Nathanson and Ruzsa\, in which they used incidence geometry \nto prove th
 at at least one of the sets $A+A$ or $f(A)+f(A)$ must be large.\n\nI will 
 discuss joint work with Hanson and Rudnev\, in which we use a stronger not
 ion of convexity \n to make further progress. In particular\, we show that
 \, if $A+A$ is sufficiently small and $f$ \nsatisfies this hyperconvexity 
 condition\, then we have unbounded growth for sums of $f(A)$. \nThis in tu
 rn gives new results for iterated product sets of a set with small sum set
 .\n\nTitle: An update on the state-of-the-art sum-product inequality over 
 the reals \nAbstract: The aim of this somewhat technical talk is to clarif
 y the underlying constructions \nand present a streamlined step-by-step se
 lf-contained proof of the sum-product inequality \nof Solymosi\, Konyagin 
 and Shkredov. The proof ends up with a slightly better exponent \n$4/3+2/1
 167$ than the previous world record. \n\nJoint work with Sophie Stevens.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Senia Sheydvassar (CUNY Graduate Center and Technion - Israel Inst
 itute of Technology)
DTSTART:20200604T143000Z
DTEND:20200604T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/46
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/46/">A twisted Euclidean algorithm</a>\nby Senia Sheydvassar (CUNY Gra
 duate Center and Technion - Israel Institute of Technology) as part of Com
 binatorial and additive number theory (CANT 2021)\n\n\nAbstract\nConsideri
 ng that it is millennia old\, it is surprising how useful the Euclidean al
 gorithm still is \nand how often it yields new insights. In this talk\, we
  will discuss an analog of the classical Euclidean \nalgorithm which appli
 es to rings equipped with an involution. We will show various applications
  \nof such an algorithm in number theory and geometry and potentially disc
 uss some open problems.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sophie Stevens (Johann Radon Institute for Computational and Appli
 ed Mathematics (RICAM)\, Austria)
DTSTART:20200604T150000Z
DTEND:20200604T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/47
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/47/">An update on the sum-product problem</a>\nby Sophie Stevens (Joha
 nn Radon Institute for Computational and Applied Mathematics (RICAM)\, Aus
 tria) as part of Combinatorial and additive number theory (CANT 2021)\n\n\
 nAbstract\nIn new work with Misha Rudnev\, we prove a stronger bound on \n
 the sum-product problem\, showing that \n$\\max(|A+A|\,|AA|)\\geq |A|^{\\f
 rac{4}{3}+\\frac{2}{1167}-o(1)}$ for a finite set \n$A\\subseteq \\mathbb{
 R}$. This builds upon the work of Solymosi\, Konyagin \nand Shkredov\, alt
 hough our paper is self-contained. I will give an overview \nof the argume
 nts\, both old and new\,  and describe some  consequences \nof the new arg
 uments.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Trevor Wooley (Purdue University)
DTSTART:20200604T153000Z
DTEND:20200604T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/48
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/48/">Condensation and densification for sets of large diameter</a>\nby
  Trevor Wooley (Purdue University) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\n\nAbstract\nConsider a set of integers $A$ hav
 ing finite diameter $X$\, so that\n\\[\n\\sup A-\\inf A=X<\\infty \,\n\\]\
 nand a system of simultaneous polynomial equations $P_1(\\mathbf x)=\\ldot
 s \n=P_r(\\mathbf x)=0$ to be solved with $\\mathbf x\\in A^s$. In many ci
 rcumstances\, one can \nshow that the number $N(A\;\\mathbf P)$ of solutio
 ns of this system satisfies \n$N(A\;\\mathbf P)\\ll X^\\epsilon |A|^\\thet
 a$ for a suitable $\\theta < s$ and any $\\epsilon>0$. \nSuch is the case 
 with modern variants of Vinogradov's mean value theorem due to the \nautho
 r\, and likewise Bourgain\, Demeter and Guth. These estimates become worse
  than trivial \nwhen the diameter $X$ is very large compared to $|A|$\, or
  equivalently\, when the set $A$ is \nvery sparse. This motivates the prob
 lem of seeking new sets of integers $A'$ in a certain \nsense ``isomorphic
 '' to $A$ having the property that (i) the diameter $X'$ of $A'$ is smalle
 r \nthan $X$\, and (ii) the set $A'$ preserves the salient features of the
  solution set of the \nsystem of equations $P_1(\\mathbf x)=\\ldots =P_r(\
 \mathbf x)=0$. We will report on our \nspeculative meditations (both resul
 ts and non-results) concerning this problem closely \nassociated with the 
 topic of Freiman homomorphisms.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Renling Jin (College of Charleston)
DTSTART:20200604T170000Z
DTEND:20200604T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/49
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/49/">Szemeredi's theorem\, nonstandardized and simplified</a>\nby Renl
 ing Jin (College of Charleston) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\n\nAbstract\nWe will present a "simple" nonstandar
 d \nproof of Szemerédi's theorem for four-term arithmetic progressions \n
 based on Terence Tao's interpretation of Szemer\\' edi's original idea.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Glasscock (University of Massachusetts\, Lowell)
DTSTART:20200604T173000Z
DTEND:20200604T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/50
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/50/">Uniformity in the dimension of sumsets of $p$- and $q$-invariant 
 sets\, with applications in the integers</a>\nby Daniel Glasscock (Univers
 ity of Massachusetts\, Lowell) as part of Combinatorial and additive numbe
 r theory (CANT 2021)\n\n\nAbstract\nHarry Furstenberg made a number of con
 jectures in the 60's and 70Õs seeking \nto make precise the heuristic tha
 t there is no common structure between digit expansions \nof real numbers 
 in different bases.  Recent solutions to his conjectures  concerning the d
 imension \nof sumsets and intersections of times $p$- and $q$-invariant se
 ts now shed new light on old problems.  \nIn this talk\, I will explain ho
 w to use tools from fractal geometry and uniform distribution to get \nuni
 form estimates on the Hausdorff dimension of sumsets of times $p$- and $q$
 -invariant sets.  \nI will explain how these uniform estimates lead to app
 lications in the integers: the dimension \nof a sumset of a p-invariant se
 t and a q-invariant set in the integers is as large as it can be.  \n\nThi
 s talk is based on joint work with Joel Moreira and Florian Richter.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Neil Hindman (Howard University)
DTSTART:20200604T180000Z
DTEND:20200604T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/51
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/51/">Tensor products in $\\beta({\\mathbb N}\\times{\\mathbb N})$</a>\
 nby Neil Hindman (Howard University) as part of Combinatorial and additive
  number theory (CANT 2021)\n\n\nAbstract\nGiven a discrete space $S$\, the
  \nStone-Čech compactification $\\beta S$ of $S$\nconsists of all of the 
 ultrafilters on $S$. If\n$p\\in\\beta S$ and $q\\in\\beta T$\, then the {\
 \it tensor\nproduct\\/}\, $p\\otimes q\\in \\beta (S\\times T)$\nis define
 d by\n$$p\\otimes q=\\{A\\subseteq S\\times T:\\{x\\in S:\\{y\\in T:(x\,y)
 \\in A\\}\\in q\\}\\in p\\}\\\,.$$\nTensor products of members of $\\beta 
 {\\mathbb N}$ are intimately related to \naddition on ${\\mathbb N}$. If $
 \\sigma:{\\mathbb N}\\times{\\mathbb N}\\to{\\mathbb N}$ is\ndefined by $\
 \sigma(s\,t)=s+t$ and $\\widetilde \\sigma:\\beta({\\mathbb N}\\times{\\ma
 thbb N})\\to\n\\beta {\\mathbb N}$ is its continuous extension\, then for 
 any $p\,q\\in\\beta{\\mathbb N}$\,\n$\\widetilde\\sigma(p\\otimes q)=p+q$.
  Among our results are the \nfacts that if $S=({\\mathbb N}\,+)$ or $S=({\
 \mathbb R}_d\,+)$\, where\n${\\mathbb R}_d$ is ${\\mathbb R}$ with the dis
 crete topology\, and $S^*=\\beta S\\setminus S$\, then\n$S^*\\otimes S^*$ 
 misses the closure of the smallest ideal of $\\beta(S\\times S)$ and\n$\\b
 eta S\\otimes\\beta S$ is not a Borel subset of $\\beta(S\\times S)$. \n\n
 Joint work with  Dona Strauss.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert W. Donley\, Jr. (Queensborough Community College (CUNY))
DTSTART:20200604T183000Z
DTEND:20200604T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/52
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/52/">Semi-magic matrices for dihedral groups</a>\nby Robert W. Donley\
 , Jr. (Queensborough Community College (CUNY)) as part of Combinatorial an
 d additive number theory (CANT 2021)\n\n\nAbstract\nIf the finite group $G
 $ acts on a finite set $X$\, then $G$ may be represented \nby a subgroup o
 f permutation matrices\, which in turn generate an algebra of semi-magic m
 atrices.  \nRecall that a semi-magic matrix is a square matrix with comple
 x coefficients whose rows and \ncolumns have a common line sum.  In the ca
 se of dihedral groups\, we apply character theory \nto recover the known c
 ounting formula for semi-magic matrices with fixed line sum and \ncoeffici
 ents in the natural numbers.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sandra Kingan (Brooklyn College (CUNY))
DTSTART:20200604T190000Z
DTEND:20200604T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/53
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/53/">$H$-critical graphs</a>\nby Sandra Kingan (Brooklyn College (CUNY
 )) as part of Combinatorial and additive number theory (CANT 2021)\n\n\nAb
 stract\nWe are interested in the class of 3-connected graphs with a minor 
 isomorphic to a specific 3-connected \ngraph $H$. A 3-connected graph is m
 inimally 3-connected if deleting any edge destroys 3-connectivity. \nSuppo
 se that $G$ is a simple 3-connected graph with a simple 3-connected minor 
 $H$.  \nWe say $G$ is $H$-critical\, if deleting any edge either destroys 
 3-connectivity or the $H$-minor. \nIf $H$ is minimally 3-connected\, then 
 $G$ is also minimally 3-connected\, and the class of $H$-critical \ngraphs
  is the class of minimally 3-connected graphs with an $H$ minor. \nIn gene
 ral\, however\, $H$ is not minimally 3-connected\, and in this case $H$-cr
 itical graphs are not \nminimally 3-connected graphs. Yet we have obtained
  splitter-type structural results for $H$-critical graphs \nthat are very 
 similar to Dawes' result on the structure of minimally 3-connected graphs.
  \nWe also get a result that is very similar to Halin's bound on the size 
 of minimally 3-connected graphs. \nI will present these results in this ta
 lk. The results are joint work with Joao Paulo Costalonga.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ethan White (University of British Columbia)
DTSTART:20200604T193000Z
DTEND:20200604T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/54
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/54/">Directions in $AG(2\,p)$ and the clique number of Paley graphs</a
 >\nby Ethan White (University of British Columbia) as part of Combinatoria
 l and additive number theory (CANT 2021)\n\n\nAbstract\nThe directions det
 ermined by a point set are the slopes of lines passing through at least tw
 o \npoints of the set. A seminal result of Rédei tells us that at least $
 (p+3)/2$ directions are determined \nby $p$ points in $AG(2\,p)$. We consi
 der cartesian product point sets\, i.e. a set of the form \n$A \\times B \
 \subset AG(2\,p)$\, where $p$ is prime\, $A$ and $B$ are subsets of $GF(p)
 $ each \nwith at least two elements and $|A||B| <p$. In this case\, we sho
 w that the number of directions \ndetermined is at least $|A||B| - \\min\\
 {|A|\,|B|\\} + 2$.  This gives an upper bound of about $\\sqrt{p/2}$ \non 
 the clique number of Paley graphs\, matching a bound obtained by Hanson an
 d Petridis last year. \nOur main tool is the use of the R\\'edei polynomia
 l with Sz\\H{o}nyi's extension. \n\nJoint work with Józseff Solymosi and 
 Daniel Di Benedetto.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chi Hoi Yip (University of British Columbia)
DTSTART:20200604T200000Z
DTEND:20200604T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/55
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/55/">On the clique number of Paley graphs of prime power order</a>\nby
  Chi Hoi Yip (University of British Columbia) as part of Combinatorial and
  additive number theory (CANT 2021)\n\n\nAbstract\nFinding a reasonably go
 od upper bound for the\nclique number of Paley graph is an old and open pr
 oblem in additive\ncombinatorics. A recent breakthrough by Hanson and Petr
 idis using\nStepanov's method gives an improved upper bound on $\\mathbb{F
 }_p$\, where $p\n\\equiv 1 \\pmod 4$. We extend their idea to the finite f
 ield $\\mathbb{F}_q$\,\nwhere $q=p^{2s+1}$ for a prime $p\\equiv 1 \\pmod 
 4$ and a non-negative\ninteger $s$. We show the clique number of the Paley
  graph over\n$\\mathbb{F}_{p^{2s+1}}$ is at most \n\\[\n\\min \\bigg(p^s \
 \bigg\\lceil\n\\sqrt{\\frac{p}{2}} \\bigg\\rceil\,\n\\sqrt{\\frac{q}{2}}+\
 \frac{p^s+1}{4}+\\frac{\\sqrt{2p}}{32}p^{s-1}\\bigg).\n\\]\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Javier Santiago (University of Puerto Rico)
DTSTART:20200604T203000Z
DTEND:20200604T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/56
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/56/">On permutation binomials of index $q^{e-1}+q^{e-2}+\\cdots+1$</a>
 \nby Javier Santiago (University of Puerto Rico) as part of Combinatorial 
 and additive number theory (CANT 2021)\n\n\nAbstract\nThe permutation bino
 mial $f(x) = x^r(x^{q-1} + A)$ was studied by K. Li\, L. Qu\, and X. Chen 
 \nover $\\mathbb{F}_{q^2}$. They found that for $1 \\leq r \\leq q+1$\, $f
 (x)$ is a permutation binomial \nif and only if $r = 1$. Over the finite f
 ield $\\mathbb{F}_{q^3}$ of odd characteristic\, X. Liu obtained \nan anal
 ogous result\, in which for $1 \\leq r \\leq q^2+q+1$\, $f(x)$ permutes $\
 \mathbb{F}_{q^3}$ \nif and only if $r = 1$. In this investigation\, we com
 plete the characterization for $f(x)$ \nover both $\\mathbb{F}_{q^2}$ and 
 $\\mathbb{F}_{q^3}$\, as well as obtain a complete characterization \nover
  $\\mathbb{F}_{q^4}$. Furthermore\, for  $e \\geq 5$\, we present some par
 tial results which narrow \ndown considerably the search for $r's$ that do
  indeed yield permutation binomials of the form \n$f(x) = x^r(x^{q-1} + A)
 $ over $\\mathbb{F}_{q^e}$.\n\nJoint work with Ariane Masuda and  Ivelisse
  Rubio.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yonutz V. Stanchescu (Afeka Academic College\, Tel Aviv\, Israel)
DTSTART:20200605T130000Z
DTEND:20200605T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/57
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/57/">Structural results for small doubling sets in 3-dimensional Eucli
 dean space</a>\nby Yonutz V. Stanchescu (Afeka Academic College\, Tel Aviv
 \, Israel) as part of Combinatorial and additive number theory (CANT 2021)
 \n\n\nAbstract\nWe shall present the proofs of some best possible structur
 al results for finite three-dimensional sets with a small doubling propert
 y.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sukumar Das Adhikari (Ramakrishna Mission Vivekananda Educational 
 and Research Institute (RKMVERI)\, India)
DTSTART:20200605T133000Z
DTEND:20200605T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/58
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/58/">Weighted generalization of a theorem of Gao</a>\nby Sukumar Das A
 dhikari (Ramakrishna Mission Vivekananda Educational and Research Institut
 e (RKMVERI)\, India) as part of Combinatorial and additive number theory (
 CANT 2021)\n\n\nAbstract\nGao proved that for a finite abelian group of or
 der $n$\, we have\n$E(G) = D(G) +n -1$\, where   $D(G)$ is the Davenport c
 onstant of $G$ and\n$E(G)$ is defined to be the\nsmallest natural number $
 k$ such that any sequence of $k$ elements in $G$\nhas a subsequence of len
 gth $n$ whose sum is zero.\nWe shall discuss a weighted generalization of 
 the above relation of Gao.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shalom Eliahou (Universit\\' e du Littoral C\\^ ote d'Opale\,  Fra
 nce)
DTSTART:20200605T140000Z
DTEND:20200605T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/59
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/59/">Some recent results on Wilf's conjecture</a>\nby Shalom Eliahou (
 Universit\\' e du Littoral C\\^ ote d'Opale\,  France) as part of Combinat
 orial and additive number theory (CANT 2021)\n\n\nAbstract\nA <i>numerical
  semigroup</i> is a submonoid  $S$ of the nonnegative integers with finite
  \ncomplement. Its \\emph{conductor} is the smallest integer $c \\ge 0$ su
 ch that $S$ contains \nall integers $z \\ge c$\, and its \\emph{left part}
  $L$ is the set of all $s \\in S$ such that $s < c$. \nIn 1978\, Wilf aske
 d whether the inequality $n|L| \\ge c$ always holds\, where $n$ is the lea
 st \nnumber of generators of $S$. This is now known as Wilf's conjecture. 
 \nIn this talk\, we present some recent results towards it\, using tools f
 rom commutative algebra \nand graph theory.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arie Bialostocki (University of Idaho)
DTSTART:20200605T143000Z
DTEND:20200605T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/60
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/60/">Zero-sum Ramsey theory: Origins\, present\, and future</a>\nby Ar
 ie Bialostocki (University of Idaho) as part of Combinatorial and additive
  number theory (CANT 2021)\n\n\nAbstract\nAs for the origins\, I will desc
 ribe the birth of the Erd\\H os-Ginzburg-Ziv theorem as I learned it \nfro
 m the late A. Ziv and A. Ginzburg in 2003.  A stimulating conversation wit
 h V. Milman \naround 1980 led me to a broader view of Ramsey Theory. \nI s
 hared some of the ideas with my friends Y. Caro and Y. Roditty. \nY. Caro 
 took a slightly different turn and made several significant contributions.
  \nIn the mid 80's I started my 15-year collaboration with my colleague P.
  Dierker.  In 1989\, \nR. Graham learned about the zero-sum tree conjectur
 e and popularized it. \nIt was solved  by Z. F\\" uredi and D. Kleitman\, 
 and\, independently\, by A. Schrijver \nand P. D. Seymour. In 1990 I visit
 ed Australia and was introduced to a young student M. Kisin\, \nwho made a
  significant contribution toward the multiplicity conjecture\, solved asym
 ptotically \nby Z. Fuͤredi and D. Kleitman. Another milestone was my join
 t paper with P. Erdős and H. Lefman\, \nwhich was the beginning of zero-s
 um theory on the integers. A few of my Ph.D students \nand some of my REU 
 students\, among them D. Grynkiewicz\, made some significant contributions
 . \nBut I believe that my last Ph.D student\, T.D. Luong\, paved the way t
 o future research\,  \nwhich I will call vanishing polynomials.\nThough th
 e abstract describes mainly the history\, much of the lecture will be devo
 ted \nto the present and the future.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Elsholtz (Graz University of Technology\, Austria)
DTSTART:20200605T150000Z
DTEND:20200605T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/61
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/61/">Sums of unit fractions</a>\nby Christian Elsholtz (Graz Universit
 y of Technology\, Austria) as part of Combinatorial and additive number th
 eory (CANT 2021)\n\n\nAbstract\nLet $f_k(m\,n)$ denote the\nnumber of solu
 tions of $\\frac{m}{n}= \\frac{1}{x_1} + \\cdots +\n\\frac{1}{x_k}$ in pos
 itive integers $x_i$.\nThe case $k=2$ is essentially a question on a divis
 or function\, and \nthe case $k=3$ is closely related to a sum of certain 
 divisor functions. \nFor the case $k=3\, m=4$ Erd\\H{o}s and Straus conjec
 tured that\n\\[\nf_3(4\,n)>0 \\text{ for all } n>1.\n\\] \nThe case $m=n=1
 $ received special attention\, and even has applications in discrete \ngeo
 metry.  We give a survey on previous results and report on new results \no
 ver the last years. \n\nTheorem 1: There are infinitely many primes $p$ wi
 th\n\\[\nf_3(m\,p)\\gg\\exp \\left(c_m \\frac{\\log p}{\\log \\log p}\\rig
 ht).\n\\]\n\nTheorem 2: For fixed $m$ and almost all integers $n$ one has:
  \n\\[\nf_3(m\,n)\\gg\n(\\log n)^{\\log 3+o_m(1)}.\n\\]\n\nTheorem 3: $f_3
 (4\,n)=O_{\\varepsilon}\\left(n^{3/5+\\varepsilon}\\right)$\, for\nall $\\
 varepsilon >0$.\nThere are related but more complicated bounds when $k\\ge
 q 4$.\n\nJoint work with T. Browning\, S. Planitzer\, and T. Tao.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Giorgis Petridis (The University of Georgia)
DTSTART:20200605T153000Z
DTEND:20200605T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/62
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/62/">A question of Bukh on sums of dilates</a>\nby Giorgis Petridis (T
 he University of Georgia) as part of Combinatorial and additive number the
 ory (CANT 2021)\n\n\nAbstract\nThere exists a $p<3$ with the property that
  for all real numbers $K$ and every finite subset $A$ \nof a commutative g
 roup that satisfies $|A+A| \\leq K |A|$\, the dilate sum \\[A+2 \\cdot A =
  \\{ a + b+b : a\, b \\in A\\}\\] \nhas size at most $K^p |A|$. This answe
 rs a question of Bukh. \n\nJoint work with Brandon Hanson.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Harald Helfgott (Universitat Gottigen)
DTSTART:20200605T170000Z
DTEND:20200605T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/63
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/63/">Optimality of the logarithmic upper-bound sieve\, with explicit e
 stimates</a>\nby Harald Helfgott (Universitat Gottigen) as part of Combina
 torial and additive number theory (CANT 2021)\n\n\nAbstract\nAt the simple
 st level\, an upper bound sieve of Selberg type is a choice of $\\rho(d)$\
 , $d\\leq D$\, with $\\rho(1)=1$\, such that\n$$S = \\sum_{n\\leq N} \\lef
 t(\\sum_{d|n} \\mu(d) \\rho(d)\\right)^2$$\nis as small as possible.\nThe 
 optimal choice of $\\rho(d)$ for given $D$ was found by Selberg. However\,
  for several applications\, it is better to work with functions $\\rho(d)$
  that are scalings of a given continuous or monotonic function $\\eta$. Th
 e question is then: What is the best function $\\eta$\, and how does $S$ f
 or given $\\eta$ and $D$ compare to $S$ for Selberg's choice? \n\nThe most
  common choice of $\\eta$ is that of Barban-Vehov (1968)\, which gives an 
 $S$ with the same main term as Selberg's $S$. We show that Barban and Veho
 v's choice is optimal among all $\\eta$\, not just (as we knew) when it co
 mes to the main term\, but even when it comes to the second-order term\, w
 hich is negative and which we determine explicitly. \n\nJoint work with Em
 anuel Carneiro\, Andrés Chirre and Julian Mejía-Cordero.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brian Hopkins (Saint Peter's University)
DTSTART:20200605T173000Z
DTEND:20200605T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/64
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/64/">Restricted multicompositions</a>\nby Brian Hopkins (Saint Peter's
  University) as part of Combinatorial and additive number theory (CANT 202
 1)\n\n\nAbstract\nIn 2007\, George Andrews introduced $k$-compositions\, \
 na generalization of integer compositions\, where each summand has $k$ pos
 sible colors\, \nexcept for the final part which must be color 1.  Last ye
 ar\, St\\'ephane Ouvry and \nAlexios Polychronakos introduced $g$-composit
 ions which allow for up to $g-2$ zeros \nbetween parts.  Although these do
  not have the same definition and came from very different\nmotivations (n
 umber theory and quantum mechanics\, respectively)\, \nwe will see that th
 ey are equivalent.  One reason these are compelling combinatorial objects 
 \nis their count: there are $(k+1)^{n-1}$ $k$-compositions of $n$.  \nResu
 lts from standard integer compositions can have interesting generalization
 s.  \nFor example\, there are three types of restricted compositions count
 ed by Fibonacci \nnumbers---parts 1 & 2\, odd parts\, and parts greater th
 an 1.  We will explore the diverging \nfamilies of recurrences that arise 
 from applying these restrictions to multicompositions.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:James Sellers (University of Minnesota\, Duluth)
DTSTART:20200605T180000Z
DTEND:20200605T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/65
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/65/">Garden of Eden partitions for Bulgarian and Austrian solitaire</a
 >\nby James Sellers (University of Minnesota\, Duluth) as part of Combinat
 orial and additive number theory (CANT 2021)\n\n\nAbstract\nIn the early 1
 980s\, Martin Gardner popularized the game called Bulgarian Solitaire thro
 ugh \nhis writings in Scientific American.  After a brief introduction to 
 the game\, we will discuss a few results \nproven about Bulgarian Solitair
 e around the time of the appearance of Gardner's article \nand then quickl
 y turn to the question of finding an exact formula for the number of Garde
 n of Eden \npartitions that arise in this game.   I will then introduce a 
 related game known as Austrian Solitaire \nand consider a similar question
  about the Garden of Eden states that appear.   \nThe talk will be complet
 ely self-contained and should be accessible to a wide ranging audience.  \
 nThis is joint work with Brian Hopkins and Robson da Silva.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jing-Jing Huang (University of Nevada\, Reno)
DTSTART:20200605T183000Z
DTEND:20200605T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/66
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/66/">Diophantine approximation on affine subspaces</a>\nby Jing-Jing H
 uang (University of Nevada\, Reno) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\n\nAbstract\nWe extend the classical theorem of
  Khintchine on metric diophantine approximation to affine \nsubspaces of $
 \\mathbf{R}^n$. In order to achieve this it is necessary to impose some co
 ndition on the \ndiophantine exponent of the matrix defining the affine su
 bspace.  Our result actually concerns the more \ngeneral Hausdorff measure
 \, which is known as the generalized Baker-Schmidt problem. \nWe solve thi
 s problem by establishing optimal estimates for the number of rational poi
 nts\nlying close to the affine subspace.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gabriel Conant (University  of Cambridge\, UK)
DTSTART:20200605T190000Z
DTEND:20200605T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/67
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/67/">Small tripling with forbidden bipartite configurations</a>\nby Ga
 briel Conant (University  of Cambridge\, UK) as part of Combinatorial and 
 additive number theory (CANT 2021)\n\n\nAbstract\nA finite subset $A$ of a
  group $G$ is said to have \\emph{$k$-tripling} \nif $|AAA|\\leq k|A|$. I 
 will report on recent joint work with A. Pillay\, in which \nwe study the 
 structure finite sets $A$ with $k$-tripling\, under the additional \nassum
 ption that the bipartite graph relation $xy\\in A$ omits some induced \nsu
 bgraph of a fixed size $d$. In this case\, we show that $A$ is approximate
 ly \na union of a bounded  number  of translates of a coset nilprogression
  in $G$ \nof bounded rank and step (where ``bounded" is in terms of $k$\, 
 $d$\, \nand a chosen approximation error $\\epsilon>0$). Our methods combi
 ne the work \nof Breuillard\, Green\, and Tao on the structure of approxim
 ate groups\, together \nwith model-theoretic tools based on the study of g
 roups definable in NIP theories.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noah Luntzlara (University of Michigan)
DTSTART:20200605T193000Z
DTEND:20200605T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/68
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/68/">Sets arising as minimal additive complements in the integers</a>\
 nby Noah Luntzlara (University of Michigan) as part of Combinatorial and a
 dditive number theory (CANT 2021)\n\n\nAbstract\nA subset $C$ of a group $
 G$ is a \\emph{minimal additive complement} to $W \\subseteq G$ \nif $C +W
  = G$ and if $C' + W \\neq G$ for any proper subset $C'\\subsetneq C$. \nW
 ork started by Nathanson has focused on which sets $W\\subseteq \\mathbb{Z
 }$ have minimal \nadditive complements. We instead investigate which sets 
 $C\\subseteq \\mathbb{Z}$ arise \nas minimal additive complements to some 
 set $W\\subseteq \\mathbb{Z}$. \nWe confirm a conjecture of Kwon in showin
 g that bounded below sets containing arbitrarily large \ngaps arise as min
 imal additive complements. We provide partial results for determining whic
 h \neventually periodic sets arise as minimal additive complements. We pla
 ce bounds on the density \n of sets which arise as minimal additive comple
 ments to finite sets\, including periodic sets which \n arise as minimal a
 dditive complements. We conclude with several conjectures and questions \n
  concerning the structure of minimal additive complements.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dylan King (Wake Forest University)
DTSTART:20200605T200000Z
DTEND:20200605T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/69
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/69/">Distribution of missing sums in correlated sumsets</a>\nby Dylan 
 King (Wake Forest University) as part of Combinatorial and additive number
  theory (CANT 2021)\n\n\nAbstract\nGiven a finite set of integers $A$\, it
 s sumset is $A+A:= \\{a_i+a_j \\mid \na_i\,a_j\\in A\\}$. We examine $|A+A
 |$ as a random variable\, where $A\\subset I_n = \n[0\,n-1]$\, the set of 
 integers from 0 to $n-1$\, so that each element of $I_n$ is \nin $A$ with 
 a fixed probability $p \\in (0\,1)$. Martin and O'Bryant studied the \ncas
 e in which $p=1/2$ and found a closed form for $\\mathbb{E}[|A+A|]$. Lazar
 ev\, \nMiller\, and O'Bryant extended the result to find a numerical estim
 ate for \n$\\text{Var}(|A+A|)$ and bounds on $m_{n\\\,\;\\\,p}(k) := \\mat
 hbb{P}(2n-1-|A+A|=k)$. \nTheir primary tool was a graph theoretic framewor
 k which we now generalize to \nprovide a closed form for $\\mathbb{E}[|A+A
 |]$ and $\\text{Var}(|A+A|)$ for all \n$p\\in (0\,1)$ and establish good b
 ounds for $\\mathbb{E}[|A+A|]$ and \n$m_{n\\\,\;\\\,p}(k)$. We extend the 
 graph theoretic framework originally introduced \nby Lazarev\, Miller\, an
 d O'Bryant to correlated sumsets $A+B$ where $B$ is \ncorrelated to $A$ by
  the probabilities $\\mathbb{P}(i\\in B \\mid i\\in A) = p_1$ \nand $\\mat
 hbb{P}(i\\in B \\mid i\\not\\in A) = p_2$. We provide some preliminary\nre
 sults towards finding $\\mathbb{E}[|A+B|]$ and $\\text{Var}(|A+B|)$ using 
 this \nframework. \n\nJoint work with Hung Chu Viet\, Noah Luntzlara\, Tho
 mas Martinez\, Lily Shao\, \nChenyang Sun\,  Victor Xu\, and Steven J. Mil
 ler.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alex Iosevich (University of Rochester)
DTSTART:20200605T203000Z
DTEND:20200605T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/70
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/70/">On discrete and continuous variants of the distance graph</a>\nby
  Alex Iosevich (University of Rochester) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\n\nAbstract\nGiven ${\\Bbb R}^d$ or ${\\B
 bb F}_q^d$\, where ${\\Bbb F}_q$ is the finite field with $q$ elements\, a
 nd a scalar $t$\, either in ${\\Bbb R}$ or ${\\Bbb F}_q$\, we can define t
 he distance 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 i
 f \n$$ {(x_1-y_1)}^2+\\dots+{(x_d-y_d)}^2=t.$$ \nOver the past 15 years\, 
 the theory of these graphs has undergone rapid development. We are going t
 o describe what is known and the challenges that lie ahead.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Curran (Williams College)
DTSTART:20200601T160000Z
DTEND:20200601T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/71
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/71/">Ehrhart theory and an explicit version of Khovanskii's theorem</a
 >\nby Michael Curran (Williams College) as part of Combinatorial and addit
 ive number theory (CANT 2021)\n\n\nAbstract\nA remarkable theorem due to K
 hovanskii asserts that for any finite subset $A$\nof an abelian group\, th
 e cardinality of the $h$-fold sumset $hA$ grows like a polynomial\nfor all
  sufficiently large $h$.\nHowever\, neither the polynomial nor what suffic
 iently large means are understood in general.\nWe use Ehrhart theory to gi
 ve a new proof of Khovanskii's theorem when\n$A \\subset \\mathbb{Z}^d$ th
 at gives new insights into the growth of the cardinality\nof sumsets. Our 
 approach allows us to obtain explicit formulae for $|hA|$ whenever\n$A \\s
 ubset \\mathbb{Z}^d$ contains $d + 2$ points that are valid for \\emph{all
 } $h$.\nIn the case that the convex hull $\\Delta_A$ of $A$ is a $d$-dimen
 sional simplex\,\nwe can also show that $|hA|$ grows polynomially whenever
 \n$h \\geq \\text{vol}(\\Delta_A) \\cdot d! - |A| + 2$.\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Akshat Mudgal (University of Bristol\, UK)
DTSTART:20200604T160000Z
DTEND:20200604T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/72
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/72/">Arithmetic combinatorics on Vinogradov systems</a>\nby Akshat Mud
 gal (University of Bristol\, UK) as part of Combinatorial and additive num
 ber theory (CANT 2021)\n\n\nAbstract\nIn this talk\, we consider the Vinog
 radov system of equations from an arithmetic\ncombinatorial point of view.
  The number of solutions of this system\, when the variables are\nrestrict
 ed to a set of real numbers $A$\, has been widely studied by researchers i
 n both\nanalytic number theory and harmonic analysis. In particular\,  the
 re has been a significant\namount of work regarding upper bounds for the n
 umber of solutions to the above system of\nequations.  The objective of ou
 r talk will be of a different flavour\, wherein we will try to address\nth
 e following question: Given a set $A$ with many solutions to the Vinogrado
 v system\,\nwhat other arithmetic properties can we infer about $A$?\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Fei Peng (Carnegie Mellon University)
DTSTART:20200605T160000Z
DTEND:20200605T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/73
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/73/">Distribution of missing differences in diffsets</a>\nby Fei Peng 
 (Carnegie Mellon University) as part of Combinatorial and additive number 
 theory (CANT 2021)\n\n\nAbstract\nLazarev\, Miller\, and O'Bryant investig
 ated the distribution of $|S+S|$\nfor $S$ chosen uniformly at random from 
 $\\{0\, 1\, \\dots\, n-1\\}$\, and proved the existence\nof a divot at mis
 sing 7 sums (the probability of missing exactly 7 sums is less than\nmissi
 ng 6 or missing 8 sums). We study related questions for $|S-S|$\, and show
  some divots\nfrom one end of the probability distribution\, $P(|S-S|=k)$\
 , as well as a peak at $k=4$\nfrom the other end\, $P(2n-1-|S-S|=k)$. A co
 rollary of our results is an asymptotic bound\nfor the number of complete 
 rulers of length $n$.\nJoint with Scott Harvey-Arnold and Steven J. Miller
 .\n
LOCATION:
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sean Prendiville (University of Lancaster\, UK)
DTSTART:20210524T120000Z
DTEND:20210524T122500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/74
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/74/">Extremal Sidon sets are Fourier uniform\, with arithmetic applica
 tions</a>\nby Sean Prendiville (University of Lancaster\, UK) as part of C
 ombinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/74/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Peter Pal Pach (TU Budapest\, Hungary)
DTSTART:20210524T123000Z
DTEND:20210524T125500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/75
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/75/">Sum-full sets are not zero-sum-free</a>\nby Peter Pal Pach (TU Bu
 dapest\, Hungary) as part of Combinatorial and additive number theory (CAN
 T 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/75/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Peter Bradshaw (University of Bristol\, UK)
DTSTART:20210524T130000Z
DTEND:20210524T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/76
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/76/">Energy bounds for k-fold sums in very convex sets</a>\nby Peter B
 radshaw (University of Bristol\, UK) as part of Combinatorial and additive
  number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/76/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sergei Konyagin (Steklov Mathematical  Institute\, Moscow\, Russia
 )
DTSTART:20210524T133000Z
DTEND:20210524T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/77
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/77/">Gaps between totients</a>\nby Sergei Konyagin (Steklov Mathematic
 al  Institute\, Moscow\, Russia) as part of Combinatorial and additive num
 ber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/77/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mel Nathanson (Lehman College (CUNY))
DTSTART:20210524T143000Z
DTEND:20210524T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/78
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/78/">Sidon systems for linear forms and the Bose-Chowla argument</a>\n
 by Mel Nathanson (Lehman College (CUNY)) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/78/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Misha Rudnev (University of Bristol\, UK)
DTSTART:20210524T150000Z
DTEND:20210524T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/79
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/79/">On distinct values of bilinear forms\, cross-ratios\, etc.</a>\nb
 y Misha Rudnev (University of Bristol\, UK) as part of Combinatorial and a
 dditive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/79/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sophie Stevens (Johan Radon Institute  (RICAM)\, Austria)
DTSTART:20210524T153000Z
DTEND:20210524T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/80
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/80/">On sumsets of convex functions</a>\nby Sophie Stevens (Johan Rado
 n Institute  (RICAM)\, Austria) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/80/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zoltan Furedi (University of Illinois at Urbana-Champaign)
DTSTART:20210524T160000Z
DTEND:20210524T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/81
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/81/">An upper bound on the size of Sidon sets</a>\nby Zoltan Furedi (U
 niversity of Illinois at Urbana-Champaign) as part of Combinatorial and ad
 ditive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/81/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Aled Walker (Trinity College Cambridge\, UK)
DTSTART:20210524T170000Z
DTEND:20210524T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/84
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/84/">Effective results on the size and structure of sumsets</a>\nby Al
 ed Walker (Trinity College Cambridge\, UK) as part of Combinatorial and ad
 ditive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/84/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mikhail Gabdullin (Steklov Mathematical Institute\, Russia)
DTSTART:20210524T173000Z
DTEND:20210524T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/85
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/85/">Sets whose differences avoid squares modulo m</a>\nby Mikhail Gab
 dullin (Steklov Mathematical Institute\, Russia) as part of Combinatorial 
 and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/85/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emmanuel Kowalski (ETH Zurich\, Switzerland)
DTSTART:20210526T140000Z
DTEND:20210526T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/86
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/86/">Some families of Sidon sets arising in algebraic geometry</a>\nby
  Emmanuel Kowalski (ETH Zurich\, Switzerland) as part of Combinatorial and
  additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/86/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oleksiy Klurman (University of Bristol\, UK)
DTSTART:20210524T180000Z
DTEND:20210524T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/87
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/87/">On the ``variants" of the Erdos discrepancy problem</a>\nby Oleks
 iy Klurman (University of Bristol\, UK) as part of Combinatorial and addit
 ive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/87/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Trevor Dion Wooley (Purdue University)
DTSTART:20210524T183000Z
DTEND:20210524T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/88
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/88/">Rudin\, polynomials\, and nested efficient congruencing</a>\nby T
 revor Dion Wooley (Purdue University) as part of Combinatorial and additiv
 e number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/88/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wolfgang Schmid (LAGA\, University of Paris 8\, France)
DTSTART:20210524T193000Z
DTEND:20210524T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/89
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/89/">Sequences of sets over finite abelian groups and  weighted zero-s
 um sequences</a>\nby Wolfgang Schmid (LAGA\, University of Paris 8\, Franc
 e) as part of Combinatorial and additive number theory (CANT 2021)\n\nAbst
 ract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/89/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noah Kravitz (Princeton University)
DTSTART:20210524T200000Z
DTEND:20210524T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/90
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/90/">Inverse problems for minimal complements</a>\nby Noah Kravitz (Pr
 inceton University) as part of Combinatorial and additive number theory (C
 ANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/90/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Hough (SUNY at Stony Brook)
DTSTART:20210524T203000Z
DTEND:20210524T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/91
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/91/">Subconvexity of the Shintani zeta functions</a>\nby Robert Hough 
 (SUNY at Stony Brook) as part of Combinatorial and additive number theory 
 (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/91/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeffrey Lagarias (University of Michigan)
DTSTART:20210524T210000Z
DTEND:20210524T212500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/92
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/92/">Partial factorizations of  a generalized product of binomial coef
 ficients</a>\nby Jeffrey Lagarias (University of Michigan) as part of Comb
 inatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/92/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steve Senger (Missouri State University)
DTSTART:20210524T220000Z
DTEND:20210524T222500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/93
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/93/">Upper and lower bounds on chains determined by angles</a>\nby Ste
 ve Senger (Missouri State University) as part of Combinatorial and additiv
 e number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/93/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Audie Warren (Johan Radon  (RICAM)\, Austria)
DTSTART:20210525T120000Z
DTEND:20210525T122500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/94
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/94/">Additive and multiplicative Sidon sets</a>\nby Audie Warren (Joha
 n Radon  (RICAM)\, Austria) as part of Combinatorial and additive number t
 heory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/94/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Catherine Yan (Texas A & M University)
DTSTART:20210524T230000Z
DTEND:20210524T232500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/95
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/95/">Vector parking functions with rational boundary</a>\nby Catherine
  Yan (Texas A & M University) as part of Combinatorial and additive number
  theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/95/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tim Trudgian (UNSW Canberra at ADFA)
DTSTART:20210524T233000Z
DTEND:20210524T235500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/96
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/96/">Twenty-four carats of Goldbach oscillations</a>\nby Tim Trudgian 
 (UNSW Canberra at ADFA) as part of Combinatorial and additive number theor
 y (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/96/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kare Schou Gjaldbaek (CUNY)
DTSTART:20210524T223000Z
DTEND:20210524T225500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/97
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/97/">Classification of quadratic packing polynomials on sectors of $\\
 mathbb{R}^2$</a>\nby Kare Schou Gjaldbaek (CUNY) as part of Combinatorial 
 and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/97/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arturas Dubickas (Vilnius University\, Lithuania)
DTSTART:20210525T123000Z
DTEND:20210525T125500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/98
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/98/">On polynomial Sidon sequences</a>\nby Arturas Dubickas (Vilnius U
 niversity\, Lithuania) as part of Combinatorial and additive number theory
  (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/98/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jorg Brudern (Universitat Gottingen\, Germany)
DTSTART:20210525T130000Z
DTEND:20210525T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/99
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/99/">Expander estimates for cubes</a>\nby Jorg Brudern (Universitat Go
 ttingen\, Germany) as part of Combinatorial and additive number theory (CA
 NT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/99/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Imre Z. Ruzsa (Alfred Renyi Institute of Mathematics\, Hungary)
DTSTART:20210525T133000Z
DTEND:20210525T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/100
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/100/">Additive decomposition of square-free numbers</a>\nby Imre Z. Ru
 zsa (Alfred Renyi Institute of Mathematics\, Hungary) as part of Combinato
 rial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/100/
END:VEVENT
BEGIN:VEVENT
SUMMARY:I. D.  Shkredov (Steklov Mathematical Institute\, Russia)
DTSTART:20210525T143000Z
DTEND:20210525T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/101
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/101/">On an application of higher energies to Sidon sets</a>\nby I. D.
   Shkredov (Steklov Mathematical Institute\, Russia) as part of Combinator
 ial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/101/
END:VEVENT
BEGIN:VEVENT
SUMMARY:George Shakan (University of Oxford\, UK)
DTSTART:20210525T150000Z
DTEND:20210525T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/102
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/102/">A large gap in a dilate of a set</a>\nby George Shakan (Universi
 ty of Oxford\, UK) as part of Combinatorial and additive number theory (CA
 NT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/102/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anne de Roton (Universite de Lorraine\, France)
DTSTART:20210525T153000Z
DTEND:20210525T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/103
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/103/">Critical sets with small sumset in R</a>\nby Anne de Roton (Univ
 ersite de Lorraine\, France) as part of Combinatorial and additive number 
 theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/103/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yuri Tschinkel (New York University)
DTSTART:20210525T160000Z
DTEND:20210525T163000Z
DTSTAMP:20260413T051850Z
UID:CANT2020/104
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/104/">Arithmetic properties of equivariant birational types</a>\nby Yu
 ri Tschinkel (New York University) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/104/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Aliaksei Semchankau (Steklov Mathematical Institute\, Russia)
DTSTART:20210525T170000Z
DTEND:20210525T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/105
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/105/">A new bound for A(A + A) for large sets</a>\nby Aliaksei Semchan
 kau (Steklov Mathematical Institute\, Russia) as part of Combinatorial and
  additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/105/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Curran (University of Oxford\, UK)
DTSTART:20210525T173000Z
DTEND:20210525T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/106
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/106/">Sumset structure\, size\, and Ehrhart theory</a>\nby Michael Cur
 ran (University of Oxford\, UK) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/106/
END:VEVENT
BEGIN:VEVENT
SUMMARY:James Wheeler (University of Bristol\, UK)
DTSTART:20210525T180000Z
DTEND:20210525T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/107
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/107/">Incidence theorems for modular hyperbolae in positive characteri
 stic</a>\nby James Wheeler (University of Bristol\, UK) as part of Combina
 torial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/107/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lan Nguyen (University of Wisconsin - Parkside)
DTSTART:20210525T183000Z
DTEND:20210525T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/108
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/108/">On the existence of bi-Lipschitz equivalences and quasi-isometri
 es between arithmetic metric spaces with word metrics and the local-global
  principle</a>\nby Lan Nguyen (University of Wisconsin - Parkside) as part
  of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\
 n
LOCATION:https://master.researchseminars.org/talk/CANT2020/108/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Vaughan (Pennsylvania State University)
DTSTART:20210525T193000Z
DTEND:20210525T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/109
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/109/">On generating functions in additive number theory</a>\nby Robert
  Vaughan (Pennsylvania State University) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/109/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Souktik Roy (University of Illinois at Urbana-Champaign)
DTSTART:20210525T200000Z
DTEND:20210525T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/110
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/110/">Generalized sums and products</a>\nby Souktik Roy (University of
  Illinois at Urbana-Champaign) as part of Combinatorial and additive numbe
 r theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/110/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jianping Pan (University of California\, Davis)
DTSTART:20210525T203000Z
DTEND:20210525T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/111
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/111/">Tableaux and polynomial expansions</a>\nby Jianping Pan (Univers
 ity of California\, Davis) as part of Combinatorial and additive number th
 eory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/111/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel G. Glasscock (University of Massachusetts\, Lowell)
DTSTART:20210525T210000Z
DTEND:20210525T212500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/112
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/112/">Sums and intersections of multiplicatively invariant sets in the
  integers</a>\nby Daniel G. Glasscock (University of Massachusetts\, Lowel
 l) as part of Combinatorial and additive number theory (CANT 2021)\n\nAbst
 ract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/112/
END:VEVENT
BEGIN:VEVENT
SUMMARY:James Sellers (University of Minnesota Duluth)
DTSTART:20210525T220000Z
DTEND:20210525T222500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/113
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/113/">Sequentially congruent partitions and partitions into squares</a
 >\nby James Sellers (University of Minnesota Duluth) as part of Combinator
 ial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/113/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Dougherty-Bliss (Rutgers University - New Brunswick)
DTSTART:20210525T223000Z
DTEND:20210525T225500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/114
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/114/">More irrationally good approximations from Beukers integrals</a>
 \nby Robert Dougherty-Bliss (Rutgers University - New Brunswick) as part o
 f Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/114/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Russell Jay Hendel (Towson University)
DTSTART:20210525T230000Z
DTEND:20210525T232500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/115
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/115/">Sums of squares: Methods for proving identity families</a>\nby R
 ussell Jay Hendel (Towson University) as part of Combinatorial and additiv
 e number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/115/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Donley (Queensborough Community College (CUNY))
DTSTART:20210525T233000Z
DTEND:20210525T235500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/116
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/116/">Vandermonde convolution for ranked posets</a>\nby Robert Donley 
 (Queensborough Community College (CUNY)) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/116/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Olivine Silier (California Institute of Technology)
DTSTART:20210526T000000Z
DTEND:20210526T002500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/117
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/117/">Structural Szemeredi-Trotter theorem for lattices</a>\nby Olivin
 e Silier (California Institute of Technology) as part of Combinatorial and
  additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/117/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bhuwanesh Rao Patil (IIT Roorkee\, India)
DTSTART:20210526T113000Z
DTEND:20210526T115500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/118
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/118/">Multiplicative patterns in syndetic sets</a>\nby Bhuwanesh Rao P
 atil (IIT Roorkee\, India) as part of Combinatorial and additive number th
 eory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/118/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sean Eberhard (University of Cambridge\, UK)
DTSTART:20210526T120000Z
DTEND:20210526T122500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/119
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/119/">The apparent structure of dense Sidon sets</a>\nby Sean Eberhard
  (University of Cambridge\, UK) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/119/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carlo Sanna (Politecnico di Torino\, Italy)
DTSTART:20210526T123000Z
DTEND:20210526T125500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/120
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/120/">Additive bases and Niven numbers</a>\nby Carlo Sanna (Politecnic
 o di Torino\, Italy) as part of Combinatorial and additive number theory (
 CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/120/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oliver Roche-Newton (Johann Radon Institute (RICAM)\, Austria)
DTSTART:20210526T130000Z
DTEND:20210526T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/121
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/121/">The Elekes-Szabo Theorem and sum-product estimates for sparse gr
 aphs</a>\nby Oliver Roche-Newton (Johann Radon Institute (RICAM)\, Austria
 ) as part of Combinatorial and additive number theory (CANT 2021)\n\nAbstr
 act: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/121/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Harald Andres Helfgott (Universit\\" at Gottingen\, Germany)
DTSTART:20210526T133000Z
DTEND:20210526T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/122
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/122/">Expansion\, divisibility and parity</a>\nby Harald Andres Helfgo
 tt (Universit\\" at Gottingen\, Germany) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/122/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pooja Punyani (Indian Institute of Technology\, New Delhi\, India)
DTSTART:20210526T143000Z
DTEND:20210526T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/123
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/123/">On characterizing small changes in the Frobenius number</a>\nby 
 Pooja Punyani (Indian Institute of Technology\, New Delhi\, India) as part
  of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\
 n
LOCATION:https://master.researchseminars.org/talk/CANT2020/123/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Leonid Fel (Technion - Israel Institute of Technology\, Israel)
DTSTART:20210526T150000Z
DTEND:20210526T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/124
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/124/">Genera of numerical semigroups and polynomial identities for deg
 rees of syzygies</a>\nby Leonid Fel (Technion - Israel Institute of Techno
 logy\, Israel) as part of Combinatorial and additive number theory (CANT 2
 021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/124/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Neil Hindman (Howard University)
DTSTART:20210526T160000Z
DTEND:20210526T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/125
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/125/">Strongly image partition regular matrices</a>\nby Neil Hindman (
 Howard University) as part of Combinatorial and additive number theory (CA
 NT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/125/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lajos Hajdu (University of Debrecen\, Hungary)
DTSTART:20210526T170000Z
DTEND:20210526T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/126
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/126/">Multiplicative (in)decomposability of polynomial sequences</a>\n
 by Lajos Hajdu (University of Debrecen\, Hungary) as part of Combinatorial
  and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/126/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zachary Chase (University of Oxford\, UK)
DTSTART:20210526T173000Z
DTEND:20210526T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/127
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/127/">A random analogue of Gilbreath's conjecture</a>\nby Zachary Chas
 e (University of Oxford\, UK) as part of Combinatorial and additive number
  theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/127/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sandor Kiss (Budapest University of Technology and Economics\, Hun
 gary)
DTSTART:20210526T153000Z
DTEND:20210526T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/128
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/128/">Generalized Sidon sets of perfect powers</a>\nby Sandor Kiss (Bu
 dapest University of Technology and Economics\, Hungary) as part of Combin
 atorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/128/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Konstantin Olmezov (Moscow Institute of Physics and Technology\, R
 ussia)
DTSTART:20210526T180000Z
DTEND:20210526T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/129
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/129/">On additive energy of convex sets with higher concavity</a>\nby 
 Konstantin Olmezov (Moscow Institute of Physics and Technology\, Russia) a
 s part of Combinatorial and additive number theory (CANT 2021)\n\nAbstract
 : TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/129/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Pollack (University of Georgia)
DTSTART:20210526T183000Z
DTEND:20210526T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/130
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/130/">Multiplicative orders mod p</a>\nby Paul Pollack (University of 
 Georgia) as part of Combinatorial and additive number theory (CANT 2021)\n
 \nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/130/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alex Rice (Millsaps College)
DTSTART:20210526T190000Z
DTEND:20210526T192500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/131
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/131/">Two constructions related to well-known distance problems</a>\nb
 y Alex Rice (Millsaps College) as part of Combinatorial and additive numbe
 r theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/131/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sinai Robins (University of Sao Paolo\, Brazil)
DTSTART:20210526T200000Z
DTEND:20210526T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/132
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/132/">The null set of a of a polytope\, and the Pompeiu property for p
 olytopes</a>\nby Sinai Robins (University of Sao Paolo\, Brazil) as part o
 f Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/132/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Richard Magner (Boston University)
DTSTART:20210526T203000Z
DTEND:20210526T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/133
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/133/">Classifying partition regular polynomials in a nonlinear family<
 /a>\nby Richard Magner (Boston University) as part of Combinatorial and ad
 ditive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/133/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steve Miller (Williams College)
DTSTART:20210526T210000Z
DTEND:20210526T212500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/134
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/134/">Completeness of generalized Fibonacci sequences</a>\nby Steve Mi
 ller (Williams College) as part of Combinatorial and additive number theor
 y (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/134/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Geertrui Van de Voorde (University of Canterbury\, New Zealand)
DTSTART:20210526T220000Z
DTEND:20210526T222500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/135
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/135/">On the product of elements with prescribed trace</a>\nby Geertru
 i Van de Voorde (University of Canterbury\, New Zealand) as part of Combin
 atorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/135/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arthur Paul Pedersen (City College (CUNY))
DTSTART:20210526T223000Z
DTEND:20210526T225500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/136
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/136/">The Hahn-H\\" older theorem</a>\nby Arthur Paul Pedersen (City C
 ollege (CUNY)) as part of Combinatorial and additive number theory (CANT 2
 021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/136/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brian McDonald (University of Rochester)
DTSTART:20210526T230000Z
DTEND:20210526T232500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/137
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/137/">Cycles of arbitrary length in distance graphs on $\\mathbb{F}_q^
 d$</a>\nby Brian McDonald (University of Rochester) as part of Combinatori
 al and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/137/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ognian Trifonov (University of South Carolina)
DTSTART:20210527T000000Z
DTEND:20210527T002500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/138
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/138/">Extreme covering systems of the integers</a>\nby Ognian Trifonov
  (University of South Carolina) as part of Combinatorial and additive numb
 er theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/138/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noah Lebowitz-Lockard
DTSTART:20210526T233000Z
DTEND:20210526T235500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/139
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/139/">On factorizations into distinct parts</a>\nby Noah Lebowitz-Lock
 ard as part of Combinatorial and additive number theory (CANT 2021)\n\nAbs
 tract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/139/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Javier Pliego (University of Bristol\, UK)
DTSTART:20210527T113000Z
DTEND:20210527T115500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/140
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/140/">Uniform bounds in Waring's problem over diagonal forms</a>\nby J
 avier Pliego (University of Bristol\, UK) as part of Combinatorial and add
 itive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/140/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinhui Fang (Nanjing University of Information Science and Technol
 ogy\, China)
DTSTART:20210527T120000Z
DTEND:20210527T122500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/141
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/141/">On generalized perfect difference sumset</a>\nby Jinhui Fang (Na
 njing University of Information Science and Technology\, China) as part of
  Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/141/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Norbert Hegyvari (Eotvos University and Renyi Institute\, Hungary)
DTSTART:20210527T123000Z
DTEND:20210527T125500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/142
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/142/">Communication complexity\, coding\, and combinatorial number the
 ory</a>\nby Norbert Hegyvari (Eotvos University and Renyi Institute\, Hung
 ary) as part of Combinatorial and additive number theory (CANT 2021)\n\nAb
 stract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/142/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Qinghai Zhong (Universitat Graz\, Austria)
DTSTART:20210527T130000Z
DTEND:20210527T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/143
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/143/">On product-one sequences over subsets of groups</a>\nby Qinghai 
 Zhong (Universitat Graz\, Austria) as part of Combinatorial and additive n
 umber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/143/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oriol Serra (Universitat Politecnica de Catalunya\, Barcelona)
DTSTART:20210527T133000Z
DTEND:20210527T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/144
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/144/">Triangulations and the Brunn--Minkowski inequality</a>\nby Oriol
  Serra (Universitat Politecnica de Catalunya\, Barcelona) as part of Combi
 natorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/144/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yifan Jing (University of Illinois at Urbana-Champaign)
DTSTART:20210527T143000Z
DTEND:20210527T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/145
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/145/">Minimal and nearly minimal measure expansions in connected local
 ly compact groups</a>\nby Yifan Jing (University of Illinois at Urbana-Cha
 mpaign) as part of Combinatorial and additive number theory (CANT 2021)\n\
 nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/145/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Scott Chapman (Sam Houston State University)
DTSTART:20210527T150000Z
DTEND:20210527T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/146
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/146/">When Is a Puiseux monoid atomic?</a>\nby Scott Chapman (Sam Hous
 ton State University) as part of Combinatorial and additive number theory 
 (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/146/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Baginski (Fairfield University)
DTSTART:20210527T153000Z
DTEND:20210527T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/147
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/147/">Abundant numbers\, semigroup ideals\, and nonunique factorizatio
 n</a>\nby Paul Baginski (Fairfield University) as part of Combinatorial an
 d additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/147/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jozsef Balogh (University of Illinois at Urbana-Champaign)
DTSTART:20210527T160000Z
DTEND:20210527T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/148
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/148/">On  the lower bound on Folkman cube</a>\nby Jozsef Balogh (Unive
 rsity of Illinois at Urbana-Champaign) as part of Combinatorial and additi
 ve number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/148/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Fatma Karaoglu (Tekirdag Namik Kemal University\, Turkey)
DTSTART:20210527T170000Z
DTEND:20210527T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/149
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/149/">On the number of lines of a smooth cubic surface</a>\nby Fatma K
 araoglu (Tekirdag Namik Kemal University\, Turkey) as part of Combinatoria
 l and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/149/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mehdi Makhul (Johann Radon Institute (RICAM)\, Austria)
DTSTART:20210527T173000Z
DTEND:20210527T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/150
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/150/">The Elekes-Szabo problem and the uniformity conjecture</a>\nby M
 ehdi Makhul (Johann Radon Institute (RICAM)\, Austria) as part of Combinat
 orial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/150/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Elsholtz (Graz University of Technology\, Austria)
DTSTART:20210527T180000Z
DTEND:20210527T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/151
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/151/">Fermat's Last Theorem Implies Euclid's infinitude of primes</a>\
 nby Christian Elsholtz (Graz University of Technology\, Austria) as part o
 f Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/151/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Grynkiewicz (University of Memphis)
DTSTART:20210527T183000Z
DTEND:20210527T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/152
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/152/">Characterizing infinite subsets of lattice points having finite-
 like behavior</a>\nby David Grynkiewicz (University of Memphis) as part of
  Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/152/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Thai Hoang Le (University of Mississippi)
DTSTART:20210527T193000Z
DTEND:20210527T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/153
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/153/">Bohr sets in sumsets</a>\nby Thai Hoang Le (University of Missis
 sippi) as part of Combinatorial and additive number theory (CANT 2021)\n\n
 Abstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/153/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Karyn McLellan (Mount Saint Vincent University\,  Canada)
DTSTART:20210527T200000Z
DTEND:20210527T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/154
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/154/">A problem on generating sets containing Fibonacci numbers</a>\nb
 y Karyn McLellan (Mount Saint Vincent University\,  Canada) as part of Com
 binatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/154/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Max Wenqiang Xu (Stanford University)
DTSTART:20210527T203000Z
DTEND:20210527T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/155
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/155/">Discrepancy in modular arithmetic progressions</a>\nby Max Wenqi
 ang Xu (Stanford University) as part of Combinatorial and additive number 
 theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/155/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anqi Li (MIT)
DTSTART:20210527T210000Z
DTEND:20210527T212500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/156
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/156/">Local properties of difference sets</a>\nby Anqi Li (MIT) as par
 t of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA
 \n
LOCATION:https://master.researchseminars.org/talk/CANT2020/156/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ryan Ronan (Baruch College (CUNY))
DTSTART:20210527T220000Z
DTEND:20210527T222500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/157
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/157/">An asymptotic for the growth of Markoff-Hurwitz tuples</a>\nby R
 yan Ronan (Baruch College (CUNY)) as part of Combinatorial and additive nu
 mber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/157/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Esther Banaian (University of Minnesota)
DTSTART:20210527T223000Z
DTEND:20210527T225500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/158
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/158/">A generalization of Markov numbers</a>\nby Esther Banaian (Unive
 rsity of Minnesota) as part of Combinatorial and additive number theory (C
 ANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/158/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gabriela Araujo-Pardo (Universidad Nacional Autonoma de Mexico\, M
 exico)
DTSTART:20210527T230000Z
DTEND:20210527T232500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/159
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/159/">Complete colorings on circulant graphs and digraphs</a>\nby Gabr
 iela Araujo-Pardo (Universidad Nacional Autonoma de Mexico\, Mexico) as pa
 rt of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TB
 A\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/159/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kaylee Weatherspoon (University of South Carolina)
DTSTART:20210527T233000Z
DTEND:20210527T235500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/160
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/160/">A description of edge-maximal separable unit distance graphs in 
 the plane</a>\nby Kaylee Weatherspoon (University of South Carolina) as pa
 rt of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: TB
 A\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/160/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paolo Leonetti (Universita Bocconi\, Milano\, Italy)
DTSTART:20210528T120000Z
DTEND:20210528T122500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/161
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/161/">On Poissonian pair correlation sequences with few gaps</a>\nby P
 aolo Leonetti (Universita Bocconi\, Milano\, Italy) as part of Combinatori
 al and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/161/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emma Bailey (University of Bristol\, UK)
DTSTART:20210528T123000Z
DTEND:20210528T125500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/162
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/162/">Generalized moments and large deviations of random matrix polyno
 mials and L-functions</a>\nby Emma Bailey (University of Bristol\, UK) as 
 part of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: 
 TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/162/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Louis-Pierre Arguin (Baruch College (CUNY))
DTSTART:20210528T130000Z
DTEND:20210528T132500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/163
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/163/">The Fyodorov-Hiary-Keating conjecture</a>\nby Louis-Pierre Argui
 n (Baruch College (CUNY)) as part of Combinatorial and additive number the
 ory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/163/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shalom Eliahou (Universite du Littoral Cote d'Opale\, France)
DTSTART:20210528T133000Z
DTEND:20210528T135500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/164
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/164/">Optimal bounds on the growth of iterated sumsets in abelian semi
 groups</a>\nby Shalom Eliahou (Universite du Littoral Cote d'Opale\, Franc
 e) as part of Combinatorial and additive number theory (CANT 2021)\n\nAbst
 ract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/164/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Karameh Muneer (Palestine Polytechnic University\, Palestine)
DTSTART:20210528T140000Z
DTEND:20210528T142500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/165
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/165/">Generalizations of B. Berggren and Price matrices</a>\nby Karame
 h Muneer (Palestine Polytechnic University\, Palestine) as part of Combina
 torial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/165/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Valerie Berthe (Universite de Paris\, CNRS\, France)
DTSTART:20210528T143000Z
DTEND:20210528T145500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/166
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/166/">Dynamics of  Ostrowski's numeration: Limit laws and  Hausdorff d
 imensions</a>\nby Valerie Berthe (Universite de Paris\, CNRS\, France) as 
 part of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: 
 TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/166/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tom Slattery (University of Warwick\, UK)
DTSTART:20210528T150000Z
DTEND:20210528T152500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/167
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/167/">On Fibonacci partitions</a>\nby Tom Slattery (University of Warw
 ick\, UK) as part of Combinatorial and additive number theory (CANT 2021)\
 n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/167/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ayesha Hussain (University of Bristol\, UK)
DTSTART:20210528T153000Z
DTEND:20210528T155500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/168
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/168/">Distributions of Dirichlet character sums</a>\nby Ayesha Hussain
  (University of Bristol\, UK) as part of Combinatorial and additive number
  theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/168/
END:VEVENT
BEGIN:VEVENT
SUMMARY:George Andrews (Pennsylvania State University)
DTSTART:20210528T160000Z
DTEND:20210528T162500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/169
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/169/">Schmidt Type partitions and modular forms</a>\nby George Andrews
  (Pennsylvania State University) as part of Combinatorial and additive num
 ber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/169/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maciej Ulas (Jagiellonian University\, Krakow\, Poland)
DTSTART:20210528T170000Z
DTEND:20210528T172500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/170
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/170/">Equal values of certain partition functions via Diophantine equa
 tions</a>\nby Maciej Ulas (Jagiellonian University\, Krakow\, Poland) as p
 art of Combinatorial and additive number theory (CANT 2021)\n\nAbstract: T
 BA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/170/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Akshat Mudgal (University of Bristol\, UK)
DTSTART:20210528T173000Z
DTEND:20210528T175500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/171
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/171/">Additive energies on spheres</a>\nby Akshat Mudgal (University o
 f Bristol\, UK) as part of Combinatorial and additive number theory (CANT 
 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/171/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Krystian Gajdzica (Jagiellonian University\, Krakow\, Poland)
DTSTART:20210528T180000Z
DTEND:20210528T182500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/172
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/172/">Arithmetic properties of the restricted partition function p_A(n
 \,k)</a>\nby Krystian Gajdzica (Jagiellonian University\, Krakow\, Poland)
  as part of Combinatorial and additive number theory (CANT 2021)\n\nAbstra
 ct: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/172/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alex Iosevich (University of Rochester)
DTSTART:20210528T183000Z
DTEND:20210528T185500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/173
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/173/">Uniform distribution and incidence theorems</a>\nby Alex Iosevic
 h (University of Rochester) as part of Combinatorial and additive number t
 heory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/173/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Joshua Cooper (University of South Carolina)
DTSTART:20210528T193000Z
DTEND:20210528T195500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/174
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/174/">Uniform distribution and incidence theorems</a>\nby Joshua Coope
 r (University of South Carolina) as part of Combinatorial and additive num
 ber theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/174/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Danielle Cox (Mount Saint Vincent University\, Canada)
DTSTART:20210528T200000Z
DTEND:20210528T202500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/175
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/175/">A sequence arising from diffusion in graphs</a>\nby Danielle Cox
  (Mount Saint Vincent University\, Canada) as part of Combinatorial and ad
 ditive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/175/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mizan R. Khan (Eastern Connecticut State University)
DTSTART:20210528T203000Z
DTEND:20210528T205500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/176
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/176/">To count clean triangles we count on $imph$</a>\nby Mizan R. Kha
 n (Eastern Connecticut State University) as part of Combinatorial and addi
 tive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/176/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amanda Francis (Mathematical Reviews\, AMS)
DTSTART:20210528T210000Z
DTEND:20210528T212500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/177
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/177/">Sequences of integers related to resistance distance in structur
 ed graphs</a>\nby Amanda Francis (Mathematical Reviews\, AMS) as part of C
 ombinatorial and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/177/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shane Chern (Pennsylvania State University)
DTSTART:20210528T220000Z
DTEND:20210528T222500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/178
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/178/">Euclidean billiard partitions</a>\nby Shane Chern (Pennsylvania 
 State University) as part of Combinatorial and additive number theory (CAN
 T 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/178/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chi Hoi Yip (University of British Columbia\, Canada)
DTSTART:20210528T223000Z
DTEND:20210528T225500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/179
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/179/">Gauss sums and the maximum cliques in generalized Paley graphs o
 f square order</a>\nby Chi Hoi Yip (University of British Columbia\, Canad
 a) as part of Combinatorial and additive number theory (CANT 2021)\n\nAbst
 ract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/179/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brad Isaacson (New York City College of Technology (CUNY))
DTSTART:20210528T230000Z
DTEND:20210528T232500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/180
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/180/">Three imprimitive character sums</a>\nby Brad Isaacson (New York
  City College of Technology (CUNY)) as part of Combinatorial and additive 
 number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/180/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yaghoub Rahimi (Georgia Institute of Technology)
DTSTART:20210528T233000Z
DTEND:20210528T235500Z
DTSTAMP:20260413T051850Z
UID:CANT2020/181
DESCRIPTION:Title: <a href="https://master.researchseminars.org/talk/CANT2
 020/181/">Endpoint $\\ell^p $ improving estimates for prime averages</a>\n
 by Yaghoub Rahimi (Georgia Institute of Technology) as part of Combinatori
 al and additive number theory (CANT 2021)\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/CANT2020/181/
END:VEVENT
END:VCALENDAR