English
Related papers

Related papers: Convergence results for systems of linear forms on…

200 papers

We show how methods from Hamiltonian Floer theory can be used to establish lower bounds for the number of different time-periodic measures of time-periodic Hamiltonian systems with diffusion. After proving the existence of closed random…

Symplectic Geometry · Mathematics 2023-08-10 Oliver Fabert

We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

Deep generative models aim to learn the underlying distribution of data and generate new ones. Despite the diversity of generative models and their high-quality generation performance in practice, most of them lack rigorous theoretical…

Numerical Analysis · Mathematics 2024-03-26 Yang Jing , Lei Li

Let $(X_{n,i})_{1\le i\le n,n\in\mathbb{N}}$ be a triangular array of row-wise stationary $\mathbb{R}^d$-valued random variables. We use a "blocks method" to define clusters of extreme values: the rows of $(X_{n,i})$ are divided into $m_n$…

Statistics Theory · Mathematics 2020-05-19 Holger Drees , Holger Rootzén

In the topological dynamical system $(X,T)$, a point $x$ simultaneously approximates a point $y$ if there exists a sequence $n_1$, $n_2$, ... of natural numbers for which $T^{n_i} x$, $T^{2n_i}x$, ..., $T^{k n_i} x$ all tend to $y$. In…

Dynamical Systems · Mathematics 2024-09-11 Daniel Glasscock

We show the pointwise convergence of the averages \[ \mathcal{A}_N f(x) = \frac{1}{\# \mathbf{B}_N} \sum_{n \in \mathbf{B}_N} f(x + n) \] for $f \in \ell^1(\mathbb{Z})$ where $\mathbf{B}_N = \mathbf{B} \cap [1, N]$, and $\mathbf{B}$ is a…

Number Theory · Mathematics 2020-12-21 Bartosz Trojan

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Logic · Mathematics 2010-03-16 Fredrik Engström

In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…

Combinatorics · Mathematics 2024-07-30 Simone Costa , Stefano Della Fiore

We consider the problem of detecting a cycle in a directed graph that grows by arc insertions, and the related problems of maintaining a topological order and the strong components of such a graph. For these problems, we give two…

Data Structures and Algorithms · Computer Science 2011-12-06 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Robert E. Tarjan

In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…

Number Theory · Mathematics 2021-04-14 Boris Adamczewski , Michael Drmota , Clemens Müllner

This paper is concerned with a class of nonmonotone descent methods for minimizing a proper lower semicontinuous KL function $\Phi$, which generates a sequence satisfying a nonmonotone decrease condition and a relative error tolerance.…

Optimization and Control · Mathematics 2022-07-19 Yitian Qian , Shaohua Pan

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Number Theory · Mathematics 2025-05-15 Daniel R. Johnston , Simon N. Thomas

We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…

Combinatorics · Mathematics 2020-04-07 Ross Berkowitz , Ashwin Sah , Mehtaab Sawhney

Here is a sample of the results proved in this paper: Let $f:{\bf R}\to {\bf R}$ be a continuous function, let $\rho>0$ and let $\omega:[0,\rho[\to [0,+\infty[$ be a continuous increasing function such that $\lim_{\xi\to…

Optimization and Control · Mathematics 2022-10-25 Biagio Ricceri

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

Let $d,k$ be natural numbers and let $\mathcal{L}_1, \dots, \mathcal{L}_k \in \mathrm{GL}_d(\mathbb{Q})$ be linear transformations such that there are no non-trivial subspaces $U, V \subseteq \mathbb{Q}^d$ of the same dimension satisfying…

Combinatorics · Mathematics 2024-09-10 Albert Lopez Bruch , Yifan Jing , Akshat Mudgal

In this paper, we consider the problem of noiseless non-adaptive probabilistic group testing, in which the goal is high-probability recovery of the defective set. We show that in the case of $n$ items among which $k$ are defective, the…

Information Theory · Computer Science 2021-07-30 Wei Heng Bay , Eric Price , Jonathan Scarlett

Answering a question of Gowers, Tao proved that any $A\times B\times C\subset SL_d(\mathbb{F}_q)^3$ contains $|A||B||C|/|SL_d(\mathbb{F}_q)|+O_d(|SL_d(\mathbb{F}_q)|^2/q^{\min(d-1,2)/8})$ three-term progressions $(x,xy,xy^2)$. Using a…

Combinatorics · Mathematics 2023-01-11 Sarah Peluse

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative $\alpha$-entropies (denoted $\mathscr{I}_{\alpha}$), arise as redundancies under…

Information Theory · Computer Science 2015-06-11 M. Ashok Kumar , Rajesh Sundaresan

An "entropy increasing to the maximum" result analogous to the entropic central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the discrete setting. This involves the thinning operation and a Poisson limit. Monotonic…

Information Theory · Computer Science 2009-11-18 Yaming Yu
‹ Prev 1 8 9 10 Next ›