English
Related papers

Related papers: Exponentially Larger Affine and Projective Caps

200 papers

Let $\ell \geq 5$ be a prime and let $N$ be a square-free integer prime to $\ell$. For each prime $p$ dividing $N$, let $a_p$ be either $1$ or $-1$. We give sufficient criteria for the existence of a newform $f$ of weight 2 for…

Number Theory · Mathematics 2017-08-03 Hwajong Yoo

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

We make an observation which doubles the exponent of distribution in certain Affine Sieve problems, such as those considered by Liu-Sarnak, Kontorovich, and Kontorovich-Oh. As a consequence, we decrease the known bounds on the saturation…

Number Theory · Mathematics 2014-01-21 Jiuzu Hong , Alex Kontorovich

In this article we prove new results on projective normality and normal presentation of adjunction bundle associated to an ample and globally generated line bundle on higher dimensional smooth projective varieties with nef canonical bundle.…

Algebraic Geometry · Mathematics 2019-09-10 Jayan Mukherjee , Debaditya Raychaudhury

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…

Number Theory · Mathematics 2026-04-10 Moni Kumari , Prabhat Kumar Mishra , Jyotirmoy Sengupta

In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…

Optimization and Control · Mathematics 2017-05-01 Arnaud Vandaele , Nicolas Gillis , François Glineur

We show that under the assumption of Artin's Primitive Root Conjecture, for all primes p there exist ordinary elliptic curves over $\bar F_p(x)$ with arbitrary high rank and constant j-invariant. For odd primes p, this result follows from a…

Number Theory · Mathematics 2007-05-23 Irene I. Bouw , Claus Diem , Jasper Scholten

We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of…

Combinatorics · Mathematics 2019-05-13 David Bevan , Robert Brignall , Andrew Elvey Price , Jay Pantone

A fundamental theorem of P. Deligne (2002) states that a pre-Tannakian category over an algebraically closed field of characteristic zero admits a fiber functor to the category of supervector spaces (i.e., is the representation category of…

Representation Theory · Mathematics 2022-09-02 Kevin Coulembier , Pavel Etingof , Victor Ostrik

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Number Theory · Mathematics 2026-03-31 Andreea Catalina Chitu , Gabriela Ileana Sebe , Dan Lascu

An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$,…

Combinatorics · Mathematics 2022-10-04 Michael Tait , Robert Won

A $d$-dimensional polycube is a facet-connected set of cells (cubes) on the $d$-dimensional cubical lattice $\mathbb{Z}^d$. Let $A_d(n)$ denote the number of $d$-dimensional polycubes (distinct up to translations) with $n$ cubes, and…

Discrete Mathematics · Computer Science 2019-07-02 Gill Barequet , Mira Shalah

We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…

Number Theory · Mathematics 2023-09-18 Jared Duker Lichtman

We apply an improvement of the Delsarte LP-bound to give a new proof of the non-existence of finite projective planes of order 6, and uniqueness of finite projective planes of order 7. The proof is computer aided, and it is also feasible to…

Combinatorics · Mathematics 2018-01-30 Mate Matolcsi , Mihaly Weiner

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

An s-cap n-flat, or an n-dimensional cap of size s, is a pair (S,F) where F is an n-dimensional affine space over Z/3Z and the size-s subset S of F contains no triple of collinear points. The cap set problem in dimension n asks for the…

Combinatorics · Mathematics 2022-06-22 Henry Robert Thackeray

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

Combinatorics · Mathematics 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

Number Theory · Mathematics 2017-06-12 Dimitris Koukoulopoulos

Let $f$ be a newform of weight $2$ on $\Gamma_0(N)$ with Fourier $q$-expansion $f(q)=q+\sum_{n\geq 2} a_n q^n$, where $\Gamma_0(N)$ denotes the group of invertible matrices with integer coefficients, upper triangular mod $N$. Let $p$ be a…

Number Theory · Mathematics 2017-03-23 Luis Dieulefait , Eduardo Soto

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Computational Complexity · Computer Science 2022-02-14 Oliver Korten
‹ Prev 1 8 9 10 Next ›