scholarly journals Three-dimensional maps and subgroup growth

Author(s):  
Rémi Bottinelli ◽  
Laura Ciobanu ◽  
Alexander Kolpakov

AbstractIn this paper we derive a generating series for the number of cellular complexes known as pavings or three-dimensional maps, on n darts, thus solving an analogue of Tutte’s problem in dimension three. The generating series we derive also counts free subgroups of index n in $$\Delta ^+ = {\mathbb {Z}}_2*{\mathbb {Z}}_2*{\mathbb {Z}}_2$$ Δ + = Z 2 ∗ Z 2 ∗ Z 2 via a simple bijection between pavings and finite index subgroups which can be deduced from the action of $$\Delta ^+$$ Δ + on the cosets of a given subgroup. We then show that this generating series is non-holonomic. Furthermore, we provide and study the generating series for isomorphism classes of pavings, which correspond to conjugacy classes of free subgroups of finite index in $$\Delta ^+$$ Δ + . Computational experiments performed with software designed by the authors provide some statistics about the topology and combinatorics of pavings on $$n\le 16$$ n ≤ 16 darts.

Author(s):  
Frédérique Bassino ◽  
Cyril Nicaud ◽  
Pascal Weil

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].


2011 ◽  
Vol 158 (17) ◽  
pp. 2391-2407 ◽  
Author(s):  
Dikran Dikranjan ◽  
Anna Giordano Bruno

2008 ◽  
Vol 136 (1) ◽  
pp. 145-165
Author(s):  
Vladimir Markovic ◽  
Dragomir Šarić

2012 ◽  
Vol 22 (03) ◽  
pp. 1250026
Author(s):  
UZY HADAD

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.


2015 ◽  
Vol 15 (5) ◽  
pp. 3025-3047 ◽  
Author(s):  
Paul Balmer ◽  
Ivo Dell’Ambrogio ◽  
Beren Sanders

1979 ◽  
Vol 22 (3) ◽  
pp. 191-194 ◽  
Author(s):  
M. J. Tomkinson

The Carter subgroups of a finite soluble group may be characterised either as theself-normalising nilpotent subgroups or as the nilpotent projectors. Subgroups with properties analogous to both of these have been considered by Newell (2, 3) in the class of -groups. The results obtained are necessarily less satisfactory than in the finite case, the subgroups either being almost self-normalising (i.e. having finite index in their normaliser) or having an almost-covering property. Also the subgroups are not necessarily conjugate but lie in finitely many conjugacy classes.


Author(s):  
Colin Maclachlan

SynopsisThe groups of units of indefinite ternary quadratic forms with rational integer coefficients contain subgroups of index two which are isomorphic to Fuchsian groups and which, for zero forms, are commensurable with the classical modular group. This is used to obtain a family of forms whose groups are representatives of the conjugacy classes of maximal groups associated with zero forms. The signatures of the groups of the forms in this family are determined and it is shown that the group associated to any zero form is isomorphic to a subgroup of finite index in the group of one of three particular forms. This last result should be compared with the corresponding result by Mennicke on non-zero forms.


Author(s):  
M. Chau ◽  
R. Couturier ◽  
J. Bahi ◽  
P. Spiteri

The present study deals with the solution of the obstacle problem defined in a three-dimensional domain. In order to solve a large-scale obstacle problem, the use of parallelism is necessary. In this work we present a parallel synchronous iterative algorithm to solve this problem and its asynchronous version. For the considered problem, the convergence of parallel synchronous and asynchronous algorithms is analysed in a general framework. Finally, computational experiments on GRID’5000, the French national grid, are presented and analysed. They allow us to compare both synchronous and asynchronous versions with local and distributed clusters.


Sign in / Sign up

Export Citation Format

Share Document