English
Related papers

Related papers: Classification of finite groups that admit an orie…

200 papers

A class of groups is investigated, each of which has a fairly simple presentation . For example the group $R = (a, b, c, d | a^3 = b^3 = c^3 = d^3 = 1, ba^{-1} =dc^{-1}, ca^{-1} = db^{-1}) $ is in the class. Such a group does not have as a…

Geometric Topology · Mathematics 2008-05-19 M. J. Dunwoody

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

Group Theory · Mathematics 2019-03-18 Peteris Daugulis

Let $n\le 5$ be an integer, and let $\Gamma$ be a finite group. We prove that if $\rho , \rho': \Gamma \to O(n)$ are two representations that are conjugate by an orientation-preserving diffeomorphism, then they are conjugate by an element…

Group Theory · Mathematics 2024-04-03 Luis Eduardo García-Hernández , Ben Williams

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…

Group Theory · Mathematics 2021-12-21 Ihechukwu Chinyere , Gerald Williams

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

Combinatorics · Mathematics 2025-03-19 Michael Anastos , Zhihan Jin , Matthew Kwan , Benny Sudakov

We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…

Combinatorics · Mathematics 2017-08-24 Alice Miller , Michael Codish

We show that if $X$ is an indecomposable $PD_3$-complex and $\pi_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then $X$ is orientable, the underlying graph is a tree, all the edge…

Geometric Topology · Mathematics 2014-07-22 J. A. Hillman

A graph is said to be $k$-{\em isoregular} if any two vertex subsets of cardinality at most $k$, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no $3$-isoregular bicirculant (and more…

Combinatorics · Mathematics 2025-01-31 Klavdija Kutnar , Dragan Marušič , Štefko Miklavič

Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…

Representation Theory · Mathematics 2022-05-25 Michele D'Adderio , William Hautekiet , Paolo Saracco , Joost Vercruysse

We show that many $2$-dimensional Artin groups are residually finite. This includes $3$-generator Artin groups with labels $\geq 4$ except for $(2m+1, 4,4)$ for any $m\geq 2$. As a first step towards residual finiteness we show that these…

Group Theory · Mathematics 2022-05-10 Kasia Jankiewicz

In this article, we study the derivations of group algebras of some important groups, namely, dihedral ($D_{2n}$), Dicyclic ($T_{4n}$) and Semi-dihedral ($SD_{8n}$). First, we explicitly classify all inner derivations of a group algebra…

Rings and Algebras · Mathematics 2024-10-06 Praveen Manju , Rajendra Kumar Sharma

A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $\Gamma$ such that the automorphism group $\mathrm{Aut}(\Gamma)$ of $\Gamma$ satisfies the following properties:…

Combinatorics · Mathematics 2021-08-02 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

The quasi-redirecting (QR) boundary, introduced by Qing and Rafi, generalizes the Gromov boundary for studying the large-scale geometry of finitely generated groups. Although it is not known to exist for all such groups, its existence has…

Group Theory · Mathematics 2025-05-13 Hoang Thanh Nguyen

We define a new class of irreducible groups, called groups not infinite-index presentable by products or not IIPP. We prove that certain aspherical manifolds with fundamental groups not IIPP do not admit maps of non-zero degree from direct…

Geometric Topology · Mathematics 2019-09-09 Christoforos Neofytidis

An order is a commutative ring that as an abelian group is finitely generated and free. A commutative ring is reduced if it has no non-zero nilpotent elements. In this paper we use a new tool, namely, the fact that every reduced order has a…

Commutative Algebra · Mathematics 2023-12-01 H. W. Lenstra , A. Silverberg , D. M. H. van Gent

The fundamental groups of compact 3-manifolds are known to be residually finite. Feng Luo conjectured that a stronger statement is true, by only allowing finite groups of the form $PGL(2,R),$ where $R$ is some finite commutative ring with…

Geometric Topology · Mathematics 2017-03-21 Stefan Friedl , Montek Gill , Stephan Tillmann

A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We…

Combinatorics · Mathematics 2018-12-12 Primož Potočnik , Micael Toledo

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

Group Theory · Mathematics 2007-10-09 Luc Guyot

In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…

Computational Geometry · Computer Science 2019-08-27 Steven Chaplick , Henry Förster , Myroslav Kryven , Alexander Wolff