English
Related papers

Related papers: Exponentially Larger Affine and Projective Caps

200 papers

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Combinatorics · Mathematics 2025-11-27 Thang Pham , Semin Yoo

We show that for primes $N, p \geq 5$ with $N \equiv -1 \bmod p$, the class number of $\mathbb{Q}(N^{1/p})$ is divisible by $p$. Our methods are via congruences between Eisenstein series and cusp forms. In particular, we show that when $N…

Number Theory · Mathematics 2021-09-10 Jaclyn Lang , Preston Wake

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

Number Theory · Mathematics 2019-08-21 Madhuparna Das , Goutam Paul

There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…

Optimization and Control · Mathematics 2013-11-12 Hamza Fawzi , Pablo A. Parrilo

Let $p$ be a prime number and let $k\geq 2$ be an integer. In this article we study the semi-simple reductions modulo $p$ of two-dimensional irreducible crystalline $p$-adic Galois representations with Hodge-Tate weights $0$ and $k-1$ and…

Number Theory · Mathematics 2021-03-09 Bodan Arsovski

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

We prove a new upper bound on the essential p-dimension of the projective linear group PGLn.

Rings and Algebras · Mathematics 2017-02-22 Aurel Meyer , Zinovy Reichstein

We construct $n$-node graphs on which any $O(n)$-size spanner has additive error at least $+\Omega(n^{3/17})$, improving on the previous best lower bound of $\Omega(n^{1/7})$ [Bodwin-Hoppenworth FOCS '22]. Our construction completes the…

Data Structures and Algorithms · Computer Science 2024-04-30 Greg Bodwin , Gary Hoppenworth , Virginia Vassilevska Williams , Nicole Wein , Zixuan Xu

Bollob\'{a}s-type theorem has received a lot of attention due to its application in graph theory. In 2015, G\'{a}bor Heged{\"u}s gave an upper bound of bollob\'{a}s-type affine subspace families for $q\neq 2$, and constructed an almost…

Combinatorics · Mathematics 2025-01-17 Shuhui Yu , Xin Wang

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

In this paper, we give an elementary proof on the existence of an effective uniform upper bound on the size of integral periodic orbits of a single endomorphism in an affine space, dependent solely on its dimension. In fact, we derive a…

Number Theory · Mathematics 2023-10-13 Minchan Kang

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern…

Number Theory · Mathematics 2020-11-24 Alexei Kourbatov , Marek Wolf

Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…

Combinatorics · Mathematics 2020-06-30 Lisa Sauermann

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

Combinatorics · Mathematics 2025-03-17 Leo Zanotti

This article is concerned with the representation growth of profinite groups over finite fields. We investigate the structure of groups with uniformly bounded exponential representation growth (UBERG). Using crown-based powers we obtain…

Group Theory · Mathematics 2021-10-14 Ged Corob Cook , Steffen Kionke , Matteo Vannacci

Ellenberg and Gijswijt gave recently a new exponential upper bound for the size of three-term arithmetic progression free sets in $({\mathbb Z_p})^n$, where $p$ is a prime. Petrov summarized their method and generalized their result to…

Combinatorics · Mathematics 2017-01-09 Gábor Hegedűs

For $d \geq 4$ and $p$ a sufficiently large prime, we construct a lattice $\Gamma \leq {\rm PSp}_{2d}(\mathbb Q_p),$ such that its universal central extension cannot be sofic if $\Gamma$ satisfies some weak form of stability in…

Group Theory · Mathematics 2024-03-19 Lukas Gohla , Andreas Thom

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

Combinatorics · Mathematics 2023-12-13 Fred Tyrrell

In 2006, Kawaguchi proved a lower bound for height of h(f(P)) when f is a regular affine automorphism of A^2, and he conjectured that a similar estimate is also true for regular affine automorphisms of A^n for n>2. In this paper we prove…

Number Theory · Mathematics 2009-09-18 ChongGyu Lee

We consider the problem of bounding the number of exceptional projections (projections which are smaller than typical) of a subset of a vector space over a finite field onto subspaces. We establish bounds that depend on $L^p$ estimates for…

Combinatorics · Mathematics 2025-04-24 Jonathan M. Fraser , Firdavs Rakhmonov