English
Related papers

Related papers: Sublacunary sequences that are strong sweeping out

200 papers

We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…

Number Theory · Mathematics 2025-09-03 Tim Browning , Matteo Verzobio

A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…

Combinatorics · Mathematics 2025-01-07 Oliver Tan

Let $\mathcal{S} = \{ \tau_n \}_{n=1}^\infty \subset (0,T)$ be an arbitrary countable (dense) set. We show that for any given initial density and momentum, the compressible Euler system admits (infinitely many) admissible weak solutions…

Analysis of PDEs · Mathematics 2019-05-01 Anna Abbatiello , Eduard Feireisl

We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…

Representation Theory · Mathematics 2021-06-04 Aslak Bakke Buan , Bethany Marsh

Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…

Formal Languages and Automata Theory · Computer Science 2024-01-26 Daniel Krenn , Jeffrey Shallit

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

Combinatorics · Mathematics 2014-10-23 Boris Bukh , Jie Ma

In this paper we present the theory of lacunary trigonometric sums and lacunary sums of dilated functions, from the origins of the subject up to recent developments. We describe the connections with mathematical topics such as…

Number Theory · Mathematics 2024-03-28 Christoph Aistleitner , Istvan Berkes , Robert Tichy

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positive integers (m_1,m_2,...) such that m_1=1, every nonnegative…

Combinatorics · Mathematics 2007-05-23 Matthew Cook , Michael Kleber

In this note we prove that for every sequence $(m_q)_{q}$ of positive integers and for every real $0<\delta\leqslant1$ there is a sequence $(n_q)_{q}$ of positive integers such that for every sequence $(H_q)_{q}$ of finite sets such that…

Combinatorics · Mathematics 2012-11-19 Stevo Todorcevic , Konstantinos Tyros

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

Number Theory · Mathematics 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.

Combinatorics · Mathematics 2011-03-29 An-Ping Li

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Number Theory · Mathematics 2025-01-10 Dan Ismailescu , Yunkyu James Lee

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

Number Theory · Mathematics 2014-02-05 Constantin M. Petridi

Given a one-dimensional shift $X$, let $|F_X(\ell)|$ be the number of follower sets of words of length $\ell$ in $X$. We call the sequence $\{|F_X(\ell)|\}_{\ell \in \mathbb{N}}$ the follower set sequence of the shift $X$. Extender sets are…

Dynamical Systems · Mathematics 2015-08-13 Thomas French

Let $F(X) = \sum_{n \geq 0} (-1)^{\varepsilon_n} X^{-\lambda_n}$ be a real lacunary formal power series, where $\varepsilon_n = 0, 1$ and $\lambda_{n+1}/\lambda_n > 2$. It is known that the denominators $Q_n(X)$ of the convergents of its…

Number Theory · Mathematics 2014-04-29 Jean-Paul Allouche , Michel Mendès France

For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if $\gamma$ is eventually linearly…

Number Theory · Mathematics 2026-04-29 Igor Rivin

Scientists aim to extract simplicity from observations of the complex world. An important component of this process is the exploration of data in search of trends. In practice, however, this tends to be more of an art than a science. Among…

Machine Learning · Computer Science 2021-08-11 Dalya Baron , Brice Ménard

A sequence $(e_i)_{i \le m}$ of nonnegative integers $e_i$, where $m \in \mathbb{N}$ or $m =\infty$, is called a binomid index if $\sum_{i=n-k+1}^{n} e_i\geq \sum_{i=1}^ke_i$ for all $k, n \in \mathbb{N}$ such that $ 1\le k \le n < m$.…

Combinatorics · Mathematics 2025-05-27 Jonathan Caalim , Yu-ichi Tanaka
‹ Prev 1 4 5 6 7 8 10 Next ›