English
Related papers

Related papers: Upper and lower bounds for rich lines in grids

200 papers

We extend previous work on Hrushovski's stabilizer's theorem and prove a measure-theoretic version of a well-known result of Pillay-Scanlon-Wagner on products of three types. This generalizes results of Gowers on products of three sets and…

Logic · Mathematics 2024-05-01 Amador Martin-Pizarro , Daniel Palacín

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

We prove a super-rigidity result for algebraic representations over complete fields of irreducible lattices in product of groups and lattices with dense commensurator groups. We derive some criteria for non-linearity of such groups.

Group Theory · Mathematics 2019-12-04 Uri Bader , Alex Furman

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

Dynamical Systems · Mathematics 2015-11-19 Nikos Frantzikinakis , Bernard Host

In 1998, V. Liskevich and Y. Semenov showed sharp Gaussian upper bounds for Schr\"odinger semigroups on $\mathbb R^3$ with potentials satisfying a global Kato class condition. Using similar basic ideas we show sharp Gaussian upper bounds…

Functional Analysis · Mathematics 2024-11-13 Paul Holst , Hendrik Vogt

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Group Theory · Mathematics 2024-01-10 Amandine Escalier , Camille Horbez

We present a sharp version of the isoperimetric inequality for finitely generated groups due to T. Couhlon and L. Saloff-Coste based on the proof suggested by M. Gromov.

Group Theory · Mathematics 2021-11-01 Bruno Luiz Santos Correia , Marc Troyanov

We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…

Combinatorics · Mathematics 2022-10-11 Adam Sheffer , Olivine Silier

We establish enhanced bounds on Cheeger-Gromov rho-invariants for general 3-manifolds and yet stronger bounds for special classes of 3-manifold. As key ingredients, we construct chain null-homotopies whose complexity is linearly bounded by…

Geometric Topology · Mathematics 2021-03-29 Geunho Lim

Given $d,s \in \mathbb{N}$, a finite set $A \subseteq \mathbb{Z}$ and polynomials $\varphi_1, \dots, \varphi_{s} \in \mathbb{Z}[x]$ such that $1 \leq deg \varphi_i \leq d$ for every $1 \leq i \leq s$, we prove that \[ |A^{(s)}| +…

Number Theory · Mathematics 2023-10-31 Akshat Mudgal

In 2005, Li, Tao, Thiele and the author raised a general question concerning upper bounds for a class of multilinear oscillatory integral operators, and established such bounds in a few cases. Most cases remain open. The present paper is…

Classical Analysis and ODEs · Mathematics 2011-07-13 Michael Christ

Gromov's band-width conjecture gives a precise upper bound for the width of a compact Riemannian band with positive scalar curvature lower bound, assuming that the cross-section of the band admits no positive scalar curvature metrics.…

Differential Geometry · Mathematics 2026-02-09 Peter Hochs , Jinmin Wang

For $X$ a smooth projective variety over a field $k$, we consider the problem of Galois descent for higher Brauer groups. More precisely, we extend a finiteness result of Colliot-Th\'el\`ene and Skorobogatov to higher Brauer groups.

Algebraic Geometry · Mathematics 2020-11-09 Humberto A. Diaz

We prove a quasi-linear upper bound on the size of $K_{t,t}$-free polygon visibility graphs. For visibility graphs of star-shaped and monotone polygons we show a linear bound. In the more general setting of $n$ points on a simple closed…

Computational Geometry · Computer Science 2026-03-19 Eyal Ackerman , Balázs Keszegh

We provide new upper bounds on N_q(g), the maximum number of rational points on a smooth absolutely irreducible genus-g curve over F_q, for many values of q and g. Among other results, we find that N_4(7) = 21 and N_8(5) = 29, and we show…

Number Theory · Mathematics 2020-07-15 Everett W. Howe , Kristin E. Lauter

In this paper we combine methods from additive combinatorics and Diophantine geometry to study the generalised sum-product phenomenon in algebraic groups. As an application of this circle of ideas, we resolve a conjecture of Bremner on…

Number Theory · Mathematics 2026-03-09 Joseph Harrison , Akshat Mudgal , Harry Schmidt

We derive a new upper bound on the algebraic connectivity of a regular graph using the Higman-Sims technique. Together with a new result on the connectivity of the neighbourhood graph of strongly regular graphs, our result gives a…

Combinatorics · Mathematics 2015-03-06 Sera Aylin Cakiroglu

Notions of higher Kazhdan property can be defined in terms of vanishing of unitary group cohomology in higher degrees. Garland's theorem for simple groups over non-archimedean fields provides the first examples of a higher Kazhdan property.…

Representation Theory · Mathematics 2026-02-09 Uri Bader , Roman Sauer

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

Combinatorics · Mathematics 2024-11-19 Martin Bohnert , Justus Springer

We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…

Information Theory · Computer Science 2016-11-18 Emanuele Bellini , Eleonora Guerrini , Massimiliano Sala