Results 51 to 60 of about 9,504,920 (193)
, 2023 A new strongly regular graph with parameters (81,30,9,12) is found as a graph invariant under certain subgroup of the full automorphism group of the previously known strongly regular graph discovered in 1981 by J. H.
Andrea Švob +3 more
core +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
On the automorphism groups of q-enveloping algebras of nilpotent Lie algebras [PDF]
, 2006 We investigate the automorphism group of the quantised enveloping algebra U of the positive nilpotent part of certain simple complex Lie algebras g in the case where the deformation parameter q \in \mathbb{C}^* is not a root of unity. Studying its action
Launois, Stephane
core
The stabilized automorphism group of odometers and of Toeplitz subshifts [PDF]
, 2023 We characterize the stabilized automorphism group for odometers and Toeplitz subshifts and then prove an invariance property of the stabilized automorphism group of these dynamical systems. A particular case of interest is that for torsion free odometers
Jones-Baro, Jennifer N.
core
Classifying Equidistant Permutation Codes
Journal of Combinatorial Designs, EarlyView.ABSTRACT A permutation code of length n $n$ is a set of codewords, each of which contains every symbol of a set of size n $n$ exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called equidistant and that number is called the distance.
Patric R. J. Östergård +1 more
wiley +1 more source
AUTOMORPHISM GROUPS OF FREE GROUPS [PDF]
Journal of the Australian Mathematical Society, 2008 Abstract This note contains some remarks on generating pairs for automorphism groups of free groups. There has been significant use of electronic assistance. Little of this is used to verify the results.
openaire +3 more sources
Minimal odd order automorphism groups
, 2010 We show that 37 is the smallest order of a non-trivial odd order group which occurs as the full automorphism group of a finite ...
Hegarty, Peter +3 more
core +1 more source
Line Graphs of Multigraphs and the Forbidden Graph E 6
Journal of Graph Theory, EarlyView.ABSTRACT The line graph Γ of a multigraph Δ is the graph whose vertices are the edges of Δ, where two such edges are adjacent if and only if they meet in a single vertex of Δ. We provide several characterizations of such line graphs and in particular show that a graph is a line graph if and only if it does not contain one of the 32 graphs, all of which
Hans Cuypers
wiley +1 more source
The Automorphism Group of a Hypercube
J. Univers. Comput. Sci., 2000 JUCS - Journal of Universal Computer Science Volume Nr.
openaire +3 more sources
The fibred density property and the automorphism group of the spectral ball [PDF]
, 2017 We generalize the notion of the density property for complex manifoldsto holomorphic fibrations, and introduce the notion of the fibred density property.We prove that the natural fibration of the spectral ball over the symmetrized polydiscenjoys the ...
Frank Kutzschebauch +3 more
core +2 more sources