Related papers: On Theta-palindromic Richness
We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
The Riemann-Siegel theta function $\vartheta(t)$ is examined for $t\to+\infty$. Use of the refined asymptotic expansion for $\log\,\g(z)$ shows that the expansion of $\vartheta(t)$ contains an infinite sequence of increasingly subdominant…
We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…
We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…
We generalize to higher algebraic $K$-theory an identity (originally due to Milnor) that relates the Reidemeister torsion of an infinite cyclic cover to its Lefschetz zeta function. Our identity involves a higher torsion invariant, the…
Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
A palindrome in a free group F_n is a word on some fixed free basis of F_n that reads the same backwards as forwards. The palindromic automorphism group \Pi A_n of the free group F_n consists of automorphisms that take each member of some…
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…
In this note, we revisit the $\Theta$-invariant as defined by R. Bott and the first author. The $\Theta$-invariant is an invariant of rational homology 3-spheres with acyclic orthogonal local systems, which is a generalization of the 2-loop…
It is shown that a relativistic (i.e. a Poincar{\' e} invariant) theory of extended objects (called p-branes) is not necessarily invariant under reparametrizations of corresponding $p$-dimensional worldsheets (including worldlines for $p =…
The main aim of this article is to show that maps with specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps.…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…
Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf's law of word…
Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…
We demonstrate that the soft supersymmetry-breaking terms in a N=1 theory can be linked by simple renormalisation group invariant relations which are valid to all orders of perturbation theory. In the special case of finite N=1 theories,…
Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…
The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…