相关论文: A language-theoretic approach to study the density…

As is the case of many signals produced by complex systems, language presents a statistical structure that is balanced between order and disorder. Here we review and extend recent results from quantitative characterisations of the degree of…

We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…

Let $X$ be an affine algebraic variety with a transitive action of the algebraic automorphism group. Suppose that $X$ is equipped with several non-degenerate fixed point free $SL_2$-actions satisfying some mild additional assumption. Then…

This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…

We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

This paper explores the nature of the solution sets of systems of equations in virtually abelian groups. We view this question from two angles. From a formal language perspective, we prove that the set of solutions to a system of equations…

We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language. In particular, the set of all solutions in reduced words is an indexed…

We study the rigidity of the volume entropy for weighted word metrics on hyperbolic groups, building on a recent convexity result due to Cantrell-Tanaka. Using ideas from small cancellation theory, we give conditions under which a…

We study, on average over f, zeros of the L-functions of primitive weight two forms of level q (fixed). We prove, on the one hand, density theorems for the zeros (similar to the results of Bombieri, Jutila, Motohashi, Selberg in the case of…

Consider a random word $X^n=(X_1,\ldots ,X_n)$ in an alphabet consisting of $4$ letters, with the letters viewed either as $A$, $U$, $G$ and $C$ (i.e., nucleotides in an RNA sequence) or $\alpha$, $\bar{\alpha}$, $\beta$ and $\bar{\beta}$…

The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding…

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

Languages are not created randomly but rather to communicate information. There is a strong association between languages and their underlying meanings, resulting in a sparse joint distribution that is heavily peaked according to their…

For a positive integer $n$, with $n \geq 4$, let $R_{n}$ be a free (nilpotent of class 2)-by-abelian and abelian-by-(nilpotent of class 2) Lie algebra of rank $n$. We show that the subgroup of Aut$(R_{n})$ generated by the tame…

We study language generation in the limit under bounded memory. In this task, a learner observes examples from an unknown target language one at a time and must eventually output only new valid examples. Prior work assumes access to the…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Given a nondecreasing sequence $\Lambda=\{\lambda_n>0\}$ such that $\displaystyle\lim_{n\to\infty} \lambda_n=\infty,$ we consider the sequence $\mathcal N_\Lambda:=\left\{\lambda_ne^{i\theta_n},n\in\,\mathbb N\right\}$, where $\theta_n$ are…