Exponential bounds on the number of designs with affine parameters

It is well‐known that the number of designs with the parameters of a classical design having as blocks the hyperplanes in PG(n, q) or AG(n, q), n≥3, grows exponentially. This result was extended recently [D. Jungnickel, V. D. Tonchev, Des Codes Cryptogr, published online: 23 May, 2009] to designs having the same parameters as a projective geometry design whose blocks are the d‐subspaces of PG(n, q), for any 2≤d≤n−1. In this paper, exponential lower bounds are proved on the number of non‐isomorphic designs having the same parameters as an affine geometry design whose blocks are the d‐subspaces of AG(n, q), for any 2≤d≤n−1, as well as resolvable designs with these parameters. An exponential lower bound is also proved for the number of non‐isomorphic resolvable 3‐designs with the same parameters as an affine geometry design whose blocks are the d‐subspaces of AG(n, 2), for any 2≤d≤n−1. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 475–487, 2010     

Unitals in the code of the Hughes plane

A coding‐theoretic characterization of a unital in the Hughes plane is provided, based on and extending the work of Blokhuis, Brouwer, and Wilbrink in PG(2,q²). It is shown that a Frobenius‐invariant unital is contained in the p‐code of the Hughes plane if and only if that unital is projectively equivalent to the Rosati unital. © 2003 Wiley Periodicals, Inc.     

On symmetric nets and generalized Hadamard matrices from affine designs

Symmetric nets are affine resolvable designs whose duals are also affine. It is shown that. up to isomorphism, there are exactly four symmetric (3, 3)-nets (v=b=27,k=9), and exactly two inequivalent 9×9 generalized Hadamard matrices over the group of order 3. The symmetric (3, 3)-nets are found as subnets of affine resolvable 2-(27, 9, 4) designs. Ten of the 68 non-isomorphic affine resolvable 2-(27, 9, 4) designs are not extensions of symmetric (3, 3)-subnets, providing the first examples of affine 2-(q³, q², q²–1/q–1) designs without symmetric (q, q)-subnets.     

Flag transitive planes of orderq n with a long cyclel ∞ as a collineation

Baker and Ebert [1] presented a method for constructing all flag transitive affine planes of orderq ² havingGF(q) in their kernels for any odd prime powerq. Kantor [6; 7; 8] constructed many classes of nondesarguesian flag transitive affine planes of even order, each admitting a collineation, transitively permuting the points at infinity. In this paper, two classes of non-desarguesian flag transitive affine planes of odd order are constructed. One is a class of planes of orderq ⁿ , whereq is an odd prime power andn 3 such thatq ⁿ 1 (mod 4), havingGF(q) in their kernels. The other is a class of planes of orderq ⁿ , whereq is an odd prime power andn 2 such thatq ⁿ 1 (mod 4), havingGF(q) in their kernels. Since each plane of the former class is of odd dimension over its kernel, it is not isomorphic to any plane constructed by Baker and Ebert [1]. The former class contains a flag transitive affine plane of order 27 constructed by Kuppuswamy Rao and Narayana Rao [9]. Any plane of the latter class of orderq ⁿ such thatn 1 (mod 2), is not isomorphic to any plane constructed by Baker ad Ebert [1].The author is grateful to the referee for many helpful comments.     

A non‐existence result on Cameron–Liebler line classes

Cameron–Liebler line classes are sets of lines in PG(3, q) that contain a fixed number x of lines of every spread. Cameron and Liebler classified Cameron–Liebler line classes for x ∈ {0, 1, 2, q² ? 1, q², q² + 1} and conjectured that no others exist. This conjecture was disproven by Drudge for q = 3 [8] and his counterexample was generalized to a counterexample for any odd q by Bruen and Drudge [4]. A counterexample for q even was found by Govaerts and Penttila [9]. Non‐existence results on Cameron–Liebler line classes were found for different values of x. In this article, we improve the non‐existence results on Cameron–Liebler line classes of Govaerts and Storme [11], for q not a prime. We prove the non‐existence of Cameron–Liebler line classes for 3 ≤ x < q/2. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 342–349, 2008     

Quasi-affine symmetric designs

A symmetric design with parameters v = q ²(q + 2), k = q(q + 1), λ = q, q ≥ 2, is called a quasi-affine design if its point set can be partitioned into q + 2 subsets P ₀, P ₁,..., P _q , P _q+1 such that the induced structure in every point neighborhood is an affine plane of order q (repeated q times). A quasi-affine design with q ≥ 3 determines its point neighborhoods uniquely and dual of such a design is also a quasi-affine design. These structural properties pave way for definition of a strongly quasi-affine design and it is also shown that associated with every quasi-affine design is a unique strongly quasi-affine design from which the given quasi-affine design is obtained by certain unique cutting and pasting operation. This investigation also enables us to associate a unique 2-regular graph with q + 2 vertices and in turn, a unique colored partition of the integer q + 2. These combinatorial consequences are finally used to obtain an exponential lower bound on the number of non-isomorphic solutions of such symmetric designs improving the earlier lower bound of 2. Work of Sanjeevani Gharge is supported by Faculty Improvement Programme of U.G.C., India.     

Equitable resolvable coverings

In an earlier article, Willem H. Haemers has determined the minimum number of parallel classes in a resolvable 2‐(qk,k,1) covering for all k ≥ 2 and q = 2 or 3. Here, we complete the case q = 4, by construction of the desired coverings using the method of simulated annealing. Secondly, we look at equitable resolvable 2‐(qk,k,1) coverings. These are resolvable coverings which have the additional property that every pair of points is covered at most twice. We show that these coverings satisfy k < 2q ? , and we give several examples. In one of these examples, k > q. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 113–123, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10024     

Resolutions of PG(5, 2) with point‐cyclic automorphism group

A t‐(υ, k, λ) design is a set of υ points together with a collection of its k‐subsets called blocks so that all subsets of t points are contained in exactly λ blocks. The d‐dimensional projective geometry over GF(q), PG(d, q), is a 2‐(q^d + q^d−1 + … + q + 1, q + 1, 1) design when we take its points as the points of the design and its lines as the blocks of the design. A 2‐(υ, k, 1) design is said to be resolvable if the blocks can be partitioned as ℛ = {R₁, R₂, …, R_s}, where s = (υ − 1)/(k−1) and each R_i consists of υ/k disjoint blocks. If a resolvable design has an automorphism σ which acts as a cycle of length υ on the points and ℛ^σ = ℛ, then the design is said to be point‐cyclically resolvable. The design associated with PG(5, 2) is known to be resolvable and in this paper, it is shown to be point‐cyclically resolvable by enumerating all inequivalent resolutions which are invariant under a cyclic automorphism group G = 〈σ〉 where σ is a cycle of length 63. These resolutions are the only resolutions which admit a point‐transitive automorphism group. Furthermore, some necessary conditions for the point‐cyclic resolvability of 2‐(υ, k, 1) designs are also given. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 2–14, 2000     

A lower bound on the number of Semi‐Boolean quadruple systems

A Steiner quadruple system of order 2ⁿ is Semi‐Boolean (SBQS(2ⁿ) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry PG(n?1, 2). We prove by means of explicit constructions that for any n, up to isomorphism, there exist at least 2^{? 3(n?4)/2?} regular and resolvable SBQS(2ⁿ). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 229–239, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10050     

Orthogonal resolutions of lines in AG(n,q)

A resolution of the lines of AG(n,q) is a partition of the lines classes (called resolution classes) such that every point of the geometry is on exactly one line of each resolution class. Two resolutions R,R' of AG(n,q) are orthogonal if any resolution class from R has at most one line in common with any class from R'. In this paper, we construct orthogonal resolutions on AG(n,q) for all n=2ⁱ⁺¹, i=1,2,…, and all q>2 a prime power. The method involves constructing AG(n,q) from a finite projective plane of order q^n-1 and using the structure of the plane to display the orthogonal resolutions.     

New inductive constructions of complete caps in PG(N,q), q even

Some new families of small complete caps in PG(N, q), q even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem in the plane. The caps constructed in this article provide an improvement on the currently known upper bounds on the size of the smallest complete cap in PG(N, q), N≥4, for all q≥2³. In particular, substantial improvements are obtained for infinite values of q square, including q=2^2Cm, C≥5, m≥3; for q=2^Cm, C≥5, m≥9, with C, m odd; and for all q≤2¹⁸. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 177–201, 2010     

Special sets of the Hermitian surface and indicator sets

An interesting connection between special sets of the Hermitian surface of PG(3,q²), q odd, (after Shult 13 ) and indicator sets of line‐spreads of the three‐dimensional projective space is provided. Also, the CP‐type special sets are characterized. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 18–24, 2008     

The affine planeAG(2,q),q odd,has a unique one point extension

Summary LetJ be a finite inversive plane of odd orderq. If for at least one pointp ofJ the internal affine planeJ _p is Desarguesian, thenJ is Miquelian. Other formulation: the finite Desarguesian affine plane of odd orderq has a unique one point extension; this extension is the Miquelian inversive plane of orderq. It follows that there is a unique inversive plane of orderq, withq{3, 5, 7}.Oblatum 23-X-1992 & 24-I-1994     

Correction to: “Exponential bounds on the number of designs with affine parameters”

It is well known that the number of designs with the parameters of a classical design having as blocks the hyperplanes in PG(n, q) or AG(n, q), n?3, grows exponentially. This result was extended recently [5] to designs having the same parameters as a projective geometry design whose blocks are the d‐subspaces of PG(n, q), for any 2?d?n ? 1. In this paper, exponential lower bounds are proved on the number of non‐isomorphic designs having the same parameters as an affine geometry design whose blocks are the d‐subspaces of AG(n, q), for any 2≤d≤n ? 1. Exponential bounds are also proved for the number of resolvable designs with these parameters. © 2011 Wiley Periodicals, Inc. J Combin Designs 19:156‐166, 2011     

Optimal linear perfect hash families with small parameters

A linear (q^d, q, t)‐perfect hash family of size s consists of a vector space V of order q^d over a field F of order q and a sequence ?₁,…,?_s of linear functions from V to F with the following property: for all t subsets X ? V, there exists i ∈ {1,·,s} such that ?_i is injective when restricted to F. A linear (q^d, q, t)‐perfect hash family of minimal size d( – 1) is said to be optimal. In this paper, we prove that optimal linear (q², q, 4)‐perfect hash families exist only for q = 11 and for all prime powers q > 13 and we give constructions for these values of q. © 2004 Wiley Periodicals, Inc. J Comb Designs 12: 311–324, 2004     

An infinite series of regular edge‐ but not vertex‐transitive graphs

Let n be an integer and q be a prime power. Then for any 3 ≤ n ≤ q?1, or n=2 and q odd, we construct a connected q‐regular edge‐but not vertex‐transitive graph of order 2qⁿ⁺¹. This graph is defined via a system of equations over the finite field of q elements. For n=2 and q=3, our graph is isomorphic to the Gray graph. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 249–258, 2002     

On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order

The sporadic complete 12‐arc in PG(2, 13) contains eight points from a conic. In PG(2,q) with q>13 odd, all known complete k‐arcs sharing exactly ½(q+3) points with a conic 𝒞 have size at most ½(q+3)+2, with only two exceptions, both due to Pellegrino, which are complete (½(q+3)+3) arcs, one in PG(2, 19) and another in PG(2, 43). Here, three further exceptions are exhibited, namely a complete (½(q+3)+4)‐arc in PG(2, 17), and two complete (½(q+3)+3)‐arcs, one in PG(2, 27) and another in PG(2, 59). The main result is Theorem 6.1 which shows the existence of a (½(q^r+3)+3)‐arc in PG(2,q^r) with r odd and q≡3 (mod 4) sharing ½(q^r+3) points with a conic, whenever PG(2,q) has a (½(q^r+3)+3)‐arc sharing ½(q^r+3) points with a conic. A survey of results for smaller q obtained with the use of the MAGMA package is also presented. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 25–47, 2010     

Randomly coloring graphs with lower bounds on girth and maximum degree

We consider the problem of generating a random q‐coloring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if the maximum degree Δ > c₁ln n and the girth g > c₂ln Δ (n = |V|) for sufficiently large c₁, c₂, then this chain mixes rapidly provided q/Δ > β, where β ≈ 1.763 is the root of β = e^1/β. For this class of graphs, this beats the 11Δ/6 bound of Vigoda 14 for general graphs. We extend the result to random graphs. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 167–179, 2003     

Unitals and inversive planes

We show that if U is a Buekenhout-Metz unital (with respect to a point P) in any translation plane of order q ² with kernel containing GF(q), then U has an associated 2-(q²,q+1,q) design which is the point-residual of an inversive plane, generalizing results of Wilbrink, Baker and Ebert. Further, our proof gives a natural, geometric isomorphism between the resulting inversive plane and the (egglike) inversive plane arising from the ovoid involved in the construction of the Buekenhout-Metz unital. We apply our results to investigate some parallel classes and partitions of the set of blocks of any Buekenhout-Metz unital.     

Commuting polarities and maximal partial ovoids of H(4,q2)

In PG(4,q²), q odd, let Q(4,q²) be a non‐singular quadric commuting with a non‐singular Hermitian variety H(4,q²). Then these varieties intersect in the set of points covered by the extended generators of a non‐singular quadric Q₀ in a Baer subgeometry Σ₀ of PG(4,q²). It is proved that any maximal partial ovoid of H(4,q²) intersecting Q₀ in an ovoid has size at least 2(q²+1). Further, given an ovoid O of Q₀, we construct maximal partial ovoids of H(4,q²) of size q³+1 whose set of points lies on the hyperbolic lines 〈P,X〉 where P is a fixed point of O and X varies in O\{P}. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 307–313, 2009