scientific article
From MaRDI portal
Publication:3715120
zbMath0588.05001MaRDI QIDQ3715120
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitionspermutationslinear programminggenerating functionsHadamard matricespermanentsfinite geometriesdifference setsextremal problemsde Bruijn sequencesorthogonal Latin squaresRamsey's theoremrecursionsgraphical methodsinversion formulaecombinationsBlock Designsdistinct representativesCoding Theoryconstructions of block designsconvex-spacesvan der Waerden-conjecture
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx)
Related Items (only showing first 100 items - show all)
Four pairwise orthogonal Latin squares of order 24 ⋮ Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences ⋮ Hamilton-connected derangement graphs on \(S_ n\) ⋮ Optimum experimental designs for comparative bioavailability studies ⋮ On generalized quasi-residual designs ⋮ Note on a problem of Krasikov and Schönheim for planar cyclic difference sets ⋮ The existence of Room 5-cubes ⋮ Sampling plans excluding contiguous units ⋮ Defining sets in vertex colorings of graphs and latin rectangles ⋮ Projective extensions of Kirkman systems as substructures of projective planes ⋮ Toroidal tilings from de Bruijn-Good cyclic sequences ⋮ Steiner triple systems of order 15 and their codes ⋮ High order intersection numbers of \(t\)-designs ⋮ Characters and random walks on finite classical groups ⋮ A polynomial-time algorithm for computing low CP-rank decompositions ⋮ A conjecture on the existence of cyclic Hadamard difference sets ⋮ Complex equiangular cyclic frames and erasures ⋮ Key storage in secure networks ⋮ Copositive matrices and Simpson's paradox ⋮ Linear codes and the existence of a reversible Hadamard difference set in \(\mathbb{Z}_ 2\times \mathbb{Z}_ 2\times \mathbb{Z}_ 5^ 4\) ⋮ The combinatorics of discrete self-similarity ⋮ New classes of residue supplementary difference systems ⋮ New cyclic difference sets with Singer parameters ⋮ Constructive bounds for a Ramsey-type problem ⋮ On the double competition number ⋮ A graph-theoretic result for a model of neural computation ⋮ Semigroups of matrices of intermediate growth. ⋮ Normally regular digraphs ⋮ A communication problem and directed triple systems ⋮ The codes and the lattices of Hadamard matrices ⋮ Binary matrices ⋮ Difference sets and doubly transitive actions on Hadamard matrices ⋮ Weighted and roughly weighted simple games ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ Codes and matrices in studies on designs ⋮ Minimally projectively embeddable Steiner systems ⋮ The Steiner systems S(2,4,25) with nontrivial automorphism group ⋮ Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. ⋮ Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs ⋮ A Cartesian product construction for unconditionally secure authentication codes that permit arbitration ⋮ General constructions of \(c\)-Bhaskar Rao designs and the \((c,\lambda)\) spectrum of a \(c\)-BRD\((v,k,\lambda)\) ⋮ Enumerating Boolean functions of cryptographic significance ⋮ Extremal doubly-even codes of length 64 derived from symmetric designs ⋮ The commutative ring of a symmetric design ⋮ Further results on optimal optical orthogonal codes with weight 4. ⋮ Learning by matching patterns. ⋮ A double affine plane of order 6 ⋮ Configurations in projective planes and quadrilateral-star Ramsey numbers ⋮ \((i,j)\) competition graphs ⋮ On the classification of ideal secret sharing schemes ⋮ Some non-isomorphic \((4t+4,8t+6,4t+3,2t+2,2t+1)\)-BIBD's ⋮ Codes and designs -- existence and uniqueness ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ On symmetric and quasi-symmetric designs with the symmetric difference property and their codes ⋮ Quasi-symmetric designs with \(y = \lambda{}\) ⋮ Some perpendicular arrays for arbitrarily large \(t\) ⋮ \(\{0,1\}\) completely positive tensors and multi-hypergraphs ⋮ Sign patterns of nonnegative normal matrices ⋮ Character tables of association schemes of affine type ⋮ Generalizations of Bose's equivalence between complete sets of mutually orthogonal Latin squares and affine planes ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ Halving Steiner triple systems ⋮ A note about multidesigns and extended designs ⋮ Petersen hypergraphs! Moore hypergraphs? ⋮ Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes ⋮ Some infinite classes of special Williamson matrices and difference sets ⋮ One factors and the existence of affine designs ⋮ Constructions of nested group divisible designs ⋮ Hanani triple systems ⋮ Proof of a conjecture on Hadamard 2-groups ⋮ On the Cameron-Praeger conjecture ⋮ Self-dual codes over the integers modulo 4 ⋮ Extremal self-dual codes from symmetric designs ⋮ On the \((v,5,\lambda)\)-family of Bhaskar Rao designs ⋮ On non-Abelian group difference sets ⋮ An infinite family of Goethals-Seidel arrays ⋮ Spectral theory of copositive matrices ⋮ Some 20-regular CDP(5,1;20\(u\)) and their applications ⋮ Newton polyhedra of discriminants of projections ⋮ Concentration of symmetric eigenfunctions ⋮ Cyclotomy over products of finite fields and combinatorial applications ⋮ The integer nucleolus of directed simple games: a characterization and an algorithm ⋮ Hadamard matrices of Williamson type: A challenge for computer algebra ⋮ New designs with block size 7 ⋮ Optimality of a class of efficiency-balanced designs ⋮ Difference sets and intercalation pairs ⋮ The existence of circular Florentine arrays ⋮ Hessian orders and multinormal distributions ⋮ A survey on interval routing ⋮ The cycle completable graphs for the completely positive and doubly nonnegative completion problems ⋮ Computing partial information out of intractable: powers of algebraic numbers as an example ⋮ Some combinatorial constructions for optical orthogonal codes ⋮ On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\) ⋮ \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions ⋮ A new heap game ⋮ Signed domination in regular graphs and set-systems ⋮ Hypercubes, shuffle-exchange graphs and de Bruijn digraphs ⋮ On the existence of small quasimultiples of affine and projective planes of arbitrary order ⋮ Local majorities, coalitions and monopolies in graphs: A review ⋮ A general construction for optimal cyclic packing designs
This page was built for publication:
