Displaying similar documents to “Conjugates for Finding the Automorphism Group and Isomorphism of Design Resolutions”

New Symmetric (61,16,4) Designs Invariant Under the Dihedral Group of Order 10

Landjev, Ivan, Topalova, Svetlana (1998)

Serdica Mathematical Journal

Similarity:

∗ This work has been partially supported by the Bulgarian NSF under Contract No. I-506/1995. In this note we construct five new symmetric 2-(61,16,4) designs invariant under the dihedral group of order 10. As a by-product we obtain 25 new residual 2-(45,12,4) designs. The automorphism groups of all new designs are computed.

Tame Automorphisms of ℂ³ with Multidegree of the Form (p₁,p₂,d₃)

Marek Karaś (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let d₃ ≥ p₂ > p₁ ≥ 3 be integers such that p₁,p₂ are prime numbers. We show that the sequence (p₁,p₂,d₃) is the multidegree of some tame automorphism of ℂ³ if and only if d₃ ∈ p₁ℕ + p₂ℕ, i.e. if and only if d₃ is a linear combination of p₁ and p₂ with coefficients in ℕ.

A Method for Classification of Doubly Resolvable Designs and Its Application

Zhelezova, Stela (2011)

Serdica Journal of Computing

Similarity:

This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010. The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional...