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

A famous theorem of Erdos and Szekeres states that any sequence of $n$ distinct real numbers contains a monotone subsequence of length at least $\sqrt{n}$. Here, we prove a positive fraction version of this theorem. For $n > (k-1)^2$, any…

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…

Building on [1], we examine a holographic model in which a U(1) symmetry and translational invariance are broken spontaneously at the same time. The symmetry breaking is realized through the St\"{u}ckelberg mechanism, and leads to a scalar…

This paper explores a relationship between invariants of certain group actions and the time-reversibility of two-dimensional polynomial differential systems exhibiting a $1:-1$ resonant singularity at the origin. We focus on the connection…

By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Uniqueness of mass-conserving self-similar solutions to Smoluchowski's coagulation equation is shown when the coagulation kernel $K$ is given by $K(x,x\_*)=2(x x\_*)^{-\alpha}$, $(x,x\_*)\in (0,\infty)^2$, for some $\alpha>0$.

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

Let $\mathcal W$ be a nontrivial variety of lattices, and let $L$ be a finite lattice in $\mathcal W$. The congruence density of $L$ with respect to $\mathcal W$ is the number of congruences of $L$ divided by the maximum number of…

For $b>1$ and $\alpha\beta$ a string of two digits in base $b$, let $K_1$ be the subsum of the harmonic series with only those integers having exactly one occurrence of $\alpha\beta$. We obtain a theoretical representation of such $K_1$…

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is necessary for extracting a string with randomness rate 1 from a…

Motivated by the search for an appropriate notion of a cluster superalgebra, incorporating Grassmann variables, Ovsienko and Tabachnikov considered the extension of various recurrence relations with the Laurent phenomenon to the ring of…

The Longest Common Subsequence (LCS) is a fundamental string similarity measure, and computing the LCS of two strings is a classic algorithms question. A textbook dynamic programming algorithm gives an exact algorithm in quadratic time, and…

In this paper we initiate the study of computing a maximal (not necessarily maximum) repeating pattern in a single input string, where the corresponding problems have been studied (e.g., a maximal common subsequence) only in two or more…

Assuming the validity of random matrices for describing the statistics of a closed chaotic quantum system, we study analytically some statistical properties of the S-matrix characterizing scattering in its open counterpart. In the first…

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…