中文
相关论文

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

200 篇论文

In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…

群论 · 数学 2026-04-29 Laura Ciobanu , Daniel Turaev

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

群论 · 数学 2024-11-21 André Carvalho , Pedro V. Silva

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

This work considers a natural generalization of primitivity with respect to a language. Given a language $L$, a nonempty word $w$ is said to be $L$-primitive if $w$ is not a proper power of any word in $L$. After ascertaining the number of…

形式语言与自动机理论 · 计算机科学 2014-03-25 Shubh Narayan Singh , K. V. Krishna

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

动力系统 · 数学 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

群论 · 数学 2024-08-13 Sobhi Massalha

We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…

形式语言与自动机理论 · 计算机科学 2014-05-23 Chen Fei Du , Jeffrey Shallit

We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface…

群论 · 数学 2009-03-02 Emmanuel Breuillard , Tsachik Gelander , Juan Souto , Peter Storm

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…

群论 · 数学 2011-05-19 Martin Kassabov , Francesco Matucci

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

群论 · 数学 2007-05-23 Pallavi Dani

Abstract upper densities are monotone and subadditive functions from the power set of positive integers into the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

数论 · 数学 2023-09-06 Rafał Filipów , Jacek Tryba

We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is…

形式语言与自动机理论 · 计算机科学 2015-07-03 Stavros Konstantinidis , Mitja Mastnak

In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…

组合数学 · 数学 2026-01-21 Duaa Abdullah , Jasem Hamoud

We study the notion of sparseness for regular languages over finite trees and infinite words. A language of trees is called sparse if the relative number of $n$-node trees in the language tends to zero, and a language of infinite words is…

形式语言与自动机理论 · 计算机科学 2025-07-08 Kord Eickmeyer , Georg Schindling

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

组合数学 · 数学 2021-09-01 Hiêp Hàn , Marcos Kiwi , Matías Pavez-Signé

The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…

统计理论 · 数学 2023-08-03 Marc Hallin , Bas Werker , Bo Zhou

We introduce the notion of density of a rational language with respect to a sequence of probability measures. We prove that if $(\mu_n)$ is a sequence of Bernoulli measures converging to a positive Bernoulli measure $\overline{\mu}$, the…

动力系统 · 数学 2026-03-19 Alexi Block Gorman , Dominique Perrin

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

群论 · 数学 2015-10-09 Tara Brough

The density of a subgroupoid with respect to a free groupoid is defined as the asymptotic ratio of their growths. This notion can be interpreted as a generalisation of the index's inverse for groups or as the probability of an element…

组合数学 · 数学 2024-07-24 Carles Cardó

Abstract upper densities are monotone and subadditive functions from the power set of positive integers to the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

数论 · 数学 2017-09-12 Mauro Di Nasso , Renling Jin