English
Related papers

Related papers: An arithmetic regularity lemma, associated countin…

200 papers

We develop a statistical framework for conducting inference on collections of time-varying covariance operators (covariance flows) over a general, possibly infinite dimensional, Hilbert space. We model the intrinsically non-linear structure…

Methodology · Statistics 2024-06-25 Leonardo V. Santoro , Victor M. Panaretos

The use of statistical methods for the description of complex quantum systems was primarily motivated by the failure of a line-by-line interpretation of atomic spectra. Such methods reveal regularities and trends in the distributions of…

Atomic Physics · Physics 2021-05-03 Jean-Christophe Pain

We give a randomness-efficient homomorphism test in the low soundness regime for functions, $f: G\to \mathbb{U}_t$, from an arbitrary finite group $G$ to $t\times t$ unitary matrices. We show that if such a function passes a derandomized…

Computational Complexity · Computer Science 2024-09-25 Tushant Mittal , Sourya Roy

For $\chi^2-$tests with increasing number of cells, Cramer-von Mises tests, tests generated $\mathbb{L}_2$- norms of kernel estimators and tests generated quadratic forms of estimators of Fourier coefficients, we find necessary and…

Statistics Theory · Mathematics 2019-09-13 Mikhail Ermakov

The stochastic sewing lemma recently introduced by Le~(2020) allows to construct a unique limit process from a doubly indexed stochastic process that satisfies some regularity. This lemma is stated in a given probability space on which…

Probability · Mathematics 2024-12-03 Aurélien Alfonsi , Vlad Bally , Lucia Caramellino

In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…

Probability · Mathematics 2014-07-24 Julien Dubédat

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

Logic · Mathematics 2017-07-14 Saugata Basu , Orit E. Raz

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

Number Theory · Mathematics 2025-01-30 Felipe García-Ramos , Gerardo González Robert , Mumtaz Hussain

Let $R$ be a semiartinian (von Neumann) regular ring with primitive factors artinian. The dimension sequence $\mathcal D _R$ is an invariant that captures the various skew-fields and dimensions occurring in the layers of the socle sequence…

Rings and Algebras · Mathematics 2025-04-24 Kateřina Fuková , Jan Trlifaj

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Probability · Mathematics 2009-03-06 Eugenijus Manstavičius

This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and…

Computational Complexity · Computer Science 2020-05-20 Matthew Brennan , Guy Bresler

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

Combinatorics · Mathematics 2013-09-04 Xuancheng Shao

In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.…

Combinatorics · Mathematics 2021-11-02 J. H. Koolen , W. S. Lee , W. J. Martin , H. Tanaka

For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring…

Combinatorics · Mathematics 2022-09-07 Joonkyung Lee , Alexander Sidorenko

Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…

Combinatorics · Mathematics 2017-07-31 Jan Hladky , Diana Piguet , Miklos Simonovits , Maya Stein , Endre Szemeredi

We prove a regularity lemma with respect to arbitrary Keisler measures mu on V, nu on W where the bipartite graph (V,W,R) is definable in a saturated structure M and the formula R(x,y) is stable. The proof is rather quick and uses local…

Logic · Mathematics 2016-04-18 Maryanthe Malliaris , Anand Pillay

Gram's Law describes a pattern that frequently occurs in the distribution of the non-trivial zeros of the Riemann zeta function along the critical line. Whenever Gram's Law holds true, it reduces the difficulty of computing the…

Number Theory · Mathematics 2020-06-02 Cătălin Hanga , Christopher Hughes

Assuming the Riemann hypothesis, we prove the weak convergence of linear statistics of the zeros of L-functions towards a Gaussian field, with covariance structure corresponding to the $\HH^{1/2}$-norm of the test functions. For this…

Probability · Mathematics 2015-06-16 Paul Bourgade , Jeffrey Kuan

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

Combinatorics · Mathematics 2012-03-13 Balazs Szegedy

We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase…

Logic in Computer Science · Computer Science 2023-11-01 Gilles Dowek , Alexandre Miquel
‹ Prev 1 8 9 10 Next ›