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

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Let $\N$ denote the set of positive integers. The asymptotic density of the set $A \subseteq \N$ is $d(A) = \lim_{n\to\infty} |A\cap [1,n]|/n$, if this limit exists. Let $ \mathcal{AD}$ denote the set of all sets of positive integers that…

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

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…

We prove that a random group, in Gromov's density model with $d<1/16$, satisfies a universal sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a nonabelian free group.

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

An element $g$ of a group $G$ is a test element if every endomorphism of $G$ that fixes $g$ is an automorphism. Let $G$ be a free group of finite rank, an orientable surface group of genus $n \geq 2$, or a non-orientable surface group of…

Let $F$ be a finitely generated non-abelian free group and $Q$ a finite quotient. Denote by $L_Q$ the language obtained by adding unary predicates $P_q$, $q\in Q$ to the language of groups. Using a slight generalization of some of the…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be context-free, then the group is called context-free. Finitely…

This paper investigates a new property of formal languages called REG-measurability where REG is the class of regular languages. Intuitively, a language \(L\) is REG-measurable if there exists an infinite sequence of regular languages that…

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

We study locally compact groups having all dense subgroups (locally) minimal. We call such groups densely (locally) minimal. In 1972 Prodanov proved that the infinite compact abelian groups having all subgroups minimal are precisely the…

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

Density-based clustering relies on the idea of linking groups to some specific features of the probability distribution underlying the data. The reference to a true, yet unknown, population structure allows to frame the clustering problem…

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

Let Q be the set of primitive words over a finite alphabet with at least two symbols. We characterize a class of primitive words, Q_I, referred to as ins-robust primitive words, which remain primitive on insertion of any letter from the…

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…