• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 3
  • 3
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

ALGORITHMS FOR UPPER BOUNDS OF LOW DIMENSIONAL GROUP HOMOLOGY

Roberts, Joshua D. 01 January 2010 (has links)
A motivational problem for group homology is a conjecture of Quillen that states, as reformulated by Anton, that the second homology of the general linear group over R = Z[1/p; ζp], for p an odd prime, is isomorphic to the second homology of the group of units of R, where the homology calculations are over the field of order p. By considering the group extension spectral sequence applied to the short exact sequence 1 → SL2 → GL2 → GL1 → 1 we show that the calculation of the homology of SL2 gives information about this conjecture. We also present a series of algorithms that finds an upper bound on the second homology group of a finitely-presented group. In particular, given a finitely-presented group G, Hopf's formula expresses the second integral homology of G in terms of generators and relators; the algorithms exploit Hopf's formula to estimate H2(G; k), with coefficients in a finite field k. We conclude with sample calculations using the algorithms.
2

Kombinatorická teorie grup v kryptografii / Combinatorial group theory and cryptography

Ferov, Michal January 2012 (has links)
In the presented work we focus on applications of decision problems from combinatorial group theory. Namely we analyse the Shpilrain-Zapata pro- tocol. We give formal proof that small cancellation groups are good platform for the protocol because the word problem is solvable in linear time and they are generic. We also analyse the complexity of the brute force attack on the protocol and show that in a theoretical way the protocol is immune to attack by adversary with arbitrary computing power.
3

Encoding and detecting properties in finitely presented groups

Gardam, Giles January 2017 (has links)
In this thesis we study several properties of finitely presented groups, through the unifying paradigm of encoding sought-after group properties into presentations and detecting group properties from presentations, in the context of Geometric Group Theory. A group law is said to be detectable in power subgroups if, for all coprime m and n, a group G satisfies the law if and only if the power subgroups G(<sup>m</sup>) and G(<sup>n</sup>) both satisfy the law. We prove that for all positive integers c, nilpotency of class at most c is detectable in power subgroups, as is the k-Engel law for k at most 4. In contrast, detectability in power subgroups fails for solvability of given derived length: we construct a finite group W such that W(<sup>2</sup>) and W(<sup>3</sup>) are metabelian but W has derived length 3. We analyse the complexity of the detectability of commutativity in power subgroups, in terms of finite presentations that encode a proof of the result. We construct a census of two-generator one-relator groups of relator length at most 9, with complete determination of isomorphism type, and verify a conjecture regarding conditions under which such groups are automatic. Furthermore, we introduce a family of one-relator groups and classify which of them act properly cocompactly on complete CAT(0) spaces; the non-CAT(0) examples are counterexamples to a variation on the aforementioned conjecture. For a subclass, we establish automaticity, which is needed for the census. The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. For every prime p we construct finite p-groups of arbitrary negative deficiency, and thereby complete Kotschick's proposed classification of the integers which are deficiencies of Kähler groups. We explore variations and embellishments of our basic construction, which require subtle Schur multiplier computations, and we investigate the conditions on inputs to the construction that are necessary for success. A well-known question asks whether any two non-isometric finite volume hyperbolic 3-manifolds are distinguished from each other by the finite quotients of their fundamental groups. At present, this has been proved only when one of the manifolds is a once-punctured torus bundle over the circle. We give substantial computational evidence in support of a positive answer, by showing that no two manifolds in the SnapPea census of 72 942 finite volume hyperbolic 3-manifolds have the same finite quotients. We determine examples of sizeable graphs, as required to construct finitely presented non-hyperbolic subgroups of hyperbolic groups, which have the fewest vertices possible modulo mild topological assumptions.

Page generated in 0.377 seconds