The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups

Augmented candelabra quadruple systems play an important role in the construction of Steiner 3-designs. In this paper, we consider augmented resolvable candelabra quadruple systems with three even groups and show that the necessary conditions on the existence of ARCQS(g ³ : s) when g is even are also sufficient.     

On the Cameron-Praeger conjecture

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v,k,λ) designs with λ=1, except possibly when the group is PΓL(2,pe) with p=2 or 3, and e is an odd prime power.     

Unifying some known infinite families of combinatorial 3-designs

In this paper we present a construction of 3-designs by using a 3-design with resolvability. The basic construction generalizes a well-known construction of simple 3-(v,4,3) designs by Jungnickel and Vanstone (1986). We investigate the conditions under which the designs obtained by the basic construction are simple. Many infinite families of simple 3-designs are presented, which are closely related to some known families by Iwasaki and Meixner (1995), Laue (2004) and van Tran (2000, 2001). On the other hand, the designs obtained by the basic construction possess various properties: A theory of constructing simple cyclic 3-(v,4,3) designs by Köhler (1981) can be readily rebuilt from the context of this paper. Moreover many infinite families of simple resolvable 3-designs are presented in comparison with some known families. We also show that for any prime power q and any odd integer n there exists a resolvable 3-(qn+1,q+1,1) design. As far as the authors know, this is the first and the only known infinite family of resolvable t-(v,k,1) designs with t?3 and k?5. Those resolvable designs can again be used to obtain more infinite families of simple 3-designs through the basic construction.     

A construction of 2-designs from Steiner systems and extendable designs

We give a construction of a 2-(mn²+1,mn,(n+1)(mn−1)) design starting from a Steiner system S(2,m+1,mn²+1) and an affine plane of order n. This construction is applied to known classes of Steiner systems arising from affine and projective geometries, Denniston designs, and unitals. We also consider the extendability of these designs to 3-designs.     

Embeddable transversal designs

The embeddability of certain (group) divisible designs in symmetric 2-designs is investigated. These designs are symmetric resolvable transversal designs. It is proved that all such transversal designs with v = 2k are embeddable and some necessary and sufficient conditions for other cases are given.     

Some mutually disjoint steiner systems

A t-design λ; t-d-n is a system of subsets of size d (called blocks) from an n-set S, such that each t-subset from S is contained in precisely λ blocks. A Steiner system S(l, m, n) is a t-design with parameters 1; l-m-n. Two Steiner systems (or t-designs) are disjoint if they share no blocks. A search has been conducted which resulted in discovering 9 mutually disjoint S(5, 8, 24)'s, 24 mutually disjoint S(4, 7, 23)'s, 60 mutually disjoint S(3, 6, 22)'s, and 197 mutually disjoint S(2, 5, 21)'s. Taking unions of several mutually disjoint Steiner systems will then produce t-designs (with varying λ's) on 21, 22, 23, and 24 points.     

New Maximal Arcs in Desarguesian Planes

Constructions are described of maximal arcs in Desarguesian projective planes utilizing sets of conics on a common nucleus in PG(2, q). Several new infinite families of maximal arcs in PG(2, q) are presented and a complete enumeration is carried out for Desarguesian planes of order 16, 32, and 64. For each arc we list the order of its stabilizer and the numbers of subarcs it contains. Maximal arcs may be used to construct interesting new partial geometries, 2-weight codes, and resolvable Steiner 2-designs.     

Infinite families of 2- and 3-designs with parameters v = p + 1, k = (p − 1)/2i + 1, where p odd prime, 2e T (p − 1), e ≥ 2, 1 ≤ i ≤ e

Let p be an odd prime number such that p − 1 = 2^em for some odd m and e ≥ 2. In this article, by using the special linear fractional group PSL(2, p), for each i, 1 ≤ i ≤ e, except particular cases, we construct a 2-design with parameters v = p + 1, k = (p − 1)/2ⁱ + 1 and λ = ((p − 1)/2ⁱ+1)(p − 1)/2 = k(p − 1)/2, and in the case i = e we show that some of these 2-designs are 3-designs. Likewise, by using the linear fractional group PGL(2,p) we construct an infinite family of 3-designs with the same v k and λ = k(k − 2). These supplement a part of [4], in which we gave an infinite family of 3-designs with parameters v = q + 1, k = (q + 1)/2 = (q − 1)/2 + 1 and λ = (q + 1)(q − 3)/8 = k(k − 2)/2, where q is a prime power such that q − 1 = 2m for some odd m and q > 7. Some of the designs given in this article and in [4] fill in a few blanks in the table of Chee, Colbourn, and Kreher [2]. © 1997 John Wiley & Sons, Inc.     

The smallest non-derived steiner triple system is simple as a loop

The smallest non-derived triple system is simple as a loop. THEOREM.If A, B are Steiner loops, and f:A→B is a homomorphism, then if B and f ^?1 (1) are derivable from Steiner quadruple systems, then so is A.     

On Resolvable Difference Families

A Steiner 2-design is said to be G-invariantly resolvable if admits an automorphism group G and a resolution invariant under G. Introducing and studying resolvable difference families, we characterize the class of G-invariantly resolvable Steiner 2-designs arising from relative difference families over G. Such designs have been already studied by Genma, Jimbo, and Mishima [13] in the case in which G is cyclic. Developping their results, we prove that any (p, k, 1)-DF (p prime) whose base blocks exactly cover p–1/k(k–1) distinct cosets of the k-th roots of unity (mod p), leads to a Ckp-invariantly resolvable cyclic (kp,k,1)-BBD. This induced us to propose several constructions for DF's having this property. In such a way we prove, in particular, the existence of a C5p-invariantly resolvable cyclic (5p, 5, 1)-BBD for each prime p = 20n + 1 < 1.000.     

A census of highly symmetric combinatorial designs

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t=2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t>2 most of these characterizations have remained long-standing challenging problems. Especially, the determination of all flag-transitive Steiner t-designs with 3≤t≤6 is of particular interest and has been open for about 40 years (cf. Delandtsheer (Geom. Dedicata 41, p. 147, 1992 and Handbook of Incidence Geometry, Elsevier Science, Amsterdam, 1995, p. 273), but presumably dating back to 1965). The present paper continues the author’s work (see Huber (J. Comb. Theory Ser. A 94, 180–190, 2001; Adv. Geom. 5, 195–221, 2005; J. Algebr. Comb., 2007, to appear)) of classifying all flag-transitive Steiner 3-designs and 4-designs. We give a complete classification of all flag-transitive Steiner 5-designs and prove furthermore that there are no non-trivial flag-transitive Steiner 6-designs. Both results rely on the classification of the finite 3-homogeneous permutation groups. Moreover, we survey some of the most general results on highly symmetric Steiner t-designs.      

Eigenvectors and cyclic vectors of bilateral weighted shifts. II: Simply invariant subspaces

Let T be an injective bilateral weighted shift onl ² thought as "multiplication by λ" on a space of formal Laurent series L²(β). (a) If L²(β) is contained in a space of quasi-analytic class of functions, then the point spectrum σ_p(T^?) of T^? contains a circle and the cyclic invariant subspaceM _f of T generated by f is simply invariant (i.e., ∩{(T^k M _f)^?: k ≥ 0}= {0}) for each f in L²(β); (b) If L²(β) contains a non-quasi-analytic class of functions (defined on a circle г) of a certain type related with the weight sequence of T, then there exists f in L²(ß) such thatM _f is a non-trivial doubly invariant subspace (i.e., (TM _f)^? =M _f); furthermore, if г ? σ_p(T^*), then σ_p (T^*) = г and f can be chosen so that σ_p([T∣M _f]^*) = г?{α}, for some α ε г. Several examples show that the gap between operators satisfying (a) and operators satisfying (b) is rather small.     

Halving Steiner 2-designs

A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into K_ks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In this paper, we give an asymptotic solution for various block sizes. We prove that for any k?5 or any Mersenne prime k, there is a constant number v₀ such that if v>v₀ and v satisfies the above necessary condition, then there exists a halvable S(2,k,v). We also show that a halvable S(2,2ⁿ,v) exists for over a half of possible orders. Some recursive constructions generating infinitely many new halvable Steiner 2-designs are also presented.     

On the maximal number of pairwise orthogonal Steiner triple systems

For some time it has been known that for prime powers p^k = 1 + 3 · 2^st there exists a pair of orthogonal Steiner triple systems of order p^k. In fact, such a pair can be constructed using the method of Mullin and Nemeth for constructing strong starters. We use a generalization of the construction of Mullin and Nemeth to construct sets of mutually orthogonal Steiner triple systems for many of these prime powers. By using other techniques we show that a set of mutually orthogonal Steiner triple systems of any given size can be constructed for all but a finite number of such prime powers.     

О функциях, удовлетворяюших ослабленному условию асимптотической моногенности

We consider functionsf(z),z∈D, of one complex variable that satisfy the following weakened asymptotic monogeny condition: for some positiveσ<1/2,f(z) is monogenic at each pointξ∈D with respect to some setG(ξ) such that the lower density ofG(ξ) atξ is greater than 1/2+σ. We show that if for somep _σ ≥1 the function (log⁺|?(z)|) ^p _σ is locally integrable inD with respect to the plane Lebesgue measure, thenf(z) is holomorphic inD.     

On necessary and sufficient conditions for uniform strong consistency of estimators of a density and its derivatives

Based on a random sample from a population with (unknown) probability density f, this note exhibits a class of statistics f^(p) for each fixed integer $\text{p ≧ 0}$. It is shown that f^(p) are uniformly strongly consistent estimators of f^(p), the pth order derivative of f, if and only iff^(p)is bounded and uniformly continuous.     

The classification of flag-transitive Steiner 4-designs

Among the properties of homogeneity of incidence structures flag-transitivity obviously is a particularly important and natural one. Consequently, in the last decades flag-transitive Steinert-designs (i.e. flag-transitive t-(v,k,1) designs) have been investigated, whereas only by the use of the classification of the finite simple groups has it been possible in recent years to essentially characterize all flag-transitive Steiner 2-designs. However, despite the finite simple group classification, for Steiner t-designs with parameters t > 2 such characterizations have remained challenging open problems for about 40 years (cf. [11, p. 147] and [12 p. 273], but presumably dating back to around 1965). The object of the present paper is to give a complete classification of all flag-transitive Steiner 4-designs. Our result relies on the classification of the finite doubly transitive permutation groups and is a continuation of the author's work [20, 21] on the classification of all flag-transitive Steiner 3-designs. 2000 Mathematics Subject Classification. Primary 51E10 . Secondary 05B05 . 20B25     

On some arithmetic properties of Mahler functions

Mahler functions are power series f(x) with complex coefficients for which there exist a natural number n and an integer ? ≥ 2 such that f(x), f(x^?),..., \(f({x^{{\ell ^{n - 1}}}}),f({x^{{\ell ^n}}})\) are linearly dependent over ?(x). The study of the transcendence of their values at algebraic points was initiated by Mahler around the’ 30s and then developed by many authors. This paper is concerned with some arithmetic aspects of these functions. In particular, if f(x) satisfies f(x) = p(x)f(x^?) with p(x) a polynomial with integer coefficients, we show how the behaviour of f(x) mirrors on the polynomial p(x). We also prove some general results on Mahler functions in analogy with G-functions and E-functions.     

Further cases of double resolvability

If m is 5 or 25 or 43, and n ? 1, the set of all combinations of 3ⁿm things three at a time can be partitioned into resolvable Steiner triple systems.     

A recursive construction of 1-rotational Steiner 2-designs

A Steiner 2-design S(2,k, v) is said to be 1-rotational if it admits an automorphism whose cycle structure is a (v ? 1)-cycle and a fixed point. In this paper, a recursive construction of 1-rotational Steiner 2-designs is given.