scientific article; zbMATH DE number 3311772
From MaRDI portal
Publication:5592263
zbMath0196.02401MaRDI QIDQ5592263
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal set theory (05D05) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx)
Related Items
Obtaining Specified Irreducible Polynomials over Finite Fields, The Geometry of m-Sequences: Three-Valued Crosscorrelations and Quadrics in Finite Projective Geometry, A Canonical Representation of Simple Plant Location Problems and Its Applications, Rings with Subexponential Growth and Irreducible Representations, Unnamed Item, A Statistical Method for Comparison of Two Structures and Its Biological Applications, The number of spanning trees in regular graphs, Finite Projective Planes and a Question about Primes, Translates and Multipliers of Abelian Difference Sets, On a new family of symmetry codes and related new five-designs, On strongly homogeneous tournaments, A new class of enumeration problems, Unnamed Item, Unnamed Item, On polynomial-modular recursive sequences, Enumeration of small nonisomorphic 1-rotational twofold triple systems, Existence Theorems for Matroid Designs, Unnamed Item, Constraint Orbital Branching, Discrepancy bounds for normal numbers generated by necklaces in arbitrary base, On Hadamard Matrices Constructible by Circulant Submatrices, Constructions of Disjoint Steiner Triple Systems, On the rigidity of uniform Roe algebras over uniformly locally finite coarse spaces, The dimension of sums of graphs, Orthogonal partitions and covering of graphs, The Powers of a Maximal Ideal in a Banach Algebra and Analytic Structure, The covering radius of doubled 2-designs in \(2O_ k\), Metric Inequalities and Convexity, Distance-transitive graphs of valency 5, 6 and 7, Factoring Polynomials Over Large Finite Fields, Colouring Steiner quadruple systems, Colouring Steiner quadruple systems, Generalized de Bruijn graphs, Chains of dog-ears for completely positive matrices, Permutation polynomials modulo \(2^w\), Completion and embedding between pseudo (đ,đ,đ)-designs and (đ,đ,đ)-designs, A problem on blocking probabilities in connecting networks, Generalized de Bruijn graphs, On the number of cycles of \(p\)-adic dynamical systems, A small generating set for the 3âBD closed set of block sizesââ„â6, Unnamed Item, Induced representations of reductive ${\germ p}$-adic groups. II. On irreducible representations of ${\rm GL}(n)$, Block designs with large holes and α âresolvable BIBDs, Interspersions and Dispersions, Unnamed Item, Multiple capture of a given number of evaders in the problem of a simple pursuit, Unnamed Item, Maximum Antichains: A Sufficient Condition, Link designs and probability analyses for a class of connecting networks, The Structure of Certain Triple Systems, Experimental Methods for Constructing MDS Matrices of a Special Form, Bounding the rank of certain permutation groups, Bounding the rank of certain permutation groups, Sometimes Only Square Matrices can be Diagonalized, On submultiplicative nonnegative functionals on linear maps of linear finitedimensional normed spaces, Linear mappings preserving the copositive cone, Unnamed Item, Markov processes and random fields, Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks, A symmetric 2â(160, 54, 18) design, Intrinsic characterization of polynomial transformations between vector spaces over a field of characteristic zero, Multiplicative designs I: The normal and reducible cases, On Hadamard embeddabiity, A theorem in combinatorial matrix theory, On the Williamson type j matrices of orders \(4\cdot 29\), \(4\cdot 41\), and \(4\cdot 37\), On asymptotic directions of minimal immersions, Cyclic designs and uniformly deep families, An interconnection of local maps inducing onto global maps, On a variation of the Oberwolfach problem, An algorithm for computing the automorphism group of a Hadamard matrix, A note on David Lubell's article: Local matching in the function space of a partial order, All directed BIBDs with k=3 exist, A skew Room square of order 129, A note on the density of inherently ambiguous context-free languages, On weak permutability between groups, Order 24 Hadamard matrices of character at least 3, The family of t-designs. Part I, Extended (2,4)-designs, Matrices and set intersections, On graphs with given automorphism group, On the mutual embeddability of (2k, k, k-1) and (2k - 1,k,k) quasi- residual designs, Quasi-residual quasi-symmetric designs, Primes in the semigroup of Boolean matrices, On the number of Latin rectangles and chromatic polynomial of L(K//(r,s)), S-quasi-symmetry, Generalized intersection patterns and two-symbol balanced arrays, A general construction for group-divisible designs, On the existence of frames, Generalized k-tuple colorings of cycles and other graphs, Matrices and the linear complementarity problem, Graph factorization, general triple systems, and cyclic triple systems, Construction of balanced doubles schedules, From sets to functions: Three elementary examples, Quotient polytopes of cyclic polytopes. I: Structure and characterization, The existence of symmetric block designs, The existence of Howell designs of odd side, An intersection problem whose extremum is the finite projective space, Latin squares with pairwise orthogonal conjugates, Codes and designs, A survey of nested designs, Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matrices, The power of synchronizing operations on strings, Matching in modular lattices, An extension of the ranked set sampling theory, More generalized packing numbers, Self-dual codes over GF(5), Hadamard matrices and projective planes, Rational G-matrices with rational eigenvalues, Finite linear spaces with a regularity condition on the transversals of two secant lines, Linear programming the global approach, The existence of Howell designs of side n+1 and order 2n, Incidence matrices of t-designs, On orthogonal matrices with constant diagonal, On subdesigns of symmetric designs, Non-skew symmetric orthogonal matrices with constant diagonals, Dual linear extensions of generalised quadrangles, Locally finite weakly minimal theories, Some aspects of the development of linear algebra in the last sixty years, Williamson matrices of orders \(4 \cdot 29\) and \(4 \cdot 31\), On a class of modular lattices, The age of a relational structure, Self-dual codes based on the twin prime product 35, Examples of products giving large graphs with given degree and diameter, Almost all quasigroups have rank 2, A complete classification of symmetric (31, 10, 3) designs, The complexity of reconstructing trees from qualitative characters and subtrees, Completely positive matrices and positivity of least squares solutions, Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings, Modular difference sets, Twofold triple systems and graph imbeddings, A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3, Block designs admitting regular automorphisms, On resolvable balanced incomplete block designs, Another class of balanced graph designs: Balanced circuit designs, On the existence of automorphism free Steiner triple systems, On uniform covers and t-designs, Finite embedding theorems for partial Steiner triple systems, A method of constructing generalized difference sets, On computing the length of longest increasing subsequences, Difference sets and sum-free sets in groups of order 16, Tactical constructions, Ovals in the Desarguesian plane of order 16, Relative difference sets and quasiregular collineation groups, Factor groups of the lower central series for spherical free products, Hadamard matrices from relative difference sets, Uncorrelated minimum-length sequence and its application to parameter estimation, Graphs from projective planes, Ramsey graphs and block designs, Resolvable balanced bipartite designs, Near-Boolean algebras. I: Combinatorial aspects, Hadamard matrices of order 4(2p+1), Affine resolvable balanced incomplete block designs: a survey, A new approach to parallel computing, On the maximal number of pairwise orthogonal Steiner triple systems, The number of distinct latin squares as a group-theoretical constant, Line graphs, root systems, and elliptic geometry, Lower bounds for the size of expressions for certain functions in d-ary logic, A construction for PBIBD(2)'s, A theorem on linear diophantine equations and the paging-complexity of loop-chains, The factors of a design matrix, An asymptotic evaluation of the cycle index of a symmetric group, Some NP-complete problems for hypergraph degree sequences, Finiteness questions in quasi-symmetric designs, Hadamard matrices of order 28 with automorphism groups of order two, On orthogonal arrays of strength 3 and 5 achieving Rao's bound, Concerning the spectrum of perpendicular arrays of triple systems, Improved solutions to the Steiner triple covering problem, Transitive Steiner triple systems of order 25, Combinatorial results on completely positive matrices, Spectral analysis for automorphisms of UHF \(C^*\)-algebras, The difference between \(5\times 5\) doubly nonnegative and completely positive matrices, Constructions and topological invariants of 2-(v,3,\(\lambda\) ) designs with group actions, A directed graph version of strongly regular graphs, Quasi-symmetric designs and self-dual codes, Nonexistence of a regular graph design with \(v=17\) and \(k=6\), Algorithmizing design of a class of combinatorial block diagrams, Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture, Extraneous multipliers of cyclic difference sets, Complete positivity, On the nonuniform Fisher inequality, On twofold triple systems and their automorphism groups, Hussain chains revisited, The complexity of cutting complexes, Retracted article: Discrete optimization method based on Grassmannian parameterization in multidimensional dichotomic data structuring, On a composition of cyclic 2-designs, Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\), The existence of Howell designs of even side, A probabilistic heuristic for a computationally difficult set covering problem, On the 2-adjugate mod 2 class of designs, Designs from pairs of finite fields. I: A cyclic unital U(6) and other regular Steiner 2-designs, Relationship between combinatorics and O-simple semigroups, Ovals in projective designs, t-designs associated with non degenerate conics in a Galois plane of odd order, 2-designs having an intersection number \(k-n\), Klingenberg structures and partial designs I: Congruence relations and solutions, Inradius and circumradius of various convex cones arising in applications, Presentations of finite simple groups: a computational approach., Interiors of completely positive cones, Sufficient conditions to be exceptional, New Hadamard matrix of order 24, Some characterizations of type-1 \(\lambda\)-designs, The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\), Russian doll search for the Steiner triple covering problem, On semigroups of endomorphisms of a chain with restricted range., Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\), A finitely presented monoid which has solvable word problem but has no regular complete presentation, Shortest consistent superstrings computable in polynomial time, Combinatorial analysis of two basic forms of hidden periodicity in categorial sequences, A note on partial Cayley graphs, Characterization of completely positive graphs, A biased random-key genetic algorithm for the Steiner triple covering problem, A note on ``\(5\times 5\) completely positive matrices, Vector representations of graphs, Hadamard decompositions of nearly commutative algebras, Reduction of the Hall-Paige conjecture to sporadic simple groups., A prime-to-\(p\) version of Grothendieck's anabelian conjecture for hyperbolic curves over finite fields of characteristic \(p>0\), Remarques sur deux problĂšmes extrĂ©maux. (Remarks on two extremal problems), A generalization of Connor's inequality to t-designs with automorphisms, A theorem on equidistant codes, A note on reverse Steiner triple systems, Hadamard matrices of order 28\(m\), 36\(m\) and 44\(m\), The spectrum of Room cubes, Resolvable BIBD and SOLS, Premature sets of 1-factors or how not to schedule round robin tournaments, A polynomial rate of growth for the multiplicities in cocharacters of matrices, Matrices and set differences, Exhaustive construction of (255, 127, 63)-cyclic difference sets, A note on subdigraphs of digraphs with large outdegrees, Pairwise balanced designs whose line sizes do not divide six, A Hadamard matrix of order 36, Some techniques for constructing infinite families of BIBD's, Arbres minimaux d'un graphe preordonne, Topological invariants of 2-designs arising from difference families, Hadamard tournaments with transitive automorphism groups, Hadamard matrices of order 28 with automorphisms of order 13, On the geometry of planar difference sets, A special class of Williamson matrices and difference sets, Further properties of generalized residual designs, A new look at the optimal assignment problem, Variations on seven points: An introduction to the scope and methods of coding theory and finite geometries, A Hadamard matrix of order 268, Regular group divisible designs and Bhaskar Rao designs with block size three, Generalized Bhaskar Rao designs, Anti-Hadamard matrices, Nonembeddable quasi-residual designs with large K, A quest for certain linear spaces on thirty points, Generalized Bhaskar Rao designs of block size three, Pseudocyclic 3-class association schemes on 28 points, New proof of a theorem of Szekeres, Hadamard matrices of order 28 with automorphisms of order 7, The (16,6,2) biplane with 60 ovals and the weight distribution of a code, A symmetric BIBD with trivial automorphism group, A note on models of finite geometries arising from difference sets, Additive symmetric bijections on geometric structures, Maximal difference matrices of order \(\leq 10\), Resolvable path designs, On automorphism groups of certain 2-(v,3,2) designs induced by group actions, Isomorphic designs that are not multiplier equivalent, On the cohomology of polycyclic-by-finite groups, Nested group divisible designs and small nested designs, Existence of orthogonal Latin squares with aligned subsquares, On a Sidon-type inequality for discrete orthonormal systems, Cohomology of graded Lie algebras of maximal class, Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits, Crystal growth and Witt rings, Geometria combinatoria e geometrie finite, An extended multiring of diameter 2, Generalizations of broadcasting and gossiping, Problem of multiple capture of given number of evaders in recurrent differential games, Sidon-type inequalities and the space of quasi-continuous functions, The Value of the Two Cable Ambush Game, On classes of graphs determined by forbidden subgraphs, Efficient, local and symmetric Markov chains that generate one-factorizations, On the class of restricted linear information systems, A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs, Unconditional convergence of functional series in problems of probability theory, Polyhedral combinatorics of multi-index axial transportation problems, The Algebraic Geometry of Stresses in Frameworks, A 3-flip neighborhood local search for the set covering problem, (19, 9, 4) Hadamard designs and their residual designs, Covering all triples on n marks by disjoint Steiner systems, Self-orthogonal Steiner systems and projective planes, A property of the hyperplanes of a matroid and an extension of Dilworth's theorem, Random number generation: A combinatorial approach, On resolvable designs. (Reprint), Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), A survey of homogeneous structures, Solving large Steiner Triple Covering Problems, Construction of finite ternary rings, Every 8-uniform 8-regular hypergraph is 2-colorable, The CP-Matrix Approximation Problem, Complementary pivot theory of mathematical programming, Extremal configurations and decomposition theorems. I, An extension of a theorem of the Bruijn and ErdĆs on combinatorial designs, Combinatorial designs and related systems, Two remarks on copositive matrices, An extension of Mann's theorem to a triple of mutually orthogonal latin squares of order 10, On classes of copositive matrices, Positive-definite matrices and their role in the study of the characteristic roots of general matrices, A combinatorial approach to convex quadratic programming, On characterizing certain graphs with four eigenvalues by their spectra, Automorphisms of symmetric balanced incomplete block designs, Equivalence of Hadamard matrices, Multidimensional stochastic matrices and patterns, On a system of operator equations, Some \((1, -1)\) matrices, Steiner systems which admit block transitive automorphism groups of small rank, Essentially doubly stochastic matrices. I: Elements of the theory over arbitrary fields, Modular Hadamard matrices and related designs. I, Amicable Hadamard matrices, Multiple capture of given number of evaders in linear recurrent differential games, Symmetry codes over GF(3) and new five-designs, On the non-existence of a class of configurations which are nearly generalized n-gons, Feedback invariants of linear multivariable systems, Doubly regular tournaments are equivalent to skew Hadamard matrices, Some new symmetric block designs, An infinite class of Williamson matrices, Symmetric designs and related configurations, Integral equivalence of Hadamard matrices, Constructions for balanced Howell rotations for bridge tournaments, On reverse Steiner triple systems, Three mutually orthogonal Latin squares, Incomplete block design codes for ultra high speed computer applications, An extremal problem in the uniform covering of finite sets, Generating balanced incomplete block designs from planar near rings, A simplification of Moore's proof of the existence of Steiner triple systems, Non-isomorphic solutions of some balanced incomplete block designs. II, III, Experimental designs through level reduction of the d-dimensional cuboctahedron, On completely normal (0,1)-matrices and symmetrizability, Skew Hadamard matrices of Goethals-Seidel type, On Room squares of order \(6m+2\), On balanced incomplete block designs with blocks having five elements, Mutually disjoint 5-designs from Pless symmetry codes, On the number of solutions to a Diophantine equation, Block designs with repeated blocks, Graph decompositions, handcuffed prisoners and balanced p-designs, On the existence of a projective plane of order 10, A property of (\(v\),\(k\),\(\lambda\))-designs, Extending symmetric designs, Edmonds polytopes and a hierarchy of combinatorial problems, Simple constructions for balanced incomplete block designs with block size three, Kronecker products and BIBDs, Rearrangements of incidence tables, Addendum to ``The lower central series of groups of a special class, Structured Hadamard Conjecture, Cyclotomy and difference families in elementary Abelian groups, An infinite family of Hadamard matrices of Williamson type, On a distribution problem in finite and countable sets, Configurations arising from maximal arcs, On resolvable designs, Embeddings of Steiner triple systems, Theory of path length distributions. I, A family of difference sets in non-cyclic groups, Some Properties of 0/1-Simplices, Orthogonal bases of involution in Hadamard algebras, Combinatorics associated with inflections and bitangents of plane quartics, Hadamard algebras., Mixed integer models for the stationary case of gas network optimization, On the number of 1-factorizations of a complete graph, Group pursuit with state constraints in Pontryagin's almost periodic example, Generating operator for discrete Chrestenson functions, Classification of Hadamard matrices of order 28, Algebraic nonlinearity and its applications to cryptography, \(k\)-configurations, An upper bound on the number of functions satisfying the strict avalanche criterion, The existence of infinitely many primary trees, Covering with Latin transversals, Non-abelian Hadamard difference sets, Maximin efficiency-robust tests and some extensions, On Srivastava's problems and the properties of Hadamard matrices, Multiple capture of a given number of evaders in the problem of simple pursuit with phase restrictions on timescales, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, On the Dinitz conjecture and related conjectures, Variations on a theorem of Ryser, Two new optimal ternary two-weight codes and strongly regular graphs, Open shop, satellite communication and a theorem by EgervĂĄry (1931), Perfect simplices in \({\mathbb R}^5\), On some measures of complexity of finite abelian groups, Solving hard set covering problems, Zeta function of the category of finite abelian groups, Indecomposable triple systems, Embedding an incomplete diagonal latin square in a complete diagonal latin square, A certain polynomial of a graph and graphs with an extremal number of trees, Nonnegative sum-symmetric matrices and optimal-score partitions, Fano plane's embeddings on compact orientable surfaces, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, PoincarĂ© duality algebras mod two, Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games, On the number of subsets of the residue ring such that the difference of any pair of elements is not invertible, Vector versions of Prony's algorithm and vector-valued rational approximations, Distance graphs with large chromatic numbers and small clique numbers, Chains of subsemigroups, On representing block designs in terms of their automorphisms, Equidistant codes with distance 12, Finite equational bases for finite algebras in a congruence-distributive equational class, On two conjectures of Stanton and Mullin, Block designs with \(v=10\), \(k=5\), \(\lambda=4\), Decomposition of \(K_n\) into circuits of odd length, Balanced incomplete block designs and related designs, Bounds for equidistant codes and partial projective planes, Liouville, computable, Borel normal and Martin-Löf random numbers, On the block structure of BIB designs with parameters \(v=22\), \(b=33\), \(r=12\), \(k=8\), \(\lambda=4\), Binary and ternary signals with small cross correlations, The representations of \(S_n\) and explicit identities for P. I. algebras, Quotients of \(C[0,1\) with separable dual], On embedding triangle-free graphs in unit spheres, A summary of noncylic difference sets, \(k<20\), On difference matrices, resolvable transversal designs and generalized Hadamard matrices, Composition theorems for difference families and regular planes, Maximal sets of Latin squares and partial transversals, A class of three-designs, Conjugate orthogonal quasigroups, Some infinite classes of Hadamard matrices, A new type of combinatorial design, Complex orthogonal designs, Construction of orthogonal latin squares using left neofields, Williamson matrices of order \(4n\) for \(n = 33, 35, 39\), On the structure of regular pairwise balanced designs, Designs et hyperplans, On difference matrices and regular latin squares, On compromising statistical data-bases with a few known elements, Regular Hjelmslev planes, On Steiner spaces, Embeddings on \(S(2,4,v)\), A logic for reasoning about probabilities, MĂ©nage numbers, bijections and P-recursiveness, More balanced incomplete block designs from Frobenius groups, Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras, Bounds on the measurable chromatic number of \({\mathbb{R}}\), Flag algebras of symmetric design, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Some balanced incomplete block designs, Ordinary graphs and subplane partitions, Monomial algebras, Investigations in topology. 9. Work collection, Cores of cooperative games, superdifferentials of functions, and the Minkowski difference of sets, On copositive matrices, An optimal test on finite unavoidable sets of words, Eine Bemerkung zur AbschĂ€tzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren, Cycles of monomial and perturbated monomial \(p\)-adic dynamical systems, The family of t-designs. II, On three-designs of small order, Two classes of \(q\)-ary codes based on group divisible association schemes, Maximal sets of mutually orthogonal Latin squares, An analysis of Monte Carlo algorithm for estimating the permanent, A new upper bound for binary codes with minimum distance four, A direct method to construct triple systems, Affine embeddings of Sylvester-Gallai designs, Concerning the number of mutually orthogonal latin squares, On \(\lambda\)-designs, Once more about 80 Steiner triple systems on 15 points., Induktive Systeme in der Kombinatorik, On the existence of balanced bipartite designs. II, Replication results for certain combinatorial configurations, Block designs with repeated blocks and \((b,r,\lambda)=1\), Principle of inclusion-exclusion on semilattices, Some recent developments on BIBDs and related designs, Linear mappings preserving the completely positive rank, Classification of Hadamard matrices of order 28 with Hall sets, Infinite series of double Youden rectangles, CP rank of completely positive matrices of order 5
