scientific article

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

partitions combinatorics generating functions Latin squares Hadamard matrices networks extremal graphs embeddings graphs designs colorings Ramsey's theorem codes introduction projective geometries combinatorial geometries Dilworth's theorem van der Waerden conjecture

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Designs and configurations (05Bxx)

Related Items

Superposition of zeros of distinct L-functions, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, CMV: The unitary analogue of Jacobi matrices, Orthomorphisms and the construction of projective planes, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Approximation of a free Poisson process by systems of freely independent particles, Minimal systems of binomial generators and the indispensable complex of a toric ideal, A note on commutators in compact semisimple Lie algebras, Weighted subspace designs from \(q\)-polymatroids, Unnamed Item, Star partitions and the graph isomorphism problem, Some upper bounds for permanents of (0, 1)-matrices, Equitable partition for some Ramanujan graphs, On the number of vertices of the stochastic tensor polytope, Covering by complements of subspaces, Unnamed Item, Not So Many Runs in Strings, A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption, A new approach to the theory of classical hypergeometric polynomials, Extremal problems in Minkowski space related to minimal networks, Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture, Alternate product adjacencies in digital topology, The lattice of integral flows and the lattice of integral cuts on a finite graph, Encryption schemes using orthogonal arrays, Optimal shooting: Characterizations and applications, Nonstandard rank-one nonincreasing maps on symmetric matrices, Universal Associative Envelopes of Nonassociative Triple Systems, Intersecting balanced families of sets, Finite posets and Ferrers shapes, Zero correlation with lower-order terms for automorphic L-functions, Code equivalence characterizes finite Frobenius rings, Exact spectra of conformal supersymmetric nonlinear sigma models in two dimensions, EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS, Conference matrices and unimodular lattices, On the optimum of Delsarte's linear program, Integer Programming for Classifying Orthogonal Arrays, An exact algorithm for the subset sum problem, An alternate description of a (q + 1, 8)-cage, The General Local Form of an Analytic Mapping into the Set of Idempotent Elements of a Banach Algebra, The scaling mean and a law of large permanents, Boundary partitions in trees and dimers, On partitions of the q‐ary Hamming space into few spheres, Enumerating extreme points of the polytopes of stochastic tensors: an optimization approach, Growth in Baumslag–Solitar groups II: The Bass–Serre tree, Maximal commutative subalgebras of a Grassmann algebra, Inversion Of A Generalized Vandermonde Matrix, Unnamed Item, Unnamed Item, Unnamed Item, Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations, A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs, Unnamed Item, A combinatorial approach for studying local operations and classical communication transformations of multipartite states, Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements, On the number of cycles in generalized Kautz digraphs, Order-unit quantum Gromov--Hausdorff distance, Prym varieties associated to graphs, Addressing the Petersen graph, On the construction of perfect deletion-correcting codes using design theory, The geometry of graphs and some of its algorithmic applications, On the number of go positions on lattice graphs, Extremum problems for eigenvalues of discrete Laplace operators, Equidistant families of sets, Hamilton cycles and eigenvalues of graphs, Supersymmetry and combinatorics, Exponential growth and an asymptotic formula for the ranks of homotopy groups of a finite 1-connected complex, A candidate for the ``Next Fermat Problem, Half-regular factorizations of the complete bipartite graph, Zeros of principal \(L\)-functions and random matrix theory, The maximum number of odd integral distances between points in the plane, Bell numbers and \(k\)-trees, Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials, MV-algebra for cultural rules, Generalizing Sperner's lemma to a free module over a special principal ideal ring, Tight bounds for eternal dominating sets in graphs, Counting matrices over finite fields having a given number of rows of unit weight, Colored ray configurations, Combinatorial identities related to eigen-function decompositions of Hill operators: open questions, Linear programming bounds for balanced arrays, Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile, XSAT and NAE-SAT of linear CNF classes, On the vertices of the \(d\)-dimensional Birkhoff polytope, Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs, A new class of modified Bernstein operators, On the purity of minor-closed classes of graphs, On the number of zero-patterns of a sequence of polynomials, Intersecting designs, Using Catalan words and a \(q\)-shuffle algebra to describe a PBW basis for the positive part of \(U_q(\widehat{\mathfrak{sl}}_2)\), Linear groupoids and the associated wreath products., Strengthening the Gilbert-Varshamov bound, The distribution of spacings between quadratic residues, Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets, Compact data structures for Dedekind groups and finite rings, The Polytope ofm-Subspaces of a Finite Affine Space, \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets, The product rule in \(\kappa ^*({\mathcal {M}}_{g,n}^{ct})\), Wiener index and addressing of the total graph, Results on rotation symmetric polynomials over \(GF(p)\), An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times, Triangle-free distance-regular graphs, Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting, An analysis of the (colored cubes)\(^{3}\) puzzle, Covering of subspaces by subspaces, Residual \(q\)-Fano planes and related structures, A new approach for examining \(q\)-Steiner systems, Linear-time option pricing algorithms by combinatorics, Clique coverings and partitions of line graphs, A note on the reducibility of special infinite series, Difference equations with delay, Sharpening the Gilbert-Varshamov bound in the finite case, Hamming graphs and special LCD codes, Equivalence classes of matchings and lattice-square designs, Bipartite graphs whose squares are not chromatic-choosable, Random planar graphs, Some new evaluations of the Tutte polynomial, On arc-regular permutation groups using Latin squares, Higher power residue codes and the Leech lattice, Protochirons and protohelices, On the size of the minimum critical set of a Latin square, A classification of the structures of some Sperner families and superimposed codes, Algorithmic combinatorics based on slicing posets, Liouville, computable, Borel normal and Martin-Löf random numbers, Enumerating partial linear transformations in a similarity class, Affinity and fluctuations in a mesoscopic noria, The general position problem on Kneser graphs and on some graph operations, When-and how-can a cellular automaton be rewritten as a lattice gas?, Hypomorphy of graphs up to complementation, A note on triangle-free distance-regular graphs with \(a_2\neq 0\), Orthogonal decomposition and packing of complete graphs, Fissions of classical self-dual association schemes, Partition-balanced families of codes and asymptotic enumeration in coding theory, Discrepancy of high-dimensional permutations, Group testing with geometry of classical groups over finite fields, Incomplete character sums and a special class of permutations, Steinitz classes of unimodular lattices, Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets, Designs, Groups and Computing, R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences, Equivalent finite fuzzy sets and Stirling numbers, Speech recognition by composition of weighted finite automata, A combinatorial problem associated with nonograms, A survey on modular Hadamard matrices, High connectivity keeping sets in graphs and digraphs, Octonion multiplication and Heawood's map, Trace-minimal graphs and D-optimal weighing designs, Families of sets not belonging to algebras and combinatorics of finite sets of ultrafilters, Extensions of the critical theorem, Systems of random equations over finite algebraic structures, Intersection properties for coverings of \(G\)-spaces, The parameters of bipartite \(Q\)-polynomial distance-regular graphs, Information matrices with random regressors. Application to experimental design, On the number of arcs in primitive digraphs with large exponents, The polytope of degree sequences of hypergraphs, The effective length of subcodes, Maintaining transitive closure in first order after node-set and edge-set deletions, On computing the number of Latin rectangles, The Narayana distribution, Statistics for phylogenetic trees, The maximum determinant of \(\pm 1\) matrices, A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime, Order preserving assignments without contiguity, Constructions and bounds for mixed-dimension subspace codes, Combinatorics of counting finite fuzzy subsets, \(\text{ALR}^n\): accelerated higher-order logistic regression, \(r\)-strong edge colorings of graphs, 5-chromatic strongly regular graphs, Mappings of Latin squares, Stage-graph representations, Probabilistic extensions of the Erdős-Ko-Rado property, A note on the equation \(\theta\overline{\theta}=n+\lambda\Sigma\), Low-lying zeros of quadratic Dirichlet \(L\)-functions, hyper-elliptic curves and random matrix theory, The combinatorics of discrete self-similarity, On the number of blocks in a generalized Steiner system, The limitations of nice mutually unbiased bases, Hadwiger's conjecture for powers of cycles and their complements, Hadamard tensors and lower bounds on multiparty communication complexity, How does Sudoku acquire integral eigenvalues?, A characterization of Delsarte's linear programming bound as a ratio bound, Gray code for permutations with a fixed number of cycles, A worst-case analysis of the LZ2 compression algorithm, A \(q\)-analog of approximation inclusion-exclusion, Bounded capacity priority queues, Symbolic operators for multiple sums, On the number of tilings of a square by rectangles, Decompositions of complete multigraphs derived from Hadamard matrices, Binary matrices, An equivalence of Ward's bound and its application, An invariant for matrices and sets of points in prime characteristic, On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial., An upper bound for the number of planar lattice triangulations, Combinatorial optimization in geometry, Coloring the square of graphs whose maximum average degree is less than 4, Some notes on the combinatorial properties of haplotype tagging, Least squares isotonic regression in two dimensions, On a connection between the Pascal, Vandermonde and Stirling matrices. I., Explicit inverse of a generalized Vandermonde matrix., New Nordhaus-Gaddum-type results for the Kirchhoff index, Regular LDPC codes from semipartial geometries, A note on the Stirling matrix of the second kind., Spectral hypergraph theory of the adjacency hypermatrix and matroids, Random planar graphs with bounds on the maximum and minimum degrees, Clique partitions of distance multigraphs, New recurrence algorithms for the nonclassic Adomian polynomials, An upper bound on the number of high-dimensional permutations, Proof of a conjectural supercongruence, Conditions for the existence of spreads in projective Hjelmslev spaces, Vertex coloring acyclic digraphs and their corresponding hypergraphs, Spreads in strongly regular graphs, Lower bounds for the transition complexity of NFAs, Inclusion of forbidden minors in random representable matroids, A Kruskal-Katona type theorem for graphs, Partition arguments in multiparty communication complexity, Enumeration of viral capsid assembly pathways: tree orbits under permutation group action, On \(J_{m}\)-Hadamard matrices, New families of graphs without short cycles and large size, The permanent of a square matrix, Finite state complexity, Pólya distributions, combinatorial identities, and generalized stirling numbers, More on pooling spaces, Approximating reals by sums of rationals, Designs from subcode supports of linear codes, Ring geometries, two-weight codes, and strongly regular graphs, A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers, Runge-Kutta methods for quadratic ordinary differential equations, Decimations of languages and state complexity, Decompositions of complete multigraphs related to Hadamard matrices, Generalized binomial coefficients and the subset-subspace problem, Error graphs and the reconstruction of elements in groups, Bose-Mesner algebras related to type II matrices and spin models, Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution, Linear CNF formulas and satisfiability, Some characterizations of strongly regular graphs, The combinatorics of effective resistances and resistive inverses, A score test for linkage using identity by descent data from sibships, Difference sets and intercalation pairs, Contrast-optimal k out of n secret sharing schemes in visual cryptography, Asymptotic behavior of the numbers of runs and microruns, Most Latin squares have many subsquares, Graphical \(t\)-designs via polynomial Kramer-Mesner matrices, Kinematic formulas for finite lattices, On the rooted Tutte polynomial, Tree and forest weights and their application to nonuniform random graphs, A characterization of uniquely vertex colorable graphs using minimal defining sets, Maximal sets of mutually orthogonal Latin squares, Counting stable sets on Cartesian products of graphs, On graphs with three eigenvalues, Cluster size distributions of economic agents of many types in a market, A Möbius identity arising from modularity in a matroid bilinear form, Signed domination in regular graphs and set-systems, On normal matrices of zeros and ones with fixed row sum, Quadratic double circulant codes over fields, Finite state incompressible infinite sequences, Some colouring problems for Paley graphs