English
Related papers

Related papers: Kolakoski Sequence: Links between Recurrence, Symm…

200 papers

What is the relationship between the complexity of a learner and the randomness of his mistakes? This question was posed in \cite{rat0903} who showed that the more complex the learner the higher the possibility that his mistakes deviate…

Information Theory · Computer Science 2009-09-01 Joel Ratsaby

Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s. Let r_k(\ell)…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson , Kevin O'Bryant

In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…

General Mathematics · Mathematics 2015-10-06 Maya Mohsin Ahmed

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…

Dynamical Systems · Mathematics 2024-12-30 John T. Griesmer

The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…

Information Theory · Computer Science 2007-12-11 Marius Zimand

We study the recurrence properties of certain skew products over symmetric interval exchange transformations, including rotations, with cocycles of the form $f(x)=-\frac{1}{x^a}+\frac{1}{(1-x)^a}$, where $a>1$. We prove that typically, such…

Dynamical Systems · Mathematics 2026-01-26 Przemysław Berk , Łukasz Kotlewski

We use set-theoretic tools to make a model-theoretic contribution. In particular, we construct a \emph{single} $\mathcal{L}_{\omega_1,\omega}$-sentence $\psi$ that codes Kurepa trees to prove the consistency of the following: (1) The…

Logic · Mathematics 2020-03-23 Dima Sinapova , Ioannis Souldatos

We study an intermittent map which has exactly two ergodic invariant densities. The densities are supported on two subintervals with a common boundary point. Due to certain perturbations, leakage of mass through subsets, called holes, of…

Dynamical Systems · Mathematics 2015-05-28 Wael Bahsoun , Sandro Vaienti

The classic string indexing problem is to preprocess a string $S$ into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string $P$, report all occurrences of $P$ within $S$. In…

Data Structures and Algorithms · Computer Science 2024-02-15 Philip Bille , Inge Li Gørtz , Max Rishøj Pedersen , Eva Rotenberg , Teresa Anna Steiner

Spherical collapse predicts that a single value of the turnaround density (average matter density within the scale on which a structure detaches from the Hubble flow) characterizes all cosmic structures at the same redshift. It has been…

Cosmology and Nongalactic Astrophysics · Physics 2020-07-01 Vasiliki Pavlidou , Giorgos Korkidis , Theodore Tomaras , Dimitrios Tanoglidis

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

After defining a notion of $\epsilon$-density, we provide for any real algebraic number $\alpha$ an estimate of the smallest $\epsilon$ such that for each $m>1$ the set of vectors of the form $(t,t\alpha,...,t\alpha^{m-1})$ for $t\in\R$ is…

Number Theory · Mathematics 2011-10-18 Nevio Dubbini , Maurizio Monge

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Combinatorics · Mathematics 2022-07-19 T. Mitchell Roddenberry , Santiago Segarra

We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…

Probability · Mathematics 2019-12-12 Adriana Coutinho , Rodrigo Lambert , Jérôme Rousseau

In this paper we study the density in the real line of oscillating sequences of the form $$ (g(k)\cdot F(k\alpha))_{k \in \mathbb{N}} ,$$ where $g$ is a positive increasing function and $F$ a real continuous 1-periodic function. This…

Number Theory · Mathematics 2022-12-20 Ioannis Tsokanos

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

We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…

Discrete Mathematics · Computer Science 2015-12-08 Wojciech Czerwinski , Tomasz Gogacz , Eryk Kopczynski

This study presents a specific symplectic map, derived from a Hamiltonian, as a model that exhibits time-reversal symmetry on a microscopic scale. Based on the analysis, any initial density function, defined almost everywhere, converges to…

Chaotic Dynamics · Physics 2024-07-25 Ken-ichi Okubo , Ken Umeno

Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…

Combinatorics · Mathematics 2014-09-17 Benjamin Chaffin , John P. Linderman , N. J. A. Sloane , Allan R. Wilks

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

Logic · Mathematics 2015-05-08 Denis R. Hirschfeldt , Carl G. Jockusch , Rutger Kuyper , Paul E. Schupp