Results 61 to 70 of about 1,529 (200)

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  

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

The Orbits of Twisted Crossed Cubes

open access: yesMathematics
Two vertices u and v in a graph G=(V,E) are in the same orbit if there exists an automorphism ϕ of G such that ϕ(u)=v. The orbit number of a graph G, denoted by Orb(G), is the number of orbits that partition V(G).
Jia-Jie Liu
doaj   +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

Permutation matrices and matrix equivalence over a finite field

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1981
Let F=GF(q) denote the finite field of order q and Fm×n the ring of m×n matrices over F. Let 𝒫n be the set of all permutation matrices of order n over F so that 𝒫n is ismorphic to Sn.
Gary L. Mullen
doaj   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) in PG ( 7 , q 3 )

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

Centralizers of automorphisms permuting free generators

open access: yesOpen Mathematics, 2019
By σ ∈ Skm we denote a permutation of the cycle-type km and also the induced automorphism permuting subscripts of free generators in the free group Fkm.
Macedońska Olga, Tomaszewski Witold
doaj   +1 more source

ON THE GROWTH OF GROUPS AND AUTOMORPHISMS [PDF]

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

R ( 5 , 5 ) ≤ 46

open access: yesJournal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source

From Stability to Chaos: A Complete Classification of the Damped Klein‐Gordon Dynamics

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 9, Page 9696-9708, June 2026.
ABSTRACT We investigate the transition between stability and chaos in the damped Klein‐Gordon equation, a fundamental model for wave propagation and energy dissipation. Using semigroup methods and spectral criteria, we derive explicit thresholds that determine when the system exhibits asymptotic stability and when it displays strong chaotic dynamics ...
Carlos Lizama   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy