English
Related papers

Related papers: $2$-large sets are sets of Bohr recurrence

200 papers

In this paper, we present series representations of the remainders in the expansions for $2/(e^t+1)$, $\mbox{sech} t$ and $\coth t$. For example, we prove that for $t > 0$ and $N\in\mathbb{N}:=\{1, 2, \ldots\}$, \[\mbox{sech}\,…

Classical Analysis and ODEs · Mathematics 2016-01-12 C. -P. Chen , R. B. Paris

In this article we show that $\mathbb{S}/8$ is an $\mathbb{E}_1$-algebra, $\mathbb{S}/32$ is an $\mathbb{E}_2$-algebra, $\mathbb{S}/p^{n+1}$ is an $\mathbb{E}_n$-algebra at odd primes and, more generally, for every $h$ and $n$ there exist…

Algebraic Topology · Mathematics 2022-06-22 Robert Burklund

For a graph $G$ with a list assignment $L$ and two $L$-colorings $\alpha$ and $\beta$, an $L$-recoloring sequence from $\alpha$ to $\beta$ is a sequence of proper $L$-colorings where consecutive colorings differ at exactly one vertex. We…

Combinatorics · Mathematics 2025-10-21 Chenran Pan , Weifan Wang , Runrun Liu

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Combinatorics · Mathematics 2016-09-07 David J. Grabiner

Let $d \geq 2$ be a natural number. We show that $$|A-A| \geq \left(2d-2 + \frac{1}{d-1}\right)|A|-(2d^2-4d+3)$$ for any sufficiently large finite subset $A$ of $\mathbb{R}^d$ that is not contained in a translate of a hyperplane. By a…

Combinatorics · Mathematics 2023-07-25 David Conlon , Jeck Lim

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

Logic · Mathematics 2009-09-25 Sy D. Friedman

Define $S_n(R;T)$ to be the number of permutations on $n$ letters which avoid all patterns in the set $R$ and contain each pattern in the multiset $T$ exactly once. In this paper we enumerate $S_n(\{\alpha\};\{\beta\})$ and…

Combinatorics · Mathematics 2007-05-23 Aaron Robertson

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

Combinatorics · Mathematics 2011-08-15 Adam M. Goyt , Lara K. Pudwell

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

We study recurrence and non-recurrence sets for dynamical systems on compact spaces, in particular for products of rotations on the unit circle T. A set of integers is called r-Bohr if it is recurrent for all products of r rotations on T,…

Dynamical Systems · Mathematics 2012-02-15 Sophie Grivaux , Maria Roginskaya

We consider Beta$(2-\alpha, \alpha)$-coalescents with parameter range $1 <\alpha<2$ starting from $n$ leaves. The length $\ell^{(n)}_r$ of order $r$ in the $n$-Beta$(2-\alpha, \alpha)$-coalescent tree is defined as the sum of the lengths of…

Probability · Mathematics 2022-11-30 Matthias Birkner , Iulia Dahmer , Christina S. Diehl , Götz Kersting

Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation…

We show that for any set $S\subseteq \mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $\mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of…

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

Let $f,g\in\mathbb{C}[z]\setminus\mathbb{C}$ and $c\in\mathbb{C}[z]$. Suppose that $\mathrm{deg}(c)=1$ if $\mathrm{deg}(f)=\mathrm{deg}(g)=1$. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set…

Dynamical Systems · Mathematics 2026-05-27 Geng-Rui Zhang

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Combinatorics · Mathematics 2024-07-11 Yuewen Luo

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Number Theory · Mathematics 2023-03-10 Bibhu Prasad Tripathy , Bijan Kumar Patel

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Number Theory · Mathematics 2014-04-08 Gabor Korvin

Lifting theorems form an important collection of tools in showing that Galois representations are associated to automorphic forms. (Key examples in dimension n>2 are the lifting theorems of Clozel, Harris and Taylor and of Geraghty.) All…

Number Theory · Mathematics 2010-06-08 Thomas Barnet-Lamb
‹ Prev 1 3 4 5 6 7 10 Next ›