Related papers: Envelope Word and Gap Sequence in Doubling Sequenc…

Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in $2$-colorings of the edges of the complete graph $K_n$ that deal with the appearance of unavoidable patterns once a…

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

We study the length of the gaps between consecutive members in the sumset sA when A is a pseudo s-th power sequence, with s>1. We show that, almost surely, limsup (b_{n+1}-b_{n})/log (b_n) = s^s s!/\Gamma^s(1/s), where b_n are the elements…

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't…

We consider the positions of occurrences of a factor $x$ and its binary complement $\overline{x}$ in the Thue-Morse word ${\bf t} = {\tt 01101001} \cdots$, and show that these occurrences are "intertwined" in essentially two different ways.…

A word $w$ is said to be closed if it has a proper factor $x$ which occurs exactly twice in $w$, as a prefix and as a suffix of $w$. Based on the concept of Ziv-Lempel factorization, we define the closed $z$-factorization of finite and…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…

We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…

For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \ll \log n$; the former,…

In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…

We prove that every $n$-letter word over $k$-letter alphabet contains some word as a subsequence in at least $k^{n/4k(1+o(1))}$ many ways, and that this is sharp as $k\to\infty$. For fixed $k$, we show that the analogous number deviates…

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…

For a given language $L$, we study the languages $X$ such that for all distinct words $u, v \in L$, there exists a word $x \in X$ that appears a different number of times as a factor in $u$ and in $v$. In particular, we are interested in…

Generalized Word Length Pattern (GWLP) is an important and widely-used tool for comparing fractional factorial designs. We consider qualitative factors, and we code their levels using the roots of the unity. We write the GWLP of a fraction…

We provide a fairly large class of II$_1$ factors $N$ such that $M=N\bar{\otimes}R$ has a unique McDuff decomposition, up to isomorphism, where $R$ denotes the hyperfinite II$_1$ factor. This class includes all II$_1$ factors…