Results 101 to 110 of about 39,756 (284)

Automorphisms of the Dihedral Groups [PDF]

open access: yesProceedings of the National Academy of Sciences, 1942
Not ...
openaire   +3 more sources

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

open access: yesJournal 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

Prime Fano threefolds of genus 12 with a $G_m$-action [PDF]

open access: yesÉpijournal de Géométrie Algébrique, 2018
We give an explicit construction of prime Fano threefolds of genus 12 with a $G_m$-action, describe their isomorphism classes and automorphism groups.
Alexander Kuznetsov, Yuri Prokhorov
doaj   +1 more source

On automorphism groups of affine surfaces [PDF]

open access: yes, 2015
This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic groups.
S. Kovalenko   +2 more
semanticscholar   +1 more source

An obstruction to the strong relative hyperbolicity of a group

open access: yes, 2006
We give a simple combinatorial criterion for a group that, when satisfied, implies the group cannot be strongly relatively hyperbolic. Our criterion applies to several classes of groups, such as surface mapping class groups, Torelli groups, and ...
Javier Aramayona   +5 more
core   +1 more source

Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant

open access: yesJournal 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

On finite dual Cayley graphs

open access: yesOpen Mathematics, 2020
A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj   +1 more source

On the Geometry of the Automorphism Group of a Free Group

open access: yesBulletin of the London Mathematical Society, 1995
The groups \(\Aut(F_3)\) and \(\text{Out}(F_3)\) satisfy strictly exponential isoperimetric inequalities; in particular, they are not automatic. For \(n\geq 3\), \(\Aut(F_n)\) and \(\text{Out}(F_n)\) do not admit bounded bicombings of sub-exponential length, hence they cannot act properly and cocompactly by isometries of any simply-connected space of ...
Bridson, M, Vogtmann, K
openaire   +3 more sources

On Group Ring Automorphisms [PDF]

open access: yesAlgebras and Representation Theory, 2004
Let \(G\) be a finite group and \(R\) be a complete discrete valuation ring of characteristic \(0\). The authors study the group of those automorphisms \(\text{Outcent}(RG)\) of the group ring \(RG\) which fix the center of \(RG\) pointwise. As a main result of the paper the authors show that if \(B\) is a block of the group ring of \(G\) over the \(p\)
Hertweck, Martin, Nebe, Gabriele
openaire   +1 more source

Cyclic permutable subgroups of finite groups [PDF]

open access: yes, 2001
The authors describe the structure of the normal closure of a cyclic permutable subgroup of odd order in a finite ...
Cossey, John, Stonehewer, Stewart E.
core   +1 more source

Home - About - Disclaimer - Privacy