Results 71 to 80 of about 735 (188)

Derangements in intransitive groups

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 2, February 2026.
Abstract Let G$G$ be a nontrivial permutation group of degree n$n$. If G$G$ is transitive, then a theorem of Jordan states that G$G$ has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If G$G$ is intransitive, then G$G$ may fail to have a derangement, and this can happen even if G$G$ has only two ...
David Ellis, Scott Harper
wiley   +1 more source

CLASSIFICATION OF FINITE p-GROUPS WITH METACYCLIC AUTOMORPHISMS GROUP

open access: yesپژوهش‌های ریاضی, 2021
In this paper we classify finite p-groups (p>2 )  with metacyclic automorphism  group.  Particularly we prove that the automorphism group of group G is metacyclic if and only if  G is cyclic of order  p^n.
Shirin Fouladi
doaj  

16-vertex graphs with automorphism groups A4 and A5 from the icosahedron

open access: yesElectronic Journal of Graph Theory and Applications, 2020
The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected 16-vertex graphs having automorphism groups A4 and A5.
Peteris Daugulis
doaj   +1 more source

Alperin's bound and normal Sylow subgroups

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 2, February 2026.
Abstract Let G$G$ be a finite group, p$p$ a prime number and P$P$ a Sylow p$p$‐subgroup of G$G$. Recently, Malle, Navarro, and Tiep conjectured that the number of p$p$‐Brauer characters of G$G$ coincides with that of the normalizer NG(P)${\bf N}_G(P)$ if and only if P$P$ is normal in G$G$.
Zhicheng Feng   +2 more
wiley   +1 more source

Automorphism Properties and Classification of Adinkras

open access: yesAdvances in Mathematical Physics, 2015
Adinkras are graphical tools for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set of local parameters.
B. L. Douglas   +3 more
doaj   +1 more source

Automorphisms of graph groups

open access: yesJournal of Algebra, 1989
Given a graph \(\Gamma=(V,E)\), the graph group \(F\langle\Gamma\rangle\) is the group with presentation \(\langle V\mid [E]\rangle\), where \([E]\) denotes the set of commutators \(\{[a,b]\mid\{a,b\}\in E\}\). The graph group \(F\langle\Gamma\rangle\) is modeled to be a group analog of the graph algebra K(\(\Gamma)\) generated as a free associative ...
openaire   +2 more sources

Palindromic automorphisms of free groups

open access: yesJournal of Algebra, 2015
19 ...
Bardakov, Valeriy G.   +2 more
openaire   +2 more sources

Cazenave‐Dickstein‐Weissler‐Type Extension of Fujita'S Problem on Heisenberg Groups

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 2, Page 499-511, 30 January 2026.
ABSTRACT This paper investigates the Fujita critical exponent for a heat equation with nonlinear memory posed on the Heisenberg groups. A sharp threshold is identified such that, for exponent values less than or equal to this critical value, no global solution exists, regardless of the choice of nonnegative initial data. Conversely, for exponent values
Mokhtar Kirane   +3 more
wiley   +1 more source

Upper bounds of orders of automorphism groups of leafless metric graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
We prove a tropical analogue of the theorem of Hurwitz: A leafless metric graph of genus [Formula: see text] has at most 12 automorphisms when g = 2 and [Formula: see text] automorphisms when [Formula: see text].
Yusuke Nakamura, JuAe Song
doaj   +1 more source

Free subsemigroups in automorphism group of a polynomial ring of two variables over number fields

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2013
Sufficient conditions under which the semigroup generated by two automorphism of the polynomial ring in two variables over a number field $P$ will be free are given.
Zh. I. Dovghey, M. I. Sumaryuk
doaj   +1 more source

Home - About - Disclaimer - Privacy