Coprime ordering of cyclic planar difference sets

Motivated by a question about uniform dessins d’enfants, it is conjectured that every cyclic planar difference set of prime power order m≠4 can be cyclically ordered such that the difference of every pair of neighbouring elements is coprime to the module v?m²+m+1. We prove that this is the case whenever the number ω(v) of different prime divisors of v is less than or equal to 3. To achieve this we consider a graph related to the difference set and show that it is Hamiltonian.     

A group extensions approach to affine relative difference sets of even order

It is shown that a group extensions approach to central relative (k+1,k-1,k,1)-difference sets of even order leads naturally to the notion of an “affine” planar map; a notion analogous to the well-known planar map corresponding to a splitting relative (m,m,m,1)-difference set. Basic properties of affine planar maps are derived and applied to give some new results regarding abelian relative (k+1,k-1,k,1)-difference sets of even order and to give new proofs, in the even order case, for some known results. The paper concludes with computational non-existence results for 10,000<k?100,000.     

Note on disjoint blocking sets in Galois planes

In this paper, we show that there are at least cq disjoint blocking sets in PG(2,q), where c ≈ 1/3. The result also extends to some non‐Desarguesian planes of order q. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 149–158, 2006     

Some remarks on projective generators and injective cogenerators

In this paper,we give a relationship between projective generators(resp.,injective cogenerators) in the category of R-modules and the counterparts in the category of complexes of R-modules.As a consequence,we get that complexes of W-Gorenstein modules are actually W-Gorenstein complexes whenever W is a subcategory of R-modules satisfying W⊥W,where W is the subcategory of exact complexes with all cycles in W.We also study when all cycles of a W-Gorenstein complexes are W-Gorenstein modules.     

Some remarks on totally imperfect sets

We prove the following two theorems.

Theorem 1. Let be a strongly meager subset of . Then it is dual Ramsey null.

We will say that a -ideal of subsets of satisfies the condition iff for every , if

then .

Theorem 2. The -ideals of perfectly meager sets, universally meager sets and perfectly meager sets in the transitive sense satisfy the condition .

     

On affine difference sets and their multipliers

Let D be an affine difference set of order n in an abelian group G relative to a subgroup N. We denote by π(s) the set of primes dividing an integer and set H^∗=H?{ω}, where H=G/N and ω=∏_σ∈Hσ. In this article, using D we define a map g from H to N satisfying for iff {τ,τ⁻¹}={ρ,ρ⁻¹} and show that for any σ∈H^∗ and any integer m>0 with π(m)⊂π(n). This result is a generalization of J.C. Galati’s theorem on even order n [J.C. Galati, A group extensions approach to affine relative difference sets of even order, Discrete Mathematics 306 (2006) 42-51] and gives a new proof of a result of Arasu-Pott on the order of a multiplier modulo exp(H) ([K.T. Arasu, A. Pott, On quasi-regular collineation groups of projective planes, Designs Codes and Cryptography 1 (1991) 83-92] Section 5).     

Small quasimultiple affine and projective planes: Some improved bounds

We improve the known bounds on r(n): = min {λ| an (n², n, λ)-RBIBD exists} in the case where n + 1 is a prime power. In such a case r(n) is proved to be at most n + 1. If, in addition, n − 1 is the product of twin prime powers, then r(n) ${\ \le \ }{n \over 2}$. We also improve the known bounds on p(n): = min{λ| an (n² + n + 1, n + 1, λ)-BIBD exists} in the case where n² + n + 1 is a prime power. In such a case p(n) is bounded at worst by but better bounds could be obtained exploiting the multiplicative structure of GF(n² + n + 1). Finally, we present an unpublished construction by M. Greig giving a quasidouble affine plane of order n for every positive integer n such that n − 1 and n + 1 are prime powers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 337–345, 1998     

(Semi-)Riemannian geometry of (para-)octonionic projective planes

We use reduced homogeneous coordinates to construct and study the (semi-)Riemannian geometry of the octonionic (or Cayley) projective plane , the octonionic projective plane of indefinite signature , the para-octonionic (or split octonionic) projective plane and the hyperbolic dual of the octonionic projective plane . We also show that our manifolds are isometric to the (para-)octonionic projective planes defined classically by quotients of Lie groups.     

Uniqueness of maximum planar five-distance sets

A subset X in the Euclidean plane is called a k-distance set if there are exactly k distances between two distinct points in X. We denote the largest possible cardinality of k-distance sets by g(k). Erdős and Fishburn proved that g(5)=12 and also conjectured that 12-point five-distance sets are unique up to similar transformations. We classify 8-point four-distance sets and prove the uniqueness of the 12-point five-distance sets given in their paper. We also introduce diameter graphs of planar sets and characterize these graphs.     

Special subsets of difference sets with particular emphasis on skew Hadamard difference sets

This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard difference sets are given special attention, and the structure of their special subsets leads to several results on multipliers, including a categorisation of the full multiplier group of an abelian skew Hadamard difference set. We also count the number of ways to write elements as a product of any number of elements of a skew Hadamard difference set.      

Saturating sets in projective planes and hypergraph covers

Let ${\Pi }_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound on the smallest possible size of the saturating set to $?\sqrt{3qlnq}?+?(\sqrt{q}+1)∕2?$. The same result is presented using an algorithmic approach as well, which points out the connection with the transversal number of uniform multiple intersecting hypergraphs.     

On quasiregular collineation groups of projective planes

We investigate quasiregular collineation groups of type (d) in the Dembowski-Piper classification. We prove that the Sylow 2-subgroup of as well as the Sylow 2-subgroup of its multiplier group have to be cyclic. We use these results to obtain new necessary conditions on the existence of affine difference sets.Research partially supported by NSA grant #MDA 904-90-H-4008.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.     

Uniqueness of some cyclic projective planes

For n < 41 and for {121, 125, 128, 169, 256, 1024}, every cyclic projective plane of order n is desarguesian.      

Some remarks on embeddings of the flag geometries of projective planes in finite projective spaces

The flag geometry of a finite projective plane II of orders is the generalized hexagon of order (s, 1) obtained from II by putting equal to the set of all flags of II, by putting equal to the set of all points and lines of II and where I is the natural incidence relation (inverse containment), that is, is the dual of the double of II in the sense of [8]. Then we say that is fully (and weakly) embedded in the finite projective space PG(d, q) if is a subgeometry of the natural point-line geometry associated with PG(d, q), if s=q, if the set of points of generates PG(d, q) (and if the set of points of not opposite any given point of does not generate PG(d, q)). We have classified all such embeddings in [3, 4, 5, 6]. In the present paper, we weaken the hypotheses in some special cases, and we give an alternative formulation of the classification.     

Orthomorphisms and the construction of projective planes

We discuss a simple computational method for the construction of finite projective planes. The planes so constructed all possess a special group of automorphisms which we call the group of translations, but they are not always translation planes. Of the four planes of order 9, three admit the additive group of the field as a group of translations, and the present construction yields all three. The known planes of order 16 comprise four self-dual planes and eighteen other planes (nine dual pairs); of these, the method gives three of the four self-dual planes and six of the nine dual pairs, including the ``sporadic' (not translation) plane of Mathon.

     

Some results on multipliers and numerical multiplier groups of difference sets

In this paper, we use number theoretic methods to study multipliers and numerical multiplier groups of difference sets. We obtain a relation between the decomposition group of a prime divisor of the order of a difference set and the numerical multiplier group, this gives rise to some results concerning the numerical multiplier groups of difference sets. Also we give two characterizations of strong multipliers of a subset in an abelian group which have some applications in difference sets.     

Upper chromatic number of finite projective planes

For a finite projective plane , let denote the maximum number of classes in a partition of the point set, such that each line has at least two points in the same partition class. We prove that the best possible general estimate in terms of the order of projective planes is , which is tight apart from a multiplicative constant in the third term :

• (1) As holds for every projective plane of order q.
• (2) If q is a square, then the Galois plane of order q satisfies .

Our results asymptotically solve a ten‐year‐old open problem in the coloring theory of mixed hypergraphs, where is termed the upper chromatic number of . Further improvements on the upper bound (1) are presented for Galois planes and their subclasses. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 221–230, 2008