English
Related papers

Related papers: A dichotomy for the stability of arithmetic progre…

200 papers

We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle…

Combinatorics · Mathematics 2024-05-21 Mieke Wessel

A \emph{hull} of $A \subset [0,1]$ is a set $H$ containing $A$ such that $\lambda^*(H)=\lambda^*(A)$. We investigate all four versions of the following problem. Does there exist a monotone (wrt. inclusion) map that assigns a…

Classical Analysis and ODEs · Mathematics 2011-09-23 Márton Elekes , András Máthé

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Computational Complexity · Computer Science 2020-11-24 Tomas Feder , Jeff Kinne , Ashwin Murali , Arash Rafiey

We show that, for every compact n-dimensional manifold, n\geq 1, there is a residual subset of Diff^1(M) of diffeomorphisms for which the homoclinic class of any periodic saddle of f verifies one of the following two possibilities: Either…

Dynamical Systems · Mathematics 2007-05-23 C. Bonatti , L. J. Diaz , E. R. Pujals

We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…

Computational Complexity · Computer Science 2020-02-07 Artem Govorov , Jin-Yi Cai , Martin Dyer

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…

Logic · Mathematics 2018-11-14 C. Terry , J. Wolf

We consider regular endomorphisms of the complex affine space with a degree gap $k$. They are endomorphisms $f$ of $\mathbb{A}_{\mathbb{C}}^{N}$ of the form…

Dynamical Systems · Mathematics 2026-05-13 She Yang , Aoyang Zheng

Let (U \subset {\mathbb R}^3) be an open set and (f:U \to f(U) \subset {\mathbb R}^3) be a homeomorphism. Let (p \in U) be a fixed point. It is known that, if (\{p\}) is not an isolated invariant set, the sequence of the fixed point indices…

Dynamical Systems · Mathematics 2014-02-26 Patrice Le Calvez , Francisco R. Ruiz del Portal , José M. Salazar

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

General Mathematics · Mathematics 2009-11-24 Florentin Smarandache

We show that if A is a subset of {1,...,N} containing no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{3/4-o(1)} N).

Number Theory · Mathematics 2012-12-04 Tom Sanders

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

Probability · Mathematics 2019-01-23 Bryce Cai , Annie Chen , Ben Heller , Eyob Tsegaye

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

A homeomorphism of a compact metric space is {\em tight} provided every non-degenerate compact connected (not necessarily invariant) subset carries positive entropy. It is shown that every $C^{1+\alpha}$ diffeomorphism of a closed surface…

Dynamical Systems · Mathematics 2007-05-23 André de Carvalho , Miguel Paternain

We prove that most one-dimensional projections of a discrete subset of a plane are either dense in R (the real line), or form a discrete subset of R. More precisely, the set E of exceptional directions (for which the indicated dichotomy…

Metric Geometry · Mathematics 2012-03-06 Michael Boshernitzan

Let $\mathbb{A}$ and $\mathbb{S}$ denote the double arrow of Alexandroff and the Sorgenfrey line, respectively. We show that any homeomorphism $h:^m\mathbb{A}\to^m\mathbb{A} $ is locally (outside of a nowhere dense set) a product of…

General Topology · Mathematics 2022-08-02 Sebastian Barria , Carlos Martinez-Ranero

It is shown that if $A \subseteq \mathbb{R}^3$ is a Borel set of Hausdorff dimension $\dim A>1$, and if $\rho_{\theta}$ is orthogonal projection to the line spanned by $( \cos \theta, \sin \theta, 1 )$, then $\rho_{\theta}(A)$ has positive…

Classical Analysis and ODEs · Mathematics 2024-10-15 Terence L. J. Harris

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

Logic · Mathematics 2014-12-31 John D. Clemens , Dominique Lecomte , Benjamin D. Miller

A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^\alpha$ for…

Number Theory · Mathematics 2019-03-05 Kota Saito , Yuuya Yoshida

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

Computational Complexity · Computer Science 2020-04-15 Jin-Yi Cai , Artem Govorov
‹ Prev 1 3 4 5 6 7 10 Next ›