Some new BIBDS with λ = 1 and 6 ≤ k ≤ 10

This article is in two main parts. The first gives some (q,k, 1) difference families with q a prime power and 7 ≤ k ≤ 9; it also gives some GD(k, 1, k,kq)s which are extendable to resolvable (kq,k, 1) BIBDs for k E {6,8,10} and q a prime power equal to 1 mod 2(k − 1). The second uses some of these plus several recursive constructions to obtain some new (v,k,, 1) BIBDs with 7 ≤ k ≤ 9 and some new (v,8,1) resolvable BIBDs. © 1996 John Wiley & Sons, Inc.     

Virtually balanced incomplete block designs for v = 22, k = 8, and λ = 4

When basic necessary conditions for the existence of a balanced incomplete block design are satisfied, the design may still not exist or it may not be known whether it exists. In either case, other designs may be considered for the same parameters. In this article we introduce a class of alternative designs, which we will call virtually balanced incomplete block designs. From a statistical point of view these designs provide efficient alternatives to balanced incomplete block designs, and from a combinatorial point of view they offer challenging new questions. © 1995 John Wiley & Sons, Inc.     

All λ‐Designs with Small λ are Type‐1

A λ‐design is a family of subsets of such that for all and not all are of the same size. Ryser's and Woodall's λ‐design conjecture states that each λ‐design can be obtained from a symmetric block design by a certain complementation procedure. Our main result is that the conjecture is true when λ < 63. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 408–431, 2012     

On the existence of pure (v, 4, λ)-PMD with λ = 1 and 2

In this article, we investigate the existence of pure (v, 4, λ)-PMD with λ = 1 and 2, and obtain the following results: (1) a pure (v, 4, 1)-PMD exists for every positive integer v = 0 or 1 (mod 4) with the exception of v = 4 and 8 and the possible exception of v = 12; (2) a pure (v, 4, 2)-PMD exists for every integer v ≥ 6. © 1994 John Wiley & Sons, Inc.     

Solutions of the Differential Equation u‴+λ2zu+(α−1)λ2u=0

This paper deals with the solutions of the differential equation u?+λ²zu+(α?1)λ²u=0, in which λ is a complex parameter of large absolute value and α is an arbitrary constant, real or complex. After a discussion of the structure of the solutions of the differential equation, an integral representation of the solution is given, from which the series solutions and their asymptotic representations are derived. A third independent solution is needed for the special case when α?1 is a positive integer, and two derivations for this are given. Finally, a comparison is made with the results obtained by R. E. Langer.     

Some results on λ‐designs with two block sizes

A λ‐design is a family ?? = {B₁, B₂, …, B_v} of subsets of X = {1, 2, …, v} such that |B_i∩B_j| = λ for all i≠jand not all B_i are of the same size. The only known example of λ‐designs (called type‐1 designs) are those obtained from symmetric designs by a certain complementation procedure. Ryser [J Algebra 10 (1968), 246–261] and Woodall [Proc London Math Soc 20 (1970), 669–687] independently conjectured that all λ‐designs are type‐1. Let g = gcd(r ? 1, r^* ? 1), where rand r^* are the two replication numbers. Ionin and Shrikhande [J Combin Comput 22 (1996), 135–142; J Combin Theory Ser A 74 (1996), 100–114] showed that λ‐designs with g = 1, 2, 3, 4 are type‐1 and that the Ryser–Woodall conjecture is true for λ‐designs on p + 1, 2p + 1, 3p + 1, 4p + 1 points, where pis a prime. Hein and Ionin [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 145–156] proved corresponding results for g = 5 and Fiala [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 109–124; Ars Combin 68 (2003), 17–32; Ars Combin, to appear] for g = 6, 7, and 8. In this article, we consider λ designs with exactly two block sizes. We show that in this case, the conjecture is true for g = 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, and for g = 10, 14, 18, 22 with v≠4λ ? 1. We also give two results on such λ‐designs on v = 9p + 1 and 12p + 1 points, where pis a prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:95‐110, 2011     

Spectral Problems for Systems of Differential Equations y′ + A0y = λA1y with λ–Polynomial Boundary Conditions

This paper deals with the spectral properties of boundary eigenvalue problems for systems of first order differential equations with boundary conditions which depend on the spectral parameter polynomially. It is not assumed that is injective or surjective. The main results concern the completeness minimality and Riesz basis properties of the corresponding eigenfunctions and associated functions.     

Nonsymmetric 2‐(v,k,λ) designs,with (r,λ) = 1, admitting a solvable flag‐transitive automorphism group of affine type

Nonsymmetric $2‐\left(v,k,\lambda \right)$ designs, with $\left(r,\lambda \right)=1$, admitting a solvable flag‐transitive automorphism group of affine type not contained in $A\mathrm{\Gamma }{L}_1\left(v\right)$ are classified.     

On Symmetric Association Schemes with k 1=3

In this paper, we have a classification of primitive symmetric association schemes with k ₁ = 3.     

On the Inverse Scattering Problem for Cubic Eigenvalue Problems of the Class ψxxx + 6Qψx + 6Rψ = λψ

The inverse scattering problem for cubic eigenvalue equations of the form ψ_xxx + 6Qψ_x + 6R_ψ = λψ is outlined and formally solved. Many properties of the scattering data are obtained, the continuous spectrum is briefly discussed, special one soliton solutions are obtained, and the infinity of conserved quantities are determined in terms of the scattering data.     

The λ-complete multigraphs

Let E₁……E_m be the edges of a hypergraph. Assume each element in the union of the edges occurs in at least two of E₁……E_m. Assume further that every pair of distinct edges, E₁, and E₁, intersect in at most one element and that for each such pair there are exactly λ other edges E_k such that E₁ and E₁ both intersect E_k. We characterize the hypergraphs for which each |E₁| ≤ 2. These are the λ-complete multigraphs.     

On the series ∑ k=1 ∞ ( k 3k )−1 k −n x k

In this paper we investigate the series ∑ _k=1 ^∞ ( _k ^3k )⁻¹ k ⁻ⁿ x ^k . Obtaining some integral representations of them, we evaluated the sum of them explicitly forn = 0, 1, 2.     

The wi‐club filter on 𝒫κ λ

We develop the theory of C_{κ, λ}ⁱ, a strongly normal filter over ??_κ λ for Mahlo κ. We prove a minimality result, showing that any strongly normal filter containing {x ∈ ??_κ λ: |x | = |x ∩ κ | and |x | is inaccessible} also contains C_{κ, λ}ⁱ. We also show that functions can be used to obtain a basis for C_{κ, λ}ⁱ (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

Exceptions and characterization results for type‐1 λ‐designs

Let $X$ be a finite set with $v$ elements, called points and $\beta$ be a family of subsets of $X$, called blocks. A pair $\left(X,\beta \right)$ is called $\lambda$‐design whenever $\mid \beta \mid =\mid X\mid$ and

• 1. for all $B_i,B_j\in \beta ,i\ne j,\mid B_i\cap B_j\mid =\lambda$;
• 2. for all $B_j\in \beta ,\mid B_j\mid =k_j>\lambda$, and not all $k_j$ are equal.

The only known examples of $\lambda$‐designs are so‐called type‐1 designs, which are obtained from symmetric designs by a certain complementation procedure. Ryser and Woodall had independently conjectured that all $\lambda$‐designs are type‐1. Let $r,r^{*}?(r>r^{*})$ be replication numbers of a $\lambda$‐design $D=\left(X,\beta \right)$ and $g=\text{gcd}\left(r?1,r^{*}?1\right),m=\text{gcd}\left(\left(r?r^{*}\right)∕g,\lambda \right)$, and $m\prime =m$, if $m$ is odd and $m\prime =m∕2$, otherwise. For distinct points $x$ and $y$ of $D$, let $\lambda \left(x,y\right)$ denote the number of blocks of $X$ containing $x$ and $y$. We strengthen a lemma of S.S. Shrikhande and N.M. Singhi and use it to prove that if $\frac{r\left(r?1\right)}{\left(v?1\right)}?\frac{k\left(r?r^{*}\right)}{m\prime \left(v?1\right)}$ are not integers for $k=1,2,\text{…},m\prime ?1$, then $D$ is type‐1. As an application of these results, we show that for fixed positive integer $\theta$ there are finitely many nontype‐1 $\lambda$‐designs with $r=r^{*}+\theta$. If $r?r^{*}=27$ or $r?r^{*}=4p$ and $r^{*}\ne {\left(p?1\right)}^2$, or $v=7p+1$ such that $p?1,13\left(\mathrm{mod}21\right)$ and $p?4,9,19,24\left(\mathrm{mod}35\right)$, where $p$ is a positive prime, then $D$ is type‐1. We further obtain several inequalities involving $\lambda (x,y)$, where equality holds if and only if D is type‐1.     

The spectrum of cyclic BSA(ν, 3, λ; α) with α = 2, 3

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao, and Stufken in 1988. In this paper, we generalize the concept of a cyclic BSEC to a cyclic balanced sampling plan to avoid the selection of adjacent units (or CBSA for short) and use Langford and extended Langford sequences to construct a cyclic BSA(ν, 3, λ; α) with α = 2, 3. We finally establish the necessary and sufficient conditions for the existence of a cyclic BSA(ν, 3, λ; α) where α = 2, 3. © 2005 Wiley Periodicals, Inc. J Combin Designs.