Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 54 for “"Generating sets"”.
-
Small torsion generating sets for mapping class groups
… is finitely generated. The most commonly used generating sets for Mod(S_g) are comprised of infinite order elements called Dehn twists; however, a number of authors have shown that torsion generating sets are also possible. For example, Brendle and Farb showed that Mod(S_g) is generated by six …
-
Contributions to Recognizability: Self-generating Sets, Decidability, Automaticity and Multidimensional Sets
… questions concerning recognizability of integer sets by finite automata. Each particular problem is the focus of a chapter. First, we study the recognizability of the so-called self-generating sets, initially introduced by C. Kimberling. In the second part, we study the syntactic complexity of …
-
Minimal generating sets of ideals and torsion in the tensor product of I and (,R)I('-1)
Let (R, m) be a commutative one-dimensional local Noetherian domain. Assume the integral closure R is a discrete valuation ring and the residue fields of R and R are the same. Let Rx be the maximal ideal of R and let I be a non-principal ideal of R. A question, motivated by the work of Auslander in …
-
Independence complexes of finite groups
Understanding generating sets for finite groups has been explored previously via the generating graph of a group, where vertices are group elements and edges are given by pairs of group elements that generate the group. We generalize this idea by considering minimal generating sets (with respect to …
-
Languages, Geodesics, And HNN Extensions
… locally excluding for some finite inverse-closed generating set. The existence of such a correspondence and the result of Hermiller, Holt, and Rees that finitely generated abelian groups have piecewise excluding geodesic language for all finite inverse-closed generating sets motivated our work. We …
-
On the symmetric generation of finite groups
… symmetric presentations defined by symmetric generating sets that are preserved by a group acting on them transitively but imprimitively. In Chapter 3 our attention turns to Coxeter groups. We show how the Coxeter-Moser presentations traditionally associated with the families of finite Coxeter …
-
Symmetric generation of M₂₂
… the Mathieu group M₂₂ contains two symmetric generating sets with control grougp L₃ (2). The first generating set consists of order 3 elements while the second consists of involutions.
-
Symmetric generation of M₂₂
… the Mathieu group M₂₂ contains two symmetric generating sets with control grougp L₃ (2). The first generating set consists of order 3 elements while the second consists of involutions.
-
New computational methods for analysing finitely-presented groups
… generators. We use this procedure to find nice generating sets for torsion-free subgroups of finite index in ordinary triangle groups, with implications for the study of regular maps and automorphism groups of compact Riemann surfaces. Our second procedure is an improvement of the package PEACE …
-
Symmetric representation of elements of finite groups
… to all finite groups that possess symmetric generating sets of involutions. Such groups include all finite non-abelian simple groups, which can then be constructed by the technique of manual double coset enumeration.
-
Symmetric representation of elements of finite groups
… to all finite groups that possess symmetric generating sets of involutions. Such groups include all finite non-abelian simple groups, which can then be constructed by the technique of manual double coset enumeration.
-
Palindromic automorphisms of free groups and rigidity of automorphism groups of right-angled Artin groups
… the same backwards as forwards. We obtain finite generating sets for certain stabiliser subgroups of PiA_n. We use these generating sets to find an infinite generating set for the so-called palindromic Torelli group PI_n, the subgroup of PiA_n consisting of palindromic automorphisms inducing the …
-
The Algebra, Geometry, and Topology of Cusped Mapping Tori
… We then develop geometric tools for analyzing generating sets of cusped mapping tori. Using this framework, we make progress on the rank–genus problem for cusped mapping tori whose monodromy has large translation distance in the curve graph.
-
Lattice Isometries and Short Vector Enumeration
… the automorphism group of a lattice using strong generating sets. These both make use of the set of small vectors of a lattice, which can be enumerated using the last algorithm we present. We discuss the use of determining isometry classes as part of computing the Smith-Minkowski-Siegel mass …
-
Algebraic Geometry of Bayesian Networks
… a complete algebraic classification, in terms of generating sets of polynomial ideals, is given for Bayesian networks on at most three random variables and one hidden variable. The relevance of these results for model selection is discussed.
-
Θεωρία ομάδων και lie αλγεβρών
… using Aut(H). We apply our method to construct generating sets for the automorphism groups of certain relatively free nilpotent Lie algebras.
-
Involuções da álgebra de Grassmann: um estudo sobre *- polinômios centrais, *-identidades e *-isomorfismos
… (CENTRONE; GONCALVES; SILVA, 2020), we present generating sets for the ∗-polynomial identities and ∗-central polynomials of the Grassmann algebra, with a strong distinction between the cases char(K) = 0 and char(K) > 2. According to (DINIZ; GUIMARÃES; ROCHA, 2024), when φ satisfies certain …
-
CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION
… the symmetric group Sn generated by di fferent generating sets and we are interested in finding eigenvalues of the graph. With the eigenvalues, we are able to bound its largest independent set by using Delsarte-Ho man Bound. It is well known that the eigenvalues of this graph are indexed by …
Page 1 of 3