scholarly journals Formal language convexity in left-orderable groups

2020 ◽  
Vol 30 (07) ◽  
pp. 1437-1456
Author(s):  
Hang Lu Su
Keyword(s):  
Formal Language ◽  
Hyperbolic Group ◽  
Infinite Family ◽  
Positive Cone ◽  
Finitely Generated ◽  
Orderable Group ◽  
Language Representation ◽  
Left Order ◽  
Finite Index Subgroups ◽  
Special Case

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes to its finite index subgroups, and to show that there exists no left order on a finitely generated acylindrically hyperbolic group such that the corresponding positive cone is represented by a quasi-geodesic regular language. We also answer one of Navas’ questions by giving an example of an infinite family of groups which admit a positive cone that is generated by exactly [Formula: see text] generators, for every [Formula: see text]. As a special case of our construction, we obtain a finitely generated positive cone for [Formula: see text].

scholarly journals No positive cone in a free product is regular

2017 ◽  
Vol 27 (08) ◽  
pp. 1113-1120
Author(s):  
Susan Hermiller ◽  
Zoran Šunić
Keyword(s):  
Free Product ◽  
Positive Cone ◽  
Finitely Generated ◽  
Free Products ◽  
Language Complexity ◽  
Chomsky Hierarchy ◽  
Positive Elements ◽  
Left Order ◽  
Context Free ◽  
Product Of Groups

We show that there exists no left order on the free product of two nontrivial, finitely generated, left-orderable groups such that the corresponding positive cone is represented by a regular language. Since there are orders on free groups of rank at least two with positive cone languages that are context-free (in fact, 1-counter languages), our result provides a bound on the language complexity of positive cones in free products that is the best possible within the Chomsky hierarchy. It also provides a strengthening of a result by Cristóbal Rivas which states that the positive cone in a free product of nontrivial, finitely generated, left-orderable groups cannot be finitely generated as a semigroup. As another illustration of our method, we show that the language of all geodesics (with respect to the natural generating set) that represent positive elements in a graph product of groups defined by a graph of diameter at least 3 cannot be regular.

scholarly journals Quantitative residual properties of Γ-limit groups

2014 ◽  
Vol 24 (02) ◽  
pp. 207-231
Author(s):  
Brent B. Solie
Keyword(s):  
Hyperbolic Group ◽  
Finitely Generated ◽  
Limit Group ◽  
Limit Groups ◽  
Residual Properties

Let Γ be a fixed hyperbolic group. The Γ-limit groups of Sela are exactly the finitely generated, fully residually Γ groups. We introduce a new invariant of Γ-limit groups called Γ-discriminating complexity. We further show that the Γ-discriminating complexity of any Γ-limit group is asymptotically dominated by a polynomial.

scholarly journals Non-branching RCD(0,N) Geodesic Spaces with Small Linear Diameter Growth have Finitely Generated Fundamental Groups

2015 ◽  
Vol 58 (4) ◽  
pp. 787-798 ◽  
Author(s):  
Yu Kitabeppu ◽  
Sajjad Lakzian
Keyword(s):  
Diameter Growth ◽  
Fundamental Groups ◽  
Finitely Generated ◽  
Finite Generation ◽  
Alexandrov Spaces ◽  
Geodesic Spaces ◽  
Special Case ◽  
Linear Diameter

AbstractIn this paper, we generalize the finite generation result of Sormani to non-branching RCD(0, N) geodesic spaces (and in particular, Alexandrov spaces) with full supportmeasures. This is a special case of the Milnor’s Conjecture for complete non-compact RCD(0, N) spaces. One of the key tools we use is the Abresch–Gromoll type excess estimates for non-smooth spaces obtained by Gigli–Mosconi.

scholarly journals Spherical vortices in rotating fluids

2018 ◽  
Vol 846 ◽  
Author(s):  
M. M. Scase ◽  
H. L. Terry
Keyword(s):  
Ideal Fluid ◽  
Rotation Rate ◽  
Wave Motion ◽  
Infinite Family ◽  
Vortex Rings ◽  
Rotating Fluids ◽  
Critical Rotation ◽  
Spherical Vortex ◽  
Inertial Wave ◽  
Special Case

A popular model for a generic fat-cored vortex ring or eddy is Hill’s spherical vortex (Phil. Trans. R. Soc. A, vol. 185, 1894, pp. 213–245). This well-known solution of the Euler equations may be considered a special case of the doubly infinite family of swirling spherical vortices identified by Moffatt (J. Fluid Mech., vol. 35 (1), 1969, pp. 117–129). Here we find exact solutions for such spherical vortices propagating steadily along the axis of a rotating ideal fluid. The boundary of the spherical vortex swirls in such a way as to exactly cancel out the background rotation of the system. The flow external to the spherical vortex exhibits fully nonlinear inertial wave motion. We show that above a critical rotation rate, closed streamlines may form in this outer fluid region and hence carry fluid along with the spherical vortex. As the rotation rate is further increased, further concentric ‘sibling’ vortex rings are formed.

FREE INVERSE MONOIDS AND GRAPH IMMERSIONS

1993 ◽  
Vol 03 (01) ◽  
pp. 79-99 ◽  
Author(s):  
STUART W. MARGOLIS ◽  
JOHN C. MEAKIN
Keyword(s):  
Formal Language ◽  
Inverse Monoid ◽  
Finitely Generated ◽  
Inverse Monoids ◽  
Rational Subset ◽  
The Relationship ◽  
Subgroup Theorem ◽  
Free Inverse Monoid ◽  
Natural Way

The relationship between covering spaces of graphs and subgroups of the free group leads to a rapid proof of the Nielsen-Schreier subgroup theorem. We show here that a similar relationship holds between immersions of graphs and closed inverse submonoids of free inverse monoids. We prove using these methods, that a closed inverse submonoid of a free inverse monoid is finitely generated if and only if it has finite index if and only if it is a rational subset of the free inverse monoid in the sense of formal language theory. We solve the word problem for the free inverse category over a graph Γ. We show that immersions over Γ may be classified via conjugacy classes of loop monoids of the free inverse category over Γ. In the case that Γ is a bouquet of X circles, we prove that the category of (connected) immersions over Γ is equivalent to the category of (transitive) representations of the free inverse monoid FIM(X). Such representations are coded by closed inverse submonoids of FIM(X). These monoids will be constructed in a natural way from groups acting freely on trees and they admit an idempotent pure retract onto a free inverse monoid. Applications to the classification of finitely generated subgroups of free groups via finite inverse monoids are developed.

ON KAZHDAN CONSTANTS OF FINITE INDEX SUBGROUPS IN SLn(ℤ)

2012 ◽  
Vol 22 (03) ◽  
pp. 1250026
Author(s):  
UZY HADAD
Keyword(s):  
Finite Index ◽  
Congruence Subgroup ◽  
Infinite Family ◽  
Principal Congruence ◽  
The Other ◽  
Index Subgroup ◽  
Generating Set ◽  
Principal Congruence Subgroup ◽  
Finite Index Subgroup ◽  
Finite Index Subgroups

We prove that for any finite index subgroup Γ in SL n(ℤ), there exists k = k(n) ∈ ℕ, ϵ = ϵ(Γ) > 0, and an infinite family of finite index subgroups in Γ with a Kazhdan constant greater than ϵ with respect to a generating set of order k. On the other hand, we prove that for any finite index subgroup Γ of SL n(ℤ), and for any ϵ > 0 and k ∈ ℕ, there exists a finite index subgroup Γ′ ≤ Γ such that the Kazhdan constant of any finite index subgroup in Γ′ is less than ϵ, with respect to any generating set of order k. In addition, we prove that the Kazhdan constant of the principal congruence subgroup Γn(m), with respect to a generating set consisting of elementary matrices (and their conjugates), is greater than [Formula: see text], where c > 0 depends only on n. For a fixed n, this bound is asymptotically best possible.

scholarly journals Statistics of subgroups of the modular group

2021 ◽  
pp. 1-61
Author(s):  
Frédérique Bassino ◽  
Cyril Nicaud ◽  
Pascal Weil
Keyword(s):  
Finite Index ◽  
Modular Group ◽  
Large Deviation ◽  
Free Subgroup ◽  
Index Formula ◽  
Index Subgroup ◽  
Finitely Generated ◽  
Finite Index Subgroup ◽  
Free Subgroups ◽  
Finite Index Subgroups

We count the finitely generated subgroups of the modular group [Formula: see text]. More precisely, each such subgroup [Formula: see text] can be represented by its Stallings graph [Formula: see text], we consider the number of vertices of [Formula: see text] to be the size of [Formula: see text] and we count the subgroups of size [Formula: see text]. Since an index [Formula: see text] subgroup has size [Formula: see text], our results generalize the known results on the enumeration of the finite index subgroups of [Formula: see text]. We give asymptotic equivalents for the number of finitely generated subgroups of [Formula: see text], as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size [Formula: see text] subgroup and prove a large deviation statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size [Formula: see text] subgroup (respectively, finite index subgroup, free subgroup) of [Formula: see text].

Language Attrition as a Special Case of Processing Change

2019 ◽  
pp. 72-87
Author(s):  
Michael Sharwood Smith
Keyword(s):  
Cognitive Processing ◽  
Language Processing ◽  
Language Attrition ◽  
Change Over Time ◽  
Knowledge Representations ◽  
Language Representation ◽  
Research Findings ◽  
Processing Mechanisms ◽  
Special Case ◽  
Over Time

This chapter examines the ways in which language processing has been treated in both the attrition and the acquisition literature, embedding the discussion within a wider view of how knowledge representations change over time. Even where particular types of language representation are understood to be governed by principles unique to language, attrition must be seen as a manifestation of general cognitive processing principles as well. For this you need a framework that allows many different strands of research to be carried out within a single, detailed, workable, unified account. This can lead to richer and more reliable explanations of research findings. The chapter will employ such a framework to examine language attrition with regard to 1) the nature and operation of language processing mechanisms; 2) how these relate to other types of cognitive processing; 3) how processing acts as the driver of representational change.

scholarly journals Presentability by products for some classes of groups

2017 ◽  
Vol 09 (01) ◽  
pp. 27-49
Author(s):  
P. de la Harpe ◽  
D. Kotschick
Keyword(s):  
Coxeter Groups ◽  
Cohomological Dimension ◽  
Fundamental Groups ◽  
Finitely Generated ◽  
Infinite Groups ◽  
Finitely Generated Groups ◽  
Dense Subgroups ◽  
Finite Index Subgroups ◽  
Virtual Cohomological Dimension ◽  
By Products

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include groups of small virtual cohomological dimension and irreducible Zariski dense subgroups of appropriate algebraic groups. This leads to applications to groups of positive deficiency, to fundamental groups of three-manifolds and to Coxeter groups. For finitely generated groups presentable by products we discuss the problem of whether the factors in a presentation by products may be chosen to be finitely generated.

Brauer Characters and Grothendieck Rings

1975 ◽  
Vol 27 (5) ◽  
pp. 1025-1028 ◽  
Author(s):  
B. M. Puttaswamaiah
Keyword(s):  
Finite Order ◽  
Group Algebra ◽  
Irreducible Representations ◽  
Splitting Field ◽  
Finitely Generated ◽  
Grothendieck Ring ◽  
Primitive Idempotents ◽  
Brauer Characters ◽  
Grothendieck Rings ◽  
Special Case

Let G be a group of finite order g, A a splitting field of G of characteristic p (which may be 0) and R = AG the group algebra of G over A. In [2], the author studied some of the properties of the Grothendieck ring K(R) of the category of all finitely generated R-modules, and derived a number of consequences. This paper continues the study carried out in [2]. The study is concerned with the structure and irreducible representations of K(R). The ring K(R) is proved to be semisimple and the primitive idempotents of K(R) are explicitly constructed. If the ring K(R) is identified with the ‘algebra of representations', then Robinson's idempotent [3; 4; 5] follow from our description as a special case.

Sign in / Sign up

Export Citation Format

Share Document