Results 71 to 80 of about 9,251 (245)
Flag-transitive $ 2 $-designs with block size 5 and alternating groups
AIMS MathematicsThis paper contributes to the classification of flag-transitive 2-designs with block size 5. In a recent paper, the flag-transitive automorphism groups of such designs are reduced to point-primitive groups of affine type and almost simple type, and a ...
Jiaxin Shen, Yuqing Xia
doaj +1 more source
Automorphism Properties and Classification of Adinkras
Advances 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
Commuting Pairs in Quasigroups
Journal of Combinatorial Designs, Volume 33, Issue 11, Page 418-427, November 2025.ABSTRACT A quasigroup is a pair ( Q , ∗ ), where Q is a nonempty set and ∗ is a binary operation on Q such that for every ( a , b ) ∈ Q 2, there exists a unique ( x , y ) ∈ Q 2 such that a ∗ x = b = y ∗ a. Let ( Q , ∗ ) be a quasigroup. A pair ( x , y ) ∈ Q 2 is a commuting pair of ( Q , ∗ ) if x ∗ y = y ∗ x.
Jack Allsop, Ian M. Wanless
wiley +1 more source
Upper bounds of orders of automorphism groups of leafless metric graphs
AKCE International Journal of Graphs and CombinatoricsWe 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
Karpatsʹ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
Automorphisms of monomial groups [PDF]
Pacific Journal of Mathematics, 1961 Dissertation (Ph. D.)--University of Kansas, Mathematics, 1955.
openaire +3 more sources
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley +1 more source
Automorphisms of Some Magmas of Order $k+k^2$
Известия Иркутского государственного университета: Серия "Математика", 2018 This paper is devoted to the study of automorphisms of finite magmas and to the representation of the symmetric permutation group $ S_k $ and some of its subgroups by automorphism groups of finite magmas.
A.V. Litavrin
doaj +1 more source
Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 399-403, October 2025.ABSTRACT The largest prime p that can be the order of an automorphism of a 2‐ ( 35 , 17 , 8 ) design is p = 17, and all 2‐ ( 35 , 17 , 8 ) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐ ( 35 , 17 , 8 ) designs with automorphisms of an odd prime order p < 17 were classified in Bouyukliev, Fack and Winne and ...
Sanja Rukavina, Vladimir D. Tonchev
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source