English
Related papers

Related papers: Lifting graph automorphisms along solvable regular…

200 papers

It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…

Combinatorics · Mathematics 2024-01-02 Richard H. Hammack , Paul C. Kainen

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

Combinatorics · Mathematics 2025-04-29 Yanhong Zhu , Kai Yuan

The hyperelliptic mapping class group has been studied in various contexts within topology and algebraic geometry. What makes this study tractable is that there is a surjective map from the hyperelliptic mapping class group to a mapping…

Geometric Topology · Mathematics 2020-03-12 Tyrone Ghaswala , Rebecca R. Winarski

Let $X$ be a compact Riemann surface of genus $g\geq 2$. Let $Aut(X)$ be its group of automorphisms and $G\subseteq Aut(X)$ a subgroup. Sharp upper bounds for $|G|$ in terms of $g$ are known if $G$ belongs to certain classes of groups, e.g.…

Complex Variables · Mathematics 2017-07-05 Andreas Schweizer

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

Combinatorics · Mathematics 2016-11-08 Ameneh Farhadian

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…

Discrete Mathematics · Computer Science 2025-10-09 Jan Bok , Jiří Fiala , Petr Hliněný , Nikola Jedličková , Jan Kratochvíl

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

We classify four-dimensional compact solvmanifolds up to diffeomorphism, while determining which of them have complex analytic structures. In particular, we shall see that a four-dimensional compact solvmanifold S can be written, up to…

Complex Variables · Mathematics 2007-05-23 Keizo Hasegawa

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

Combinatorics · Mathematics 2024-06-10 Jin Guo , Andrey V. Vasil'ev , Rui Wang

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

Computational Geometry · Computer Science 2022-09-23 William Evans , Ellen Gethner , Jack Spalding-Jamieson , Alexander Wolff

Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…

Dynamical Systems · Mathematics 2024-09-24 Jan Boroński , Henk Bruin , Przemysław Kucharski

A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…

Combinatorics · Mathematics 2012-05-31 Béla Bollobás , David Pritchard , Thomas Rothvoß , Alex Scott

We prove that every automorphism of the restricted root system of a real semisimple Lie algebra -- when defined properly -- can be lifted to an automorphism of that Lie algebra. In particular, this can be applied to automorphisms of the…

Differential Geometry · Mathematics 2022-08-22 Ivan Solonenko

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

Commutative Algebra · Mathematics 2009-02-26 Mohammad Mahmoudi , Amir Mousivand , Siamak Yassemi

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

Group Theory · Mathematics 2018-06-05 B. Akbari

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

Operator Algebras · Mathematics 2025-12-23 Swarnendu Datta , Debashish Goswami , Soumalya Joardar

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

Group Theory · Mathematics 2026-02-24 Jonas Deré , Mark Pengitore

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We construct the JSJ decomposition of a vGBS group over abelian groups. We prove that…

Group Theory · Mathematics 2010-12-07 Benjamin Beeker

In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…

Algebraic Geometry · Mathematics 2010-06-08 F. Javier Gallego , Miguel González , Bangere P. Purnaprajna
‹ Prev 1 4 5 6 7 8 10 Next ›