92 research outputs found
Collineation group as a subgroup of the symmetric group
Let be the projectivization (i.e., the set of one-dimensional vector
subspaces) of a vector space of dimension over a field. Let be a
closed (in the pointwise convergence topology) subgroup of the permutation
group of the set . Suppose that contains the
projective group and an arbitrary self-bijection of transforming a
triple of collinear points to a non-collinear triple. It is well-known from
\cite{KantorMcDonough} that if is finite then contains the
alternating subgroup of .
We show in Theorem \ref{density} below that , if
is infinite.Comment: 9 page
Block-Transitive Designs in Affine Spaces
This paper deals with block-transitive - designs in affine
spaces for large , with a focus on the important index case. We
prove that there are no non-trivial 5- designs admitting a
block-transitive group of automorphisms that is of affine type. Moreover, we
show that the corresponding non-existence result holds for 4- designs,
except possibly when the group is one-dimensional affine. Our approach involves
a consideration of the finite 2-homogeneous affine permutation groups.Comment: 10 pages; to appear in: "Designs, Codes and Cryptography
Steiner t-designs for large t
One of the most central and long-standing open questions in combinatorial
design theory concerns the existence of Steiner t-designs for large values of
t. Although in his classical 1987 paper, L. Teirlinck has shown that
non-trivial t-designs exist for all values of t, no non-trivial Steiner
t-design with t > 5 has been constructed until now. Understandingly, the case t
= 6 has received considerable attention. There has been recent progress
concerning the existence of highly symmetric Steiner 6-designs: It is shown in
[M. Huber, J. Algebr. Comb. 26 (2007), pp. 453-476] that no non-trivial
flag-transitive Steiner 6-design can exist. In this paper, we announce that
essentially also no block-transitive Steiner 6-design can exist.Comment: 9 pages; to appear in: Mathematical Methods in Computer Science 2008,
ed. by J.Calmet, W.Geiselmann, J.Mueller-Quade, Springer Lecture Notes in
Computer Scienc
Partially Annealed Disorder and Collapse of Like-Charged Macroions
Charged systems with partially annealed charge disorder are investigated
using field-theoretic and replica methods. Charge disorder is assumed to be
confined to macroion surfaces surrounded by a cloud of mobile neutralizing
counterions in an aqueous solvent. A general formalism is developed by assuming
that the disorder is partially annealed (with purely annealed and purely
quenched disorder included as special cases), i.e., we assume in general that
the disorder undergoes a slow dynamics relative to fast-relaxing counterions
making it possible thus to study the stationary-state properties of the system
using methods similar to those available in equilibrium statistical mechanics.
By focusing on the specific case of two planar surfaces of equal mean surface
charge and disorder variance, it is shown that partial annealing of the
quenched disorder leads to renormalization of the mean surface charge density
and thus a reduction of the inter-plate repulsion on the mean-field or
weak-coupling level. In the strong-coupling limit, charge disorder induces a
long-range attraction resulting in a continuous disorder-driven collapse
transition for the two surfaces as the disorder variance exceeds a threshold
value. Disorder annealing further enhances the attraction and, in the limit of
low screening, leads to a global attractive instability in the system.Comment: 21 pages, 2 figure
Rank 3 groups and biplanes
Let G be a primitive rank 3 permutation group on a set X in which r(x) is a nontrivial G,-orbit, with II = I X 1, u = I I’(X)]. Tsuzuku [27] showed that, if G, acts as the symmetric group on r(x), then (v, n) = (2, 5), (3, lo), (5, 16), or (7, 50); he determined the possible groups in each case. Bannai [2
Symmetric Designs from theG2 (q) Generalized Hexagons
AbstractWe describe symmetric designs D with classical parameters v=(q6−1)/(q−1), k=(q5−1)/(q−1), λ=(q4−1)/(q−1), and automorphism group Aut(G2(q))
- …
