1 citations · 1 across the 6 of their papers we have counts for
8 papers
Randomly piercing algebraic sets
Daniel Altman, Nathan Tung
We show, for example, that if one samples \[\frac{\log p}{2\log(1+(p-1)^{-1})} \cdot n^2(1 + o_{n\to \infty}(1))\] points in at random then asymptotically almost s…
Local aspects of the Sidorenko property for linear equations
Daniel Altman
A system of linear equations in is \textit{Sidorenko} if any subset of contains at least as many solutions to the system as a random set of the sa…
On the smallest gap in a sequence with Poisson pair correlations
Daniel Altman, Zachary Chase
We prove that any increasing sequence of real numbers with average gap and Poisson pair correlations has some gap that is at least . This improves upon a result of…
On a question of Alon
Daniel Altman
A system of linear equations in is \textit{common} if every two-colouring of yields at least as many monochromatic solutions as a random two-colou…
A non-flag arithmetic regularity lemma and counting lemma
Daniel Altman
Green and Tao's arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the `flag condition…
On a conjecture of Gowers and Wolf
Daniel Altman
Gowers and Wolf have conjectured that, given a set of linear forms each mapping to , if is an integer such that the functions $ψ_1^…
On Szemerédi's theorem with differences from a random set
Daniel Altman
We consider, over both the integers and finite fields, Szemerédi's theorem on -term arithmetic progressions where the set of allowed common differences in those progressions…
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
Daniel Altman, Catherine Greenhill, Mikhail Isaev +1
Let denote a uniformly random -regular -uniform hypergraph on vertices, where is a fixed constant and may grow with . An -overl…