On t-designs

zbMath0342.05018MaRDI QIDQ1231915

Richard M. Wilson, Ray-Chaudhuri, Dijen K.

Publication date: 1975

Published in: Osaka Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items (only showing first 100 items - show all)

On the Structure oft-Designs ⋮ Design theory from the viewpoint of algebraic combinatorics ⋮ A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design ⋮ Fractional cross intersecting families ⋮ Probabilistic existence of regular combinatorial structures ⋮ Threefold triple systems with nonsingular \(N_2\) ⋮ A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\) ⋮ Harmonic Tutte polynomials of matroids ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Schematic 4-designs ⋮ Avoiding right angles and certain Hamming distances ⋮ Intersecting families with sunflower shadows ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Higher incidence matrices and tactical decomposition matrices ⋮ Maximal fractional cross-intersecting families ⋮ Euclidean designs obtained from spherical embedding of coherent configurations ⋮ Dual incidences and t‐designs in vector spaces ⋮ Bounds on sets with few distances ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number ⋮ The absolute bound for coherent configurations ⋮ Almost-Fisher families ⋮ On the number of zero-patterns of a sequence of polynomials ⋮ Almost-Fisher families ⋮ A census of highly symmetric combinatorial designs ⋮ Sunflowers and -intersecting families ⋮ Measurable sets with excluded distances ⋮ Extremal case of Frankl-Ray-Chaudhuri-Wilson inequality ⋮ Intersection Numbers For Subspace Designs ⋮ Unnamed Item ⋮ Set systems with restricted intersections modulo prime powers ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Around Borsuk's hypothesis ⋮ Bounds on the Maximum Number of Vectors with given Scalar Products ⋮ An Upper Bound for Weak $B_k$-Sets ⋮ Regular intersecting families ⋮ A recursive construction of t -wise uniform permutations ⋮ A survey of some problems in combinatorial designs - a matrix approach ⋮ Modular and fractional \(L\)-intersecting families of vector spaces ⋮ All rationals occur as exponents ⋮ 5-designs with three intersection numbers ⋮ A new proof of several inequalities on codes and sets ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Equidistant families of sets ⋮ An incidence algebra for t-designs with automorphisms ⋮ Sharp sets of permutations ⋮ On a restricted cross-intersection problem ⋮ Properties of certain multi-angle tight frames in \(\mathbb{R}^d\) ⋮ A common generalization to theorems on set systems with \(\mathcal L\)-intersections ⋮ On block-transitive designs with affine automorphism group ⋮ High order intersection numbers of \(t\)-designs ⋮ Quasi-symmetric 2,3,4-designs ⋮ Inequalities for quasisymmetric designs ⋮ Nonexistence results for tight block designs ⋮ Intersection families and Snevily's conjecture ⋮ Fisher type inequalities for Euclidean t-designs ⋮ An improved universal bound for \(t\)-intersecting families ⋮ On the existence of tight relative 2-designs on binary Hamming association schemes ⋮ Block-transitive automorphism groups on 2-designs with block size 4 ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ On set intersections ⋮ \(t{1\over 2}\)-designs ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On weighted zero-sum sequences ⋮ The family of t-designs. Part I ⋮ Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems ⋮ A new short proof of the EKR theorem ⋮ Extremal problems and coverings of the space ⋮ On the existence of certain optimal self-dual codes with lengths between 74 and 116 ⋮ Triangle-free Hamiltonian Kneser graphs ⋮ An intersection problem whose extremum is the finite projective space ⋮ An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs ⋮ Nonexistence of block-transitive 6-designs ⋮ A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ Incidence matrices of t-designs ⋮ On tight 4-designs in Hamming association schemes ⋮ Extremal set systems with restricted \(k\)-wise intersections. ⋮ Intersection theorems with geometric consequences ⋮ Note on the tight relative 2-designs on \(H(n,2)\) ⋮ The maximum size of intersecting and union families of sets ⋮ A sharpening of Fisher's inequality ⋮ \(t\)-designs with few intersection numbers ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ Parametric restrictions on quasi-symmetric designs ⋮ Nonexistence of nontrivial tight 8-designs ⋮ Inequalities and bounds for quasi-symmetric 3-designs ⋮ Block-transitive \(t\)-designs. I: Point-imprimitive designs ⋮ Extremal numbers for directed hypergraphs with two edges ⋮ A recursive method for construction of designs ⋮ On minimally \(k\)-connected matroids ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version ⋮ Fractional \(L\)-intersecting families ⋮ A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd ⋮ Cross \(\mathcal L\)-intersecting families on set systems ⋮ On the Cameron-Praeger conjecture

This page was built for publication: On t-designs