English
Related papers

Related papers: On the $k$-abelian complexity of the Cantor sequen…

200 papers

We say that the order of an algebraic number $A$ is the minimum of positive integers $k$ such that $A^k$ is rational. In this paper, we show that the number of algebraic numbers $A$ with order $k$ such that \[ A,\ A^A,\ A^{A^A},\ \ldots \]…

Number Theory · Mathematics 2020-01-08 Hirotaka Kobayashi , Kota Saito , Wataru Takeda

The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…

Logic · Mathematics 2020-12-29 Alexander Shen

A sequence $\textbf{p}=(p_{n})$ of real numbers is called Abel convergent to $\ell$ if the series $\Sigma_{k=0}^{\infty}p_{k}x^{k}$ is convergent for $0\leq x<1$ and \[\lim_{x \to 1^{-}}(1-x) \sum_{k=0}^{\infty}p_{k}x^{k}=\ell.\] We…

Classical Analysis and ODEs · Mathematics 2011-01-10 Huseyin Cakalli , Mehmet Albayrak

We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set…

Dynamical Systems · Mathematics 2022-11-30 Julien Cassaigne , Sébastien Labbé , Julien Leroy

A multipermutation with $k$ copies each of $1\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated…

Combinatorics · Mathematics 2017-02-20 Henrik Eriksson , Alexis Martin

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Commutative Algebra · Mathematics 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…

Number Theory · Mathematics 2015-10-15 Luis A. Medina , Eric Rowland

A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…

Combinatorics · Mathematics 2021-05-20 Gerhard Ramharter , Luca Q. Zamboni

The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…

Number Theory · Mathematics 2024-05-09 Shaun Cooper

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Number Theory · Mathematics 2014-02-26 W. T. Gowers , J. Wolf

We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…

Cryptography and Security · Computer Science 2019-10-11 Chenhuang Wu , Vladimir Edemskiy , Chunxiang Xu

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

Formal Languages and Automata Theory · Computer Science 2018-07-24 Michel Rigo , Robert Underwood

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

Commutative Algebra · Mathematics 2016-02-09 Mina Bigdeli , Jürgen Herzog , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

Two words $u$ and $v$ are $k$-abelian equivalent if, for each word $x$ of length at most $k$, $x$ occurs equally many times as a factor in both $u$ and $v$. The notion of $k$-abelian equivalence is an intermediate notion between the abelian…

Combinatorics · Mathematics 2016-05-12 Juhani Karhumäki , Svetlana Puzynina , Michaël Rao , Markus A. Whiteland

The middle-third Cantor set C_3 is a fractal consisting of all the points in [0, 1] which have non-terminating base-3 representations involving only the digits 0 and 2. It is easily shown that the reciprocals of all prime numbers p > 3…

Number Theory · Mathematics 2011-11-14 Christian Salas

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…

Combinatorics · Mathematics 2026-04-03 Narges Ghareghani , Mehdi Golafshan , Morteza Mohammad-Noori , Pouyeh Sharifani

In this paper we investigate local to global phenomena for a new family of complexity functions of infinite words indexed by $k \in \Ni \cup \{+\infty\}$ where $\Ni$ denotes the set of positive integers. Two finite words $u$ and $v$ in…

Combinatorics · Mathematics 2013-02-18 Juhani Karhumäki , Aleksi Saarela , Luca. Q. Zamboni

For a non-flat $C^3$ unimodal map with a Cantor attractor, we show that for any open cover $\mathcal U$ of this attractor, the complexity function $p(\mathcal U, n)$ is of order $n\log n$. In the appendix, we construct a non-renormalizable…

Dynamical Systems · Mathematics 2013-12-04 Simin Li , Weixiao Shen

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm…

Number Theory · Mathematics 2025-05-21 Jared Duker Lichtman

Ball's complex plank theorem states that if $v_1,\dots,v_n$ are unit vectors in $\mathbb{C}^d$, and $t_1,\dots,t_n$, non-negative numbers satisfying $\sum_{k=1}^nt_k^2 = 1,$ then there exists a unit vector $v$ in $\mathbb{C}^d$ for which…

Functional Analysis · Mathematics 2021-12-03 Oscar Ortega-Moreno