Search results for "Automorphism"
showing 10 items of 88 documents
Some Hadamard designs with parameters (71,35,17)
2002
Up to isomorphisms there are precisely eight symmetric designs with parameters (71, 35, 17) admitting a faithful action of a Frobenius group of order 21 in such a way that an element of order 3 fixes precisely 11 points. Five of these designs have 84 and three have 420 as the order of the full automorphism group G. If |G| = 420, then the structure of G is unique and we have G = (Frob21 × Z5):Z4. In this case Z(G) = 〈1〉, G′ has order 35, and G induces an automorphism group of order 6 of Z7. If |G| = 84, then Z(G) is of order 2, and in precisely one case a Sylow 2-subgroup is elementary abelian. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 144–149, 2002; DOI 10.1002/jcd.996
Cyclotomic Polynomials and Finite Automorphisms of Groups
2001
We introduce minimal polynomials for finite automorphisms of commutative groups and relate them to the exponent of the fixed points and to the reducibility of the group. Some results can be extended to the noncommutative case.
On the additivity of block designs
2016
We show that symmetric block designs $${\mathcal {D}}=({\mathcal {P}},{\mathcal {B}})$$D=(P,B) can be embedded in a suitable commutative group $${\mathfrak {G}}_{\mathcal {D}}$$GD in such a way that the sum of the elements in each block is zero, whereas the only Steiner triple systems with this property are the point-line designs of $${\mathrm {PG}}(d,2)$$PG(d,2) and $${\mathrm {AG}}(d,3)$$AG(d,3). In both cases, the blocks can be characterized as the only k-subsets of $$\mathcal {P}$$P whose elements sum to zero. It follows that the group of automorphisms of any such design $$\mathcal {D}$$D is the group of automorphisms of $${\mathfrak {G}}_\mathcal {D}$$GD that leave $$\mathcal {P}$$P in…
Divisible designs from semifield planes
2002
AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.
The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group
2001
We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure's universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈Q, <〉 or 〈R, <〉, addition does not add to the expressive power of first-order logic for defining order-generic queries. In the present paper we develop a natural generalization of the notion of finitely representable databases, where an arbitrary (i.e. possibly infinite) number of regions is allowed. We …
A Classification of all Symmetric Block Designs of Order Nine with an Automorphism of Order Six
2006
We complete the classification of all symmetric designs of order nine admitting an automorphism of order six. As a matter of fact, the classification for the parameters (35,17,8), (56,11,2), and (91,10,1) had already been done, and in this paper we present the results for the parameters (36,15,6), (40,13,4), and (45,12,3). We also provide information about the order and the structure of the full automorphism groups of the constructed designs. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 301–312, 2006
Invariant characters and coprime actions on finite nilpotent groups
2000
Suppose that a group A acts via automorphisms on a nilpotent group G having coprime order. Given an A-invariant character \(\chi \in {\rm Irr}(G)\), we show that the A-primitive irreducible characters that induce \(\chi \) from an A-invariant subgroup of G all have equal degree. We use this result to obtain some information about the characters of groups of p-length 1.
Irreducible components of Hurwitz spaces parameterizing Galois coverings of curves of positive genus
2014
Let Y be a smooth, projective, irreducible complex curve. A G-covering p : C → Y is a Galois covering, where C is a smooth, projective, irreducible curve and an isomorphism G ∼ −→ Aut(C/Y ) is fixed. Two G-coverings are equivalent if there is a G-equivariant isomorphism between them. We are concerned with the Hurwitz spaces H n (Y ) and H G n (Y, y0). The first one parameterizes Gequivalence classes of G-coverings of Y branched in n points. The second one, given a point y0 ∈ Y , parameterizes G-equivalence classes of pairs [p : C → Y, z0], where p : C → Y is a G-covering unramified at y0 and z0 ∈ p (y0). When G = Sd one can equivalently consider coverings f : X → Y of degree d with full mon…
Polynomial growth and identities of superalgebras and star-algebras
2009
Abstract We study associative algebras with 1 endowed with an automorphism or antiautomorphism φ of order 2, i.e., superalgebras and algebras with involution. For any fixed k ≥ 1 , we construct associative φ -algebras whose φ -codimension sequence is given asymptotically by a polynomial of degree k whose leading coefficient is the largest or smallest possible.
Symmetric (79, 27, 9)-designs Admitting a Faithful Action of a Frobenius Group of Order 39
1997
AbstractIn this paper we present the classification of symmetric designs with parameters (79, 27, 9) on which a non-abelian group of order 39 acts faithfully. In particular, we show that such a group acts semi-standardly with 7 orbits. Using the method of tactical decompositions, we are able to construct exactly 1320 non-isomorphic designs. The orders of the full automorphism groups of these designs all divide 8 · 3 · 13.