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.     

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     

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)     

Non Deterministic Classical Logic: The λμ++ ‐calculus

In this paper, we present an extension of λμ‐calculus called λμ⁺⁺‐calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel‐or.     

Approximation properties of λ‐Bernstein‐Kantorovich operators with shifted knots

In the present article, Kantorovich variant of λ‐Bernstein operators with shifted knots are introduced. The advantage of using shifted knot is that one can do approximation on [0,1] as well as on its subinterval. In addition, it adds flexibility to operators for approximation. Some basic results for approximation as well as rate of convergence of the introduced operators are established. The r^th order generalization of the operator is also discussed. Further for comparisons, some graphics and error estimation tables are presented using MATLAB.     

A construction of resolvable nested 3‐designs

A method of constructing resolvable nested 3‐designs from an affine resolvable 3‐design is proposed with one example. © 2004 Wiley Periodicals, Inc.     

The basis decision problem in λ-calculus

We show that the problem of deciding if a finite set of closed terms in normal form is a basis is recursively unsolvable. The restricted problem concerning one element sets is still recursively unsolvable. MSC: 03B40, 03D35.     

A relationship between λ‐symmetries and first integrals for ordinary differential equations

In this paper, we provide some geometric properties of λ‐symmetries of ordinary differential equations using vector fields and differential forms. According to the corresponding geometric representation of λ‐symmetries, we conclude that first integrals can also be derived if the equations do not possess enough symmetries. We also investigate the properties of λ‐symmetries in the sense of the deformed Lie derivative and differential operator. We show that λ‐symmetries have the exact analogous properties as standard symmetries if we take into consideration the deformed cases.     

Admissible perturbations of α‐ψ‐pseudocontractive operators: convergence theorems

We prove some convergence theorems for α‐ψ‐pseudocontractive operators in real Hilbert spaces, by using the concept of admissible perturbation. Our results extend and complement some theorems in the existing literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Destructibility of stationary subsets of Pκλ

For a regular cardinal κ with κ ^<κ = κ and κ ≤ λ , we construct generically (forcing by a < κ‐closed κ ⁺‐c. c. p. o.‐set ℙ₀) a subset S of {x ∈ P _κ λ : x ∩ κ is a singular ordinal} such that S is stationary in a strong sense (F ^IA_κ λ ‐stationary in our terminology) but the stationarity of S can be destroyed by a κ ⁺‐c. c. forcing ℙ* (in V ^ℙ) which does not add any new element of P _κ λ . Actually ℙ* can be chosen so that ℙ* is κ‐strategically closed. However we show that such ℙ* itself cannot be κ‐strategically closed or even <κ‐strategically closed if κ is inaccessible. (© 2005 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     

A partition property of a mixed type for Pκ(λ)

Given a regular infinite cardinal κ and a cardinal λ > κ, we study fine ideals H on P_κ(λ) that satisfy the square brackets partition relation , where μ is a cardinal ≥2. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Time decay rate for two 3D magnetohydrodynamics‐ α models

We consider the long time behavior of solutions to the magnetohydrodynamics‐ α model in three spatial dimensions. Time decay rate in L²‐norm of the solution is obtained. Similar results for a generalized Leray‐ α‐magnetohydrodynamics model are also established. As a by‐product, an optimal time decay rate for the Navier–Stokes‐ α model is achieved. Copyright © 2013 John Wiley & Sons, Ltd.     

Some results on the existence of large sets of t‐designs

A set of trivial necessary conditions for the existence of a large set of t‐designs, LS[N](t,k,ν), is for i = 0,…,t. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary conditions are sufficient in the cases N = 2 and 3, respectively. Ajoodani‐Namini has established the truth of Hartman's conjecture for t = 2. Apart from this celebrated result, we know the correctness of the conjectures for a few small values of k, when N = 2 and t ≤ 6, and also when N = 3 and t ≤ 4. In this article, we show that similar results can be obtained for infinitely many values of k. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 144–151, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10027     

D‐optimal designs and group divisible designs

We obtain new conditions on the existence of a square matrix whose Gram matrix has a block structure with certain properties, including D‐optimal designs of order , and investigate relations to group divisible designs. We also find a matrix with large determinant for n = 39. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 451–462, 2006     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Global well‐posedness for two modified‐Leray‐α‐MHD models with partial viscous terms

In this paper, we will prove global well‐posedness for the Cauchy problems of two modified‐Leray‐α‐MHD models with partial viscous terms. Copyright © 2009 John Wiley & Sons, Ltd.     

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.     

On the existence of mandatory representation designs with block sizes 3 and k

A mandatory representation design MR[ν,K] is a pairwise balanced design on ν points with block sizes from K in which for each k ∈ K there is a block in the design of size k. Mendelsohn and Rees [4] investigated the existence of MR[ν,K]s, where 3 ∈ K. In this report we consider additional necessary conditions, where K = {3,k}. These conditions are proved to be sufficient for 4 ≤ k ≤ 50 with one genuine exception. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 122–131, 2000     

On effective σ‐boundedness and σ‐compactness

We prove several dichotomy theorems which extend some known results on σ‐bounded and σ‐compact pointsets. In particular we show that, given a finite number of $\Delta ^{1}_{1}$ equivalence relations $\mathrel {\mathsf {F}}_1,\dots ,\mathrel {\mathsf {F}}_n$, any $\Sigma ^{1}_{1}$ set A of the Baire space either is covered by compact $\Delta ^{1}_{1}$ sets and lightface $\Delta ^{1}_{1}$ equivalence classes of the relations $\mathrel {\mathsf {F}}_i$, or A contains a superperfect subset which is pairwise $\mathrel {\mathsf {F}}_i$‐inequivalent for all i = 1, …, n. Further generalizations to $\Sigma ^{1}_{2}$ sets A are obtained.