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 27 for “"Combinatorial Group Theory"”.

  1. Some Results on Free Groups in Combinatorial Group Theory

    Let Fm be a free group of a finite rank m ≥ 2. We prove that there exist two elements u 1, u2 ∈ Fm such that every endomorphism y of Fm with non-cyclic image is completely determined by y (u1), y (u2). We obtain this result as a corollary of the construction of a C-test word vn( x1,...,xn), …

    uiuc Repository record for Some Results on Free Groups in Combinatorial Group Theory (opens in a new tab)

  2. Three-Dimensional Optimization of Touch Panel Design with Combinatorial Group Theory

    … reduction of representation achieved by combinatorial group theory. The research model is of difficulty NP-complete. Additional exclusive-or functions for uniqueness, strengthening model search space, symmetry eliminating constraints, and implementation constraints are incorporated for …

    waterloo Repository record for Three-Dimensional Optimization of Touch Panel Design with Combinatorial Group Theory (opens in a new tab)

  3. The Structure of the Cayley Complex and a Cubic-Time Algorithm for Solving the Conjugacy Problem for Groups of Prime Alternating Knots

    … possible, requiring only some familiarity with groups and with some concepts from first-year topology; some experience with graphs and/or geometric 2-complexes is helpful. The preface includes a history of knot theory and combinatorial group theory.

    uiuc Repository record for The Structure of the Cayley Complex and a Cubic-Time Algorithm for Solving the Conjugacy Problem for Groups of Prime Alternating Knots (opens in a new tab)

  4. Rewriting Methods in Groups with Applications to Cryptography

    … we describe how various rewriting methods in combinatorial group theory can be used to diffuse information about group elements, which makes it possible to use these techniques as an important constituent in cryptographic primitives. We also show that, while most group-based cryptographic …

    cuny-grad Repository record for Rewriting Methods in Groups with Applications to Cryptography (opens in a new tab)

  5. Torelli Actions and Smooth Structures on 4-manifolds

    In the theory of Artin presentations, a smooth four manifold is already determined by an Artin presentation of the fundamental group of its boundary. Thus, one of the central problems in four dimensional smooth topology, namely the study of smooth structures on these manifolds and their Donaldson …

    maryland Repository record for Torelli Actions and Smooth Structures on 4-manifolds (opens in a new tab)

  6. Dehn's Problems And Geometric Group Theory

    … three decision problems for finitely presented groups that have remained central to the study of combinatorial group theory. His work provided the foundation for geometric group theory, which aims to analyze groups using the topological and geometric properties of the spaces they act on. In this …

    calpoly Repository record for Dehn's Problems And Geometric Group Theory (opens in a new tab)

  7. Thurston Polytopes

    … topology making stops in fields as diverse as combinatorial group theory, Floer homology, and hyperbolic geometry. In this way, we hope to convince the reader that this invariant is well worth study.

    tamu Repository record for Thurston Polytopes (opens in a new tab)

  8. Thurston Polytopes

    … topology making stops in fields as diverse as combinatorial group theory, Floer homology, and hyperbolic geometry. In this way, we hope to convince the reader that this invariant is well worth study.

    tamu Repository record for Thurston Polytopes (opens in a new tab)

  9. Algorithmic Problems in Automorphic Orbits of Free Groups

    One of the fundamental problems in the field of combinatorial group theory is telling when two group presentations represent isomorphic groups. Since applying a free group automorphism to the set of relators of a presentation gives an isomorphic group, we want to be able to quickly decide when …

    cuny-grad Repository record for Algorithmic Problems in Automorphic Orbits of Free Groups (opens in a new tab)

  10. Algorithmic problems for subsemigroups of infinite groups

    … with several algorithmic problems for subsemigroups of infinite groups. The main objective is to construct algorithms that decide various properties of finitely generated subsemigroups of a given infinite group G (for example, a matrix group). Such problems might not be decidable in general. …

    oxford Repository record for Algorithmic problems for subsemigroups of infinite groups (opens in a new tab)

  11. HNN extensions of inverse semigroups

    The concept of HNN-extensions of groups was introduced by Higman, Neumann and Neumann in their study of embeddability of groups in 1949. In combinatorial group theory, HNN-extensions play an important role in applications to algorithmic problems. Recent work of Yamamura introduces HNN-extensions in …

    nebraska Repository record for HNN extensions of inverse semigroups (opens in a new tab)

  12. HNN extensions of inverse semigroups

    The concept of HNN extensions of groups was introduced by Higman, Neumann and Neumann in their study of embeddability of groups in 1949. HNN extensions and amalgamated free products have played a crucial role in combinatorial group theory, especially for algorithmic problems. In semigroup theory, …

    nebraska Repository record for HNN extensions of inverse semigroups (opens in a new tab)

  13. Some Fellow-Traveler Properties on Finite Graphs

    … is the Cayley graph of some finitely generated group G which acts discretely and co-compactly in hyperbolic space, then points on geodesic paths α and β, beginning on a point O and terminating on a vertex τ or pair of adjacent vertices τ1, τ2, always remain within some distance D of one another. …

    jhu Repository record for Some Fellow-Traveler Properties on Finite Graphs (opens in a new tab)

  14. Symmetric covers of graphs and maps

    The symmetry of a combinatorial graph can be measured by its automorphism group. Graphs with a high degree of symmetry are interesting from mathematical and aesthetic perspectives, and have also proved useful in practical contexts such as the design of efficient networks (with good broadcast or …

    auckland-ms Repository record for Symmetric covers of graphs and maps (opens in a new tab)

  15. Deformation spaces and irreducible automorphisms of a free product

    The (outer) automorphism group of a finitely generated free group Fn, which we denote by Out(Fn), is a central object in the fields of geometric and combinatorial group theory. My thesis focuses on the study of the automorphism group of a free product of groups. As every finitely generated group …

    soton Download PDF for Deformation spaces and irreducible automorphisms of a free product (opens in a new tab)

  16. Snowflake Groups with Super-Exponential 2-dimensional Dehn Functions

    … Dani. In this paper, the authors construct groups whose 2-dimensional Dehn functions $\delta^{(2)}(x) \simeq \exp^n(x)$, where $n$ is a natural number and $\exp^n(x)$ is a tower of exponentials of height $n$ (i.e. $\exp^n(x)=e^{e^{\cdot^{\cdot^{\cdot^{e^x}}}}}$). The second paper is called …

    oklahoma-thes Repository record for Snowflake Groups with Super-Exponential 2-dimensional Dehn Functions (opens in a new tab)

  17. Snowflake Groups with Super-Exponential 2-dimensional Dehn Functions

    … Dani. In this paper, the authors construct groups whose 2-dimensional Dehn functions $\delta^{(2)}(x) \simeq \exp^n(x)$, where $n$ is a natural number and $\exp^n(x)$ is a tower of exponentials of height $n$ (i.e. $\exp^n(x)=e^{e^{\cdot^{\cdot^{\cdot^{e^x}}}}}$). The second paper is called …

    oklahoma-thes Repository record for Snowflake Groups with Super-Exponential 2-dimensional Dehn Functions (opens in a new tab)

  18. The classification of isotrivially fibred surfaces with p_g=q=2, and topics on Beauville surfaces

    … F )/G, for C and F smooth curves and G a finite group acting freely on C times F. Beauville surfaces are a special case of surfaces isogenous to a product. In this thesis we include part of a joint work with Shelly Garion, in which we construct new Beauville surfaces with group G either …

    bayreuth Repository record for The classification of isotrivially fibred surfaces with p_g=q=2, and topics on Beauville surfaces (opens in a new tab)

  19. Orderability, generalized torsion and amalgams

    We study two related topics about orderable groups. First, we investigate a type of order-preserving isomorphism of free groups to study the bi-orderability of group extensions. We give a sufficient condition ensuring these isomorphisms are order-preserving. As an application, we answer a question …

    manitoba Repository record for Orderability, generalized torsion and amalgams (opens in a new tab)

Page 1 of 2