Results 81 to 90 of about 11,763 (233)
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2005 A combinatorial map is a connected topological graph cellularly embedded in a surface. As a linking of combinatorial configuration with the classical mathematics, it fascinates more and more mathematician’s interesting.
Linfan Mao, MAO, LINFAN
core +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
ON THE GROWTH OF GROUPS AND AUTOMORPHISMS [PDF]
International Journal of Algebra and Computation, 2005 We consider the growth functions βΓ(n) of amalgamated free products Γ = A *C B, where A ≅ B are finitely generated, C is free abelian and |A/C| = |A/B| = 2. For every d ∈ ℕ there exist examples with βΓ(n) ≃ nd+1βA(n). There also exist examples with βΓ(n) ≃ en. Similar behavior is exhibited among Dehn functions.
openaire +3 more sources
Fixed points of finite groups acting on generalised Thompson groups [PDF]
, 2010 We study centralisers of finite order automorphisms of the generalised Thompson groups Fn, ? and conjugacy classes of finite sub- groups in finite extensions of Fn, ?. In particular we show that centralisers of finite automorphisms in Fn, ? are either of
Nucinkis, B.E.A. +2 more
core
Automorphisms of Group Extensions [PDF]
, 2013 After a brief survey of the theory of group extensions and, in particular, of automorphisms of group extensions, we describe some recent reduction theorems for the inducibility problem for pairs of ...
Robinson, Derek J.S.
core +2 more sources
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley +1 more source
Bernoulli shifts and induced automorphisms [PDF]
, 1979 We show that Bernoulli shifts induce, on a dense class of sets, weakly mixing automorphisms which are not mixing. We also show that the non-Bernoulli K-automorphisms described by Ornstein and Shields induce Bernoulli shifts on a dense class of sets.
Swanson, Laif
core +1 more source
On Nielsen equivalence classes of two‐element generators of mapping class groups
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract We show that there are infinitely many Nielsen equivalence classes of the mapping class group of a closed oriented surface of genus at least eight.
Susumu Hirose, Naoyuki Monden
wiley +1 more source
Journal of Algebra, 2007 Let \({\mathcal E}\colon N\rightarrowtail G\twoheadrightarrow Q\) be a group extension with coupling \(\chi\colon Q\to\text{Out\,}N\). If \(\Aut\,{\mathcal E}=\{\gamma\in\Aut\,G\mid N^\gamma=N\}\), \(\text{Comp}(\chi)\) the group of all compatible pairs for \(\chi\) and \(A\) the center of \(N\) regarded as a \(Q\)-module via \(\chi\) then it is known [
openaire +2 more sources
One note on the number of pairwise non-isomorphic connected regular graphs
Mathematics OpenIn this paper, we give an explicit expression for the number of pairwise non-isomorphic connected regular graphs as well as odd graphs on n vertices, where [Formula: see text] is a positive integer.
Hailin Liu, Liping Zhong, Huixian Xu
doaj +1 more source