Searcharxiv⌕ Search

arXiv subjects

Daniel Altman

Publications and source records attributed to Daniel Altman.

12 recordsLinked to original sources
arXiv2026

Randomly piercing algebraic sets

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 $\mathbb{F}_p^n$ at random then asymptotically almost surely this set intersects every quadratic hypersurface. We furthermore show that this is tight in that sampling $o_{n\to\infty}(n^2)$ fewer points almost surely fails to intersect some quadratic hypersurface. Our main result is a sharp threshold for the following problem: how many points in $\mathbb{F}_p^n$ does one need to randomly sample to almost surely intersect every algebraic set defined by at most $s$ polynomials each of degree at most $k$? As an application we improve lower bounds in the random Szemer\'{e}di theorem in $\mathbb{F}_p^n$, in particular obtaining a leading constant which grows as the threshold for what is considered a `dense' set in Szemer\'{e}di's theorem shrinks.

math.NT↗
arXiv2025

Deterministic polynomial factorisation modulo many primes

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an irreducible polynomial $f \in \mathbb{Z}[x]$, and computes the factorisation of its reductions modulo $p$ for all primes $p$ up to a prescribed bound $N$. The \emph{average running time per prime} is polynomial in the size of the input and the degree of the splitting field of $f$ over $\mathbb{Q}$. In particular, if $f$ is Galois, we succeed in factoring in (amortised) deterministic polynomial time.

math.NT↗
arXiv2025

On polynomial progressions via transference

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers with fixed polynomial common difference. That is, we prove for any polynomial $P(y)\in \mathbb{Z}[y]$ with $P(0) = 0$, that the largest subset $A\subseteq [N]$ avoiding the pattern \[x, x+P(y),\ldots, x+ kP(y)\] has size bounded by $\ll_{P,k}N(\log\log\log N)^{-\Omega_{P,k}(1)}.$

math.NT↗
arXiv2024

On the uncommonness of minimal rank-2 systems of linear equations

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a $(2\times k)$-system as a minimal subsystem is uncommon.

math.CO↗
arXiv2022

Local aspects of the Sidorenko property for linear equations

A system of linear equations in $\mathbb{F}_p^n$ is \textit{Sidorenko} if any subset of $\mathbb{F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty$. A system of linear equations is \textit{common} if any 2-colouring of $\mathbb{F}_p^n$ yields at least as many monochromatic solutions to the system of equations as a random 2-colouring, asymptotically as $n\to \infty$. Both classification problems remain wide open despite recent attention. We show that a certain generic family of systems of two linear equations is not Sidorenko. In fact, we show that systems in this family are not locally Sidorenko, and that systems in this family which do not contain additive tuples are not weakly locally Sidorenko. This endeavour answers a conjecture and question of Kam\v{c}ev--Liebenau--Morrison. Insofar as methods, we observe that the true complexity of a linear system is not maintained under Fourier inversion; our main novelty is the use of higher-order methods in the frequency space of systems which have complexity one. We also give a shorter proof of the recent result of Kam\v{c}ev--Liebenau--Morrison and independently Versteegen that any linear system containing a four term arithmetic progression is uncommon.

math.CO↗
arXiv2022

On a question of Alon

A system of linear equations in $\mathbb{F}_p^n$ is \textit{common} if every two-colouring of $\mathbb{F}_p^n$ yields at least as many monochromatic solutions as a random two-colouring, asymptotically as $n \to \infty$. By analogy to the graph-theoretic setting, Alon has asked whether any (non-Sidorenko) system of linear equations can be made uncommon by adding sufficiently many free variables. Fox, Pham and Zhao answered this question in the affirmative among systems which consist of a single equation. We answer Alon's question in the negative. We also observe that the property of remaining common despite that addition of arbitrarily many free variables is closely related to a notion of commonness in which one replaces the arithmetic mean of the number of monochromatic solutions with the geometric mean, and furthermore resolve questions of Kam\v{c}ev--Liebenau--Morrison.

math.CO↗
arXiv2022

A non-flag arithmetic regularity lemma and counting lemma

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'. We give an arithmetic regularity lemma and counting lemma which applies to all systems of linear forms.

math.CO↗
arXiv2021

On a conjecture of Gowers and Wolf

Gowers and Wolf have conjectured that, given a set of linear forms $\{\psi_i\}_{i=1}^t$ each mapping $\mathbb{Z}^D$ to $\mathbb{Z}$, if $s$ is an integer such that the functions $\psi_1^{s+1},\ldots, \psi_t^{s+1}$ are linearly independent, then averages of the form $\mathbb{E}_{\boldsymbol{x}} \prod_{i=1}^t f(\psi_i(\boldsymbol{x}))$ may be controlled by the Gowers $U^{s+1}$-norm of $f$. We prove (a stronger version of) this conjecture.

math.NT↗
arXiv2019

On Szemer\'edi's theorem with differences from a random set

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of enquiry suggested by Frantzikinakis et al, we show that over the integers, the conjectured threshold for $\mathbb{P}(d \in S)$ for Szemer\'{e}di's theorem to hold a.a.s follows from a conjecture about how so-called dual functions are approximated by nilsequences. We also show that the threshold over finite fields is different to this threshold over the integers.

math.NT↗
arXiv2016

A threshold result for loose Hamiltonicity in random regular uniform hypergraphs

Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which successive edges overlap in precisely $\ell$ vertices, and 1-overlapping Hamilton cycles are called loose Hamilton cycles. When $r,s\geq 3$ are fixed integers, we establish a threshold result for the property of containing a loose Hamilton cycle. This partially verifies a conjecture of Dudek, Frieze, Rucinski and Sileikis (2015). In this setting, we also find the asymptotic distribution of the number of loose Hamilton cycles in $\mathcal{G}(n,r,s)$. Finally we prove that for $\ell = 2,\ldots, s-1$ and for $r$ growing moderately as $n\to\infty$, the probability that $\mathcal{G}(n,r,s)$ has a $\ell$-overlapping Hamilton cycle tends to zero.

math.CO↗
arXiv2012

Analysis of 1:1 Matched Cohort Studies and Twin Studies, with Binary Exposures and Binary Outcomes

To improve confounder adjustments, observational studies are often matched on potential confounders. While matched case-control studies are common and well covered in the literature, our focus here is on matched cohort studies, which are less common and sparsely discussed in the literature. Matched data also arise naturally in twin studies, as a cohort of exposure-discordant twins can be viewed as being matched on a large number of potential confounders. The analysis of twin studies will be given special attention. We give an overview of various analysis methods for matched cohort studies with binary exposures and binary outcomes. In particular, our aim is to answer the following questions: (1) What are the target parameters in the common analysis methods? (2) What are the underlying assumptions in these methods? (3) How do the methods compare in terms of statistical power?

stat.ME↗