Related papers: On prefixal factorizations of words

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

While finite automata have minimal DFAs as a simple and natural normal form, deterministic omega-automata do not currently have anything similar. One reason for this is that a normal form for omega-regular languages has to speak about more…

For $r:=(r_1,\dots,r_k)$, an $r$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of (the edges of) $\lambda K_n^h$ into $F_1,\dots, F_k$ such that for $i=1,\dots,k$, $F_i$ is…

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…

A language $L$ is said to be dense if every word in the universe is an infix of some word in $L$. This notion has been generalized from the infix operation to arbitrary word operations $\varrho$ in place of the infix operation…

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

We propose the Transcendental Encoding Conjecture for decision problems, which asserts that every language in complexity class P encodes to an algebraic real (possibly rational or algebraic irrational) under its binary characteristic…

We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…

We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

In the study of infinite words, various notions of balancedness provide quantitative measures for how regularly letters or factors occur, and they find applications in several areas of mathematics and theoretical computer science. In this…

A numerical semigroup $S$ is a cofinite, additively-closed subset of $\mathbb Z_{\ge 0}$ that contains 0, and a factorization of $x \in S$ is a $k$-tuple $z = (z_1, \ldots, z_k)$ where $x = z_1a_1 + \cdots + z_ka_k$ expresses $x$ as a sum…

This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…

Ball, Ortega--Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by…

Perfectly clustering words are one of many possible generalizations of Christoffel words. In this article, we propose a factorization of a perfectly clustering word on a $n$ letters alphabet into a product of $n-1$ palindromes with a letter…

In 1991 H\'ebrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or subsequences). Based on this, first Karandikar and…

For the word $\omega = \underbrace{11\ldots 1}_{x_1}\underbrace{22\ldots2}_{x_2}\ldots\underbrace{nn\ldots n}_{x_n},$ denote by $\mathsf{A}(x_1, x_2, \ldots, x_n)$ the number of its anagrams without fixed letters. While the function…

We generalize the theory of radical factorization from almost Dedekind domain to strongly discrete Pr\"ufer domains; we show that, for a fixed subset $X$ of maximal ideals, the finitely generated ideals with $\mathcal{V}(I)\subseteq X$ have…

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…