Related papers: Factor complexity of infinite words associated wit…
We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…
Some aspects of the multiplicative anomaly of zeta determinants are investigated. A rather simple approach is adopted and, in particular, the question of zeta function factorization, together with its possible relation with the…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with…
We comment on a recent paper by D'Abramo [Chaos, Solitons & Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm can produce a list of strings containing at least one string whose algorithmic complexity is greater…
By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both…
The theory of subfactors of groups, together with the associated notions of subindices and index stability for groupsandtheirsubsets, hasrecentlybeenintroducedandsystematicallydeveloped. Theseconceptsexhibitdeepconnections with additive…
We find an explicit closed form for the subword complexity of the infinite fixed point of the morphism sending $a \rightarrow aab$ and $b \rightarrow b$. This morphism is then generalized in three different ways, and we find similar…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less…
A finite word $u$ is called closed if its longest repeated prefix has exactly two occurrences in $u,$ once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N \rightarrow \mathbb N$ which counts the number of closed…
Fix natural numbers $n \geq 1$, $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. In previous work with A. Ayyer (J. Alg., 2022), we studied the factorization of specialized irreducible characters of $\text{GL}_{tn}$,…
The structures of full words and non-full for $\beta$-expansions are completely characterized in this paper. We obtain the precise lengths of all the maximal runs of full and non-full words among admissible words with same order.
Let $\alpha>1$ be irrational and of finite type, $\beta\in\mathbb{R}$. In this paper, it is proved that for $R\geqslant13$ and any fixed $c\in(1,c_R)$, there exist infinitely many primes in the intersection of Beatty sequence…
A nonparametric Bayesian extension of Factor Analysis (FA) is proposed where observed data $\mathbf{Y}$ is modeled as a linear superposition, $\mathbf{G}$, of a potentially infinite number of hidden factors, $\mathbf{X}$. The Indian Buffet…
Let $d$ be a positive integer and $U \subset \mathbb{Z}^d$ finite. We study $$\beta(U) : = \inf_{\substack{A , B \neq \emptyset \\ \text{finite}}} \frac{|A+B+U|}{|A|^{1/2}{|B|^{1/2}}},$$ and other related quantities. We employ…