scientific article; zbMATH DE number 51878

MaRDI QIDQ4002255zbMATH OpenFDO

Authors Richard M. Wilson, Jack van Lint

Publication date 23 January 1993

Cited in

(only showing first 100 items - show all)

Designs from subcode supports of linear codes
Ring geometries, two-weight codes, and strongly regular graphs
Decimations of languages and state complexity
Error graphs and the reconstruction of elements in groups
Linear CNF formulas and satisfiability
Some characterizations of strongly regular graphs
Asymptotic behavior of the numbers of runs and microruns
Runge-Kutta methods for quadratic ordinary differential equations
Decompositions of complete multigraphs related to Hadamard matrices
Generalized binomial coefficients and the subset-subspace problem
Bose-Mesner algebras related to type II matrices and spin models
Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
The combinatorics of effective resistances and resistive inverses
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
Signed domination in regular graphs and set-systems
On normal matrices of zeros and ones with fixed row sum
The effective length of subcodes
The Narayana distribution
The maximum determinant of \(\pm 1\) matrices
Order preserving assignments without contiguity
Mappings of Latin squares
Stage-graph representations
A note on the equation \(\theta\overline{\theta}=n+\lambda\Sigma\)
The combinatorics of discrete self-similarity
On the number of blocks in a generalized Steiner system
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
Decompositions of complete multigraphs derived from Hadamard matrices
Binary matrices
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
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.
A note on the Stirling matrix of the second kind.
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
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
Quadratic double circulant codes over fields
The parameters of bipartite \(Q\)-polynomial distance-regular graphs
The polytope of degree sequences of hypergraphs
Colored ray configurations
On the purity of minor-closed classes of graphs
Using Catalan words and a \(q\)-shuffle algebra to describe a PBW basis for the positive part of \(U_q(\widehat{\mathfrak{sl}}_2)\)
\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
The product rule in \(\kappa ^*({\mathcal {M}}_{g,n}^{ct})\)
Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting
Residual \(q\)-Fano planes and related structures
A new approach for examining \(q\)-Steiner systems
A note on the reducibility of special infinite series
Equivalence classes of matchings and lattice-square designs
The combinatorics of Dom de Caen
Random planar graphs
On arc-regular permutation groups using Latin squares
Higher power residue codes and the Leech lattice
On the size of the minimum critical set of a Latin square
Liouville, computable, Borel normal and Martin-Löf random numbers
Orthogonal decomposition and packing of complete graphs
Fissions of classical self-dual association schemes
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
Intersection properties for coverings of \(G\)-spaces
Information matrices with random regressors. Application to experimental design
On the number of arcs in primitive digraphs with large exponents
On the number of cycles in generalized Kautz digraphs
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
Equidistant families of sets
Hamilton cycles and eigenvalues of graphs
A candidate for the ``Next Fermat Problem
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
Generalizing Sperner's lemma to a free module over a special principal ideal ring
Combinatorial identities related to eigen-function decompositions of Hill operators: open questions
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs
A new class of modified Bernstein operators
Intersecting designs
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
Wiener index and addressing of the total graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002255)