Semiregular group divisible designs whose duals are semiregular
نویسنده
چکیده
ABSTRAC"T A construction method for semiregular group divisible designs is given. This method can be applied to yield many classes of (in general, non-symmetric) semiregular group divisible designs whose duals are semiregular group divisible. In particular, the method can be used to construct many classes of transversal designs whose duals are serniregular group divisible designs, but not transversal designs. Also, some of the semiregular group divisible designs the construction method yields can be used to construct self-dual regular group divisible designs with two groups of points and blocks. Four infinite classes of such regular group divisible designs are constructed.
منابع مشابه
New semiregular divisible difference sets
We modify and generalize the construction by McFarland (1973) in two different ways to construct new semiregular divisible difference sets (DDSs) with 21 ~ 0. The parameters of the DDS fall into a family of parameters found in Jungnickel (1982), where his construction is for divisible designs. The final section uses the idea of a K-matrix to find DDSs with a nonelementary abelian forbidden subg...
متن کاملAll vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملAll vertex-transitive locally-quasiprimitive graphs
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملSemiregular automorphisms of edge-transitive graphs
The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.
متن کاملCodes in Platonic, Archimedean, Catalan, and Related Polyhedra: A Model for Maximum Addition Patterns in Chemical Cages
The notion of d-code is extended to general polyhedra by defining maximum sets of vertices with pairwise separation > or =d. Codes are enumerated and classified by symmetry for all regular and semiregular polyhedra and their duals. Partial results are also given for the series of medials of Archimedean polyhedra. In chemistry, d-codes give a model for maximal addition to or substitution in poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 2 شماره
صفحات -
تاریخ انتشار 1990