English
Related papers

Related papers: On The Hereditary Discrepancy of Homogeneous Arith…

200 papers

We study the Lagarias inequality, an elementary criterion equivalent to the Riemann Hypothesis. Using a continuous extension of the harmonic numbers, we show that the sequence $B_n=\frac{H_n+e^{H_n}\log(H_n)}{n}$ is strictly increasing for…

Number Theory · Mathematics 2026-02-20 Andrew MacArevey

Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that \[r_5(N)\ll \frac{N}{\exp((\log\log N)^{c})}.\] Our work…

Number Theory · Mathematics 2024-04-11 James Leng , Ashwin Sah , Mehtaab Sawhney

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

Number Theory · Mathematics 2017-05-17 Thomas F. Bloom

This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…

Probability · Mathematics 2026-03-26 Yiming Chen , Guozheng Dai

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Number Theory · Mathematics 2025-02-25 Julia Stadlmann

We deal with the problem, initiated in [8], of finding randomized and quantum complexity of initial-value problems. We showed in [8] that a speed-up in both settings over the worst-case deterministic complexity is possible. In the present…

Quantum Physics · Physics 2007-05-23 Boleslaw Kacewicz

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Combinatorics · Mathematics 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

A Boolean function $f:\{0,1\}^d \mapsto \{0,1\}$ is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make…

Computational Complexity · Computer Science 2017-06-02 Roksana Baleshzar , Deeparnab Chakrabarty , Ramesh Krishnan S. Pallavoor , Sofya Raskhodnikova , C. Seshadhri

We study hypergraph discrepancy in two closely related random models of hypergraphs on $n$ vertices and $m$ hyperedges. The first model, $\mathcal{H}_1$, is when every vertex is present in exactly $t$ randomly chosen hyperedges. The premise…

Combinatorics · Mathematics 2018-11-06 Aditya Potukuchi

We provide probabilistic lower bounds for the star discrepancy of Latin hypercube samples. These bounds are sharp in the sense that they match the recent probabilistic upper bounds for the star discrepancy of Latin hypercube samples proved…

Numerical Analysis · Mathematics 2021-09-21 Benjamin Doerr , Carola Doerr , Michael Gnewuch

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…

Combinatorics · Mathematics 2013-12-17 J. Solymosi , Cs. D. Toth

We study non-stationary averaging processes, where each term of a sequence is a weighted average of previous terms, namely $a_{n+1} = \sum_{j=1}^n p_n(j) a_j$. Our results extend classical theory in two distinct regimes. First, we prove a…

Probability · Mathematics 2026-03-18 Saba Lepsveridze , Elchanan Mossel

Let $(H(n))_{n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D_{2} ( (H(n))_{n=0}^{N-1}) $ be the $L_2$-discrepancy of $ (H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$.…

Number Theory · Mathematics 2020-12-29 Mordechay B. Levin

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Data Structures and Algorithms · Computer Science 2013-12-12 David Rosenbaum

We define a homogeneous parabolic De Giorgi classes of order 2 which suits a mixed type class of evolution equations whose simplest example is $\mu (x) \frac{\partial u}{\partial t} - \Delta u = 0$ where $\mu$ can be positive, null and…

Analysis of PDEs · Mathematics 2015-09-01 Fabio Paronetto

In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…

Rings and Algebras · Mathematics 2024-02-06 Felipe Yukihide Yasumura

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Computational Geometry · Computer Science 2017-11-16 Jakub Sosnovec

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Discrete Mathematics · Computer Science 2025-10-14 Pasin Manurangsi , Raghu Meka

Given an open subset U of a projective curve Y and a smooth family f:V-->U of curves, with semi-stable reduction over Y, we show that for a sub variation of Hodge structures of rank >2 the Arakelov inequality must be strict. For families of…

Algebraic Geometry · Mathematics 2011-02-19 Eckart Viehweg , Kang Zuo

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

Combinatorics · Mathematics 2019-08-29 Anton Bernshteyn , Michael Tait
‹ Prev 1 4 5 6 7 8 10 Next ›