Triple intersection numbers for the Paley graphs

We give a tight bound for the triple intersection numbers of Paley graphs. In particular, we show that any three vertices have a common neighbor in Paley graphs of order larger than 25.     

Quasi‐symmetric designs with fixed difference of block intersection numbers

The following results for proper quasi‐symmetric designs with non‐zero intersection numbers x,y and λ > 1 are proved.

• (1) Let D be a quasi‐symmetric design with z = y ? x and v ≥ 2k. If x ≥ 1 + z + z³ then λ < x + 1 + z + z³.
• (2) Let D be a quasi‐symmetric design with intersection numbers x, y and y ? x = 1. Then D is a design with parameters v = (1 + m) (2 + m)/2, b = (2 + m) (3 + m)/2, r = m + 3, k = m + 1, λ = 2, x = 1, y = 2 and m = 2,3,… or complement of one of these design or D is a design with parameters v = 5, b = 10, r = 6, k = 3, λ = 3, and x = 1, y = 2.
• (3) Let D be a triangle free quasi‐symmetric design with z = y ? x and v ≥ 2k, then x ≤ z + z².
• (4) For fixed z ≥ 1 there exist finitely many triangle free quasi‐symmetric designs non‐zero intersection numbers x, y = x + z.
• (5) There do not exist triangle free quasi‐symmetric designs with non‐zero intersection numbers x, y = x + 2.

© 2006 Wiley Periodicals, Inc. J Combin Designs 15: 49–60, 2007     

More on block intersection polynomials and new applications to graphs and block designs

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the non-negative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Cameron and the present author. The theory of block intersection polynomials is extended, and new applications of these polynomials to the studies of graphs and block designs are obtained. In particular, we obtain a new method of bounding the size of a clique in an edge-regular graph with given parameters, which can improve on the Hoffman bound when applicable, and a new method for studying the possibility of a graph with given vertex-degree sequence being an induced subgraph of a strongly regular graph with given parameters.     

Quasi-symmetric designs with the difference of block intersection numbers two

Quasi-symmetric designs with intersection numbers x > 0 and y = x + 2 under the condition λ > 1 are investigated. If D(v, b, r, k, λ; x, y) is a quasi-symmetric design with above conditions then it is shown that either λ = x + 1 or x + 2 or D is a design with the parameters given in the Table 6 or complement of one of these designs.     

Existential closure of block intersection graphs of infinite designs having finite block size and index

In this article we study the n‐existential closure property of the block intersection graphs of infinite t‐(v, k, λ) designs for which the block size k and the index λ are both finite. We show that such block intersection graphs are 2‐e.c. when 2?t?k ? 1. When λ = 1 and 2?t?k, then a necessary and sufficient condition on n for the block intersection graph to be n‐e.c. is that n?min{t, ?(k ? 1)/(t ? 1)? + 1}. If λ?2 then we show that the block intersection graph is not n‐e.c. for any n?min{t + 1, ?k/t? + 1}, and that for 3?n?min{t, ?k/t?} the block intersection graph is potentially but not necessarily n‐e.c. The cases t = 1 and t = k are also discussed. © 2011 Wiley Periodicals, Inc. J Combin Designs 19: 85–94, 2011     

The spectrum of α‐resolvable designs with block size four

Abstact: An α‐resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly α times. In this paper, we show that the necessary conditions for the existence of α‐resolvable designs with block size four are sufficient, with the exception of (α, ν, λ) = (2, 10, 2). © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 1–16, 2001     

An intersection number for the punctual Hilbert scheme of a surface

We compute the intersection number between two cycles and of complementary dimensions in the Hilbert scheme parameterizing subschemes of given finite length of a smooth projective surface . The -cycle corresponds to the set of finite closed subschemes the support of which has cardinality 1. The -cycle consists of the closed subschemes the support of which is one given point of the surface. Since is contained in , indirect methods are needed. The intersection number is , answering a question by H. Nakajima.

     

On E(s2)‐optimal and minimax‐optimal supersaturated designs with 20 rows and 76 columns

We derive a previously unknown lower bound of 41 for the frequency of of an E(s²)‐optimal and minimax‐optimal supersaturated design (SSD) with 20 rows and 76 columns. This is accomplished by an exhaustive computer search that uses the combinatorial properties of resolvable 2 − (20, 10, 36) designs and the parallel class intersection pattern method. We also classify all nonisomorphic E(s²)‐optimal 4‐circulant SSDs with 20 rows and .     

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v,b,r,k,) equals (v,sv,sk,k, s) for some positive integer s and for some integers v,k, that satisfy (v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k, (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k, )-design.     

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     

The set of values of b for which there exist block designs with b blocks

Let B denote the set of values of b for which there exists a block design with b blocks and for k3, let B_k denote the subset of B determined by the designs with block size k. We present some information about B and the sets B_k. In particular, we discuss, for certain integers h, the question as to whether there exist integers k and k^′ such that the equation b^′=b+h has infinitely many solutions b,b^′ satisfying bB_k and b^′B_k^′. The study is restricted to the case λ=1.     

关于Lucas数列同余性质的研究

将二项式系数的性质应用到Lucas数列的研究中,并结合Fibonacci数列与Lucas数列的恒等式得到几个有趣的Lucas数列的同余式.     

On the Lyubeznik numbers of a local ring

We collect some information about the invariants of a commutative local ring containing a field introduced by G. Lyubeznik in 1993 (Finiteness properties of local cohomology modules, Invent. Math. 113, 41-55). We treat the cases equal to zero, one and two, thereby answering in the negative a question raised in Lyubeznik's paper. In fact, we will show that has in the two-dimensional case a topological interpretation.

     

The structure of the spectra of Pisot numbers

For q∈(1,2), Erdös, Joó and Komornik studied the set: