A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks

Consider an incidence structure whose points are the points of a PG_n(n+2,q) and whose block are the subspaces of codimension two, where n?2. Since every two subspaces of codimension two intersect in a subspace of codimension three or codimension four, it is easily seen that this incidence structure is a quasi-symmetric design. The aim of this paper is to prove a characterization of such designs (that are constructed using projective geometries) among the class of all the quasi-symmetric designs with correct parameters and with every block a good block. The paper also improves an earlier result for the special case of n=2 and obtains a Dembowski-Wagner-type result for the class of all such quasi-symmetric designs.     

Extended skolem sequences

A k-extended Skolem sequence of order n is an integer sequence (s₁, s₂,…, s_2n+1) in which s_k = 0 and for each j ? {1,…,n}, there exists a unique i ? {1,…, 2n} such that s_i = s_i+j = j. We show that such a sequence exists if and only if either 1) k is odd and n ≡ 0 or 1 (mod 4) or (2) k is even and n ≡ 2 or 3 (mod 4). The same conditions are also shown to be necessary and sufficient for the existence of excess Skolem sequences. Finally, we use extended Skolem sequences to construct maximal cyclic partial triple systems. © 1995 John Wiley & Sons, Inc.     

Characterizing geometric designs, II

We provide a characterization of the classical point-line designs PG₁(n,q), where n?3, among all non-symmetric 2-(v,k,1)-designs as those with the maximal number of hyperplanes. As an application of this result, we characterize the classical quasi-symmetric designs PGn−2(n,q), where n?4, among all (not necessarily quasi-symmetric) designs with the same parameters as those having line size q+1 and all intersection numbers at least qn−4+?+q+1. Finally, we also give an explicit lower bound for the number of non-isomorphic designs having the same parameters as PG₁(n,q); in particular, we obtain a new proof for the known fact that this number grows exponentially for any fixed value of q.     

On the multiplicative structure of odd perfect numbers

Starting with Euler's theorem that any odd perfect number n has the form n = p^ep_i^2e_i … p_k^2e_k, where p, p₁,…,p_k are distinct odd primes and p ≡ e ≡ 1 (mod 4), we show that extensive subsets of these numbers (so described) can be eliminated from consideration. A typical result says: if p^e, p_i^2e_i,…,p_r^2e_r are all of the prime-power divisors of such an n with p ≡ p_i ≡ 1 (mod 4), then the ordered set {e₁,…,e_r} contains an even number or odd number of odd numbers according as e ≡ pore ≡ p (mod 8).     

Hamiltonian decompositions of complete regular s-partite graphs

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K_n,n,…,n, where (s − 1)n is even, can be constructed. For 2t⩽s, 1⩽a₁⩽…⩽a_t⩽n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of K_a1a2…,a_t into (s − 1)n/2 classes, each class consisting of disjoint paths, to be extendible to a Hamiltonian decomposition of the complete s-partite graph K_rmn,n,…,n so that each of the classes forms part of a Hamiltonian cycle.     

On cyclic decompositions of the complete graph into the 2-regular graphs

The symbol C(m₁ ⁿ ₁m₂ ⁿ ₂...m_s ⁿ _s) denotes a 2-regular graph consisting ofn _i cycles of lengthm _i , i=1, 2,…,s. In this paper, we give some construction methods of cyclic(K _v ,G)-designs, and prove that there exists a cyclic(K _v , G)-design whenG=C((4m ₁) ⁿ ₁(4m ₂) ⁿ ₂...(4m _s ) ⁿ _s andv ≡ 1 (mod 2¦G¦).     

Construction of steiner quadruple systems having a prescribed number of blocks in common

Let q_υ=υ(υ–1)(υ–2)/24 and let I_υ={0, 1, 2, …, q_{υ–14}∪{qυ}–12, q_υ–8, q_υ}, for υ?8 Further, let J[υ] denote the set of all k such that there exists a pair of Steiner quadruple systems of order υ having exactly k blocks in common. We determine J[υ] for all υ=2ⁿ, n?2, with the possible exception of 7 cases for υ=16 and of 5 cases for each υ?32. In particular we show: J[υ]?I_υ for all υ≡2 or 4 (mod 6) and υ?8, J[4]={1}, J[8]=I₈={0, 2, 6, 14}, I₁₆?{103, 111, 115, 119, 121, 122, 123}?J[16], and I_υ? {q_υ–h:h=17, 18, 19, 21, 25}?J[υ] for all υ=2ⁿ, n?5.     

Diophantine problems in variables restricted to the values 0 and 1

Let $\text{F}$x₁,…,x_s be a form of degree d with integer coefficients. How large must s be to ensure that the congruence $\text{F}$(x₁,…,x_s) ≡ 0 (mod m) has a nontrivial solution in integers 0 or 1? More generally, if $\text{F}$ has coefficients in a finite additive group G, how large must s be in order that the equation $\text{F}$(x₁,…,x_s) = 0 has a solution of this type? We deal with these questions as well as related problems in the group of integers modulo 1 and in the group of reals.     

Ordering Functions of Random Vectors, with Application to Partial Sums

It is known that the sums of the components of two random vectors (X ₁,X ₂,…,X _n ) and (Y ₁,Y ₂,…,Y _n ) ordered in the multivariate (s ₁,s ₂,…,s _n )-increasing convex order are ordered in the univariate (s ₁+s ₂+?+s _n )-increasing convex order. More generally, real-valued functions of (X ₁,X ₂,…,X _n ) and (Y ₁,Y ₂,…,Y _n ) are ordered in the same sense as long as these functions possess some specified non-negative cross-derivatives. This note extends these results to multivariate functions. In particular, we consider vectors of partial sums (S ₁,S ₂,…,S _n ) and (T ₁,T ₂,…,T _n ) where S _j =X ₁+?+X _j and T _j =Y ₁+?+Y _j and we show that these random vectors are ordered in the multivariate (s ₁,s ₁+s ₂,…,s ₁+?+s _n )-increasing convex order. The consequences of these general results for the upper orthant order and the orthant convex order are discussed.     

On theT-ideal generated by a standard identity

We determine the structure of the ideal of identities of degreen +1 in theT-ideals T_o(s_n(x₁,…,x_n)) and T_o(u_n(x₁,…,x_n)), wheres _n is the standard identity and u_n the unitary identity of degreen.     

Asymptotics and Arithmetical Properties of Complexity for Circulant Graphs

Abstract—We study analytical and arithmetical properties of the complexity function for infinite families of circulant C _n (s₁, s_2,…, s _k ) C_2n(s₁, s_2,…, s _k , n). Exact analytical formulas for the complexity functions of these families are derived, and their asymptotics are found. As a consequence, we show that the thermodynamic limit of these families of graphs coincides with the small Mahler measure of the accompanying Laurent polynomials.     

On a conjecture of jungnickel and tonchev for quasi-symmetric designs

Jungnickel and Tonchev conjectured in [4] that if a quasi-symmetric design D is an s-fold quasi-multiple of a symmetric (v,k,λ) design with (k,(s ? 1)λ) = 1, then D is a multiple. We prove this conjecture under any one of the conditions: s ≤ 7, k ? 1 is prime, or the design D is a 3-design. It is shown that for any fixed s, the conjecture is true with at most finitely many exceptions. The unique quasi-symmetric 3-(22,7,4) design is characterized as the only quasi-symmetric 3-design, which as a 2-design is an s-fold quasi-multiple with s ≡ 1 (mod k). © 1994 John Wiley & Sons, Inc.     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

On the diophantine equation x 2 − Dy 2 = n

We propose a method to determine the solvability of the diophantine equation x2-Dy2=n for the following two cases:(1) D = pq,where p,q ≡ 1 mod 4 are distinct primes with(q/p)=1 and(p/q)4(q/p)4=-1.(2) D=2p1p2 ··· pm,where pi ≡ 1 mod 8,1≤i≤m are distinct primes and D=r2+s2 with r,s ≡±3 mod 8.     

Palindromic widths of nilpotent and wreath products

We prove that the nilpotent product of a set of groups A ₁,…,A _s has finite palindromic width if and only if the palindromic widths of A _i ,i=1,…,s,are finite. We give a new proof that the commutator width of F _n ?K is infinite, where F _n is a free group of rank n≥2 and K is a finite group. This result, combining with a result of Fink [9] gives examples of groups with infinite commutator width but finite palindromic width with respect to some generating set.     

Mutually disjoint designs and new 5‐designs derived from groups and codes

The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal self‐dual codes. Several new simple 5‐designs are found with parameters that were left open in the table of 5‐designs given in (G. B. Khosrovshahi and R. Laue, t‐Designs with t⩾3, in “Handbook of Combinatorial Designs”, 2nd edn, C. J. Colbourn and J. H. Dinitz (Editors), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 79–101), namely, 5−(v, k, λ) designs with (v, k, λ)=(18, 8, 2m) (m=6, 9), (19, 9, 7m) (m=6, 9), (24, 9, 6m) (m=3, 4, 5), (25, 9, 30), (25, 10, 24m) (m=4, 5), (26, 10, 126), (30, 12, 440), (32, 6, 3m) (m=2, 3, 4), (33, 7, 84), and (36, 12, 45n) for 2⩽n⩽17. These results imply that a simple 5−(v, k, λ) design with (v, k)=(24, 9), (25, 9), (26, 10), (32, 6), or (33, 7) exists for all admissible values of λ. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 305–317, 2010     

On the average number of records for sequences of not identically distributed random variables

The scheme of n series of independent random variables X ₁₁, X ₂₁, …, X _k1, X ₁₂, X ₂₂, …, X _k2, …, X _1n , X _2n , …, X _kn is considered. Each of these successive series X _1m , X _2m , …, X _km , m = 1, 2, …, n consists of k variables with continuous distribution functions F ₁, F ₂, …, F _k , which are the same for all series. Let N(nk) be the number of upper records of the given nk random variables, and EN(nk) be the corresponding expected value. For EN(nk) exact upper and lower estimates are obtained. Examples are given of the sets of distribution functions for which these estimates are attained.     

The existence of Howell designs of odd side

Three recursive constructions for Howell designs are described, and it is shown that all Howell designs H(s, 2n) exist, with s odd, n ? s ? 2n ? 1, (s, 2n) ≠ (3, 4), (5, 6), or (5, 8). This settles the existence question for Howell designs of odd side.     

Presentations of alternating semigroups

One presentation of the alternating groupA _n hasn?2 generatorss ₁,…,s_n?2 and relationss ₁ ³ =s _i ² =(s_1?1s_i)³=(s_js_k)²=1, wherei>1 and |j?k|>1. Against this backdrop, a presentation of the alternating semigroupA _n ^c )A _n is introduced: It hasn?1 generatorss ₁,…,S _n?2,e, theA _n-relations (above), and relationse ²=e, (es ₁)⁴, (es _j)²=(es _j)⁴,es _i=s _i s ₁ ^-1 es ₁, wherej>1 andi≥1.     

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub‐tournaments

Ao and Hanson, and Guiduli, Gyárfás, Thomassé and Weidl independently, proved the following result: For any tournament score sequence S = (s₁, s₂, … ,s_n) with s₁≤s₂ ≤ … ≤ s_n, there exists a tournament T on vertex set {1,2, …, n} such that the score of each vertex i is s_i and the sub‐tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is, i dominates j whenever i > j and i ≡ j (mod 2). In this note, we give a much shorter proof of the result. In the course of doing so, we show that the score sequence of a tournament satisfies a set of inequalities which are individually stronger than the well‐known set of inequalities of Landau, but collectively the two sets of inequalities are equivalent. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 244–254, 2001