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)

Covering of subspaces by subspaces
Exponential growth and an asymptotic formula for the ranks of homotopy groups of a finite 1-connected complex
An analysis of the (colored cubes)\(^{3}\) puzzle
On normal matrices of zeros and ones with fixed row sum
Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
scientific article; zbMATH DE number 1446461 (Why is no real title available?)
MV-algebra for cultural rules
Zero correlation with lower-order terms for automorphic L-functions
Enumerating extreme points of the polytopes of stochastic tensors: an optimization approach
A combinatorial approach for studying local operations and classical communication transformations of multipartite states
Wiener index and addressing of the total graph
Orthogonal decomposition and packing of complete graphs
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Intersecting designs
Most Latin squares have many subsquares
Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
Linear programming bounds for balanced arrays
The scaling mean and a law of large permanents
Finite state incompressible infinite sequences
Bell numbers and \(k\)-trees
Addressing the Petersen graph
The distribution of spacings between quadratic residues
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
scientific article; zbMATH DE number 3299758 (Why is no real title available?)
A combinatorial problem associated with nonograms
R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
The parameters of bipartite \(Q\)-polynomial distance-regular graphs
Speech recognition by composition of weighted finite automata
On the Touchard polynomials and multiplicative plane partitions
Contrast-optimal k out of n secret sharing schemes in visual cryptography
New Nordhaus-Gaddum-type results for the Kirchhoff index
Decompositions of complete multigraphs derived from Hadamard matrices
Random planar graphs with bounds on the maximum and minimum degrees
On the number of tilings of a square by rectangles
Using Catalan words and a \(q\)-shuffle algebra to describe a PBW basis for the positive part of \(U_q(\widehat{\mathfrak{sl}}_2)\)
Finite posets and Ferrers shapes
Families of sets not belonging to algebras and combinatorics of finite sets of ultrafilters
Proof complexity and the binary encoding of combinatorial principles
Construction of self dual codes from graphs
The maximum determinant of \(\pm 1\) matrices
Inversion Of A Generalized Vandermonde Matrix
Partition arguments in multiparty communication complexity
Enumeration of viral capsid assembly pathways: tree orbits under permutation group action
Liouville, computable, Borel normal and Martin-Löf random numbers
More on pooling spaces
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting
scientific article; zbMATH DE number 4081562 (Why is no real title available?)
Some notes on the combinatorial properties of haplotype tagging
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
The product rule in \(\kappa ^*({\mathcal {M}}_{g,n}^{ct})\)
A characterization of Delsarte's linear programming bound as a ratio bound
On the number of zero-patterns of a sequence of polynomials
Finite state complexity
Vertex coloring acyclic digraphs and their corresponding hypergraphs
A q-analog of approximation inclusion-exclusion
On the number of vertices of the stochastic tensor polytope
An upper bound on the number of high-dimensional permutations
On the number of go positions on lattice graphs
On \(J_{m}\)-Hadamard matrices
Some colouring problems for Paley graphs
Runge-Kutta methods for quadratic ordinary differential equations
Decompositions of complete multigraphs related to Hadamard matrices
An upper bound for the number of planar lattice triangulations
5-chromatic strongly regular graphs
Triangle-free distance-regular graphs
An alternate description of a \((q + 1, 8)\)-cage
The polytope of degree sequences of hypergraphs
Octonion multiplication and Heawood's map
Lectures on advances in combinatorics
Affinity and fluctuations in a mesoscopic noria
On the number of blocks in a generalized Steiner system
A note on triangle-free distance-regular graphs with \(a_2\neq 0\)
Discrepancy of high-dimensional permutations
Hamming graphs and special LCD codes
Linear groupoids and the associated wreath products.
Extremal problems in Minkowski space related to minimal networks
Compact data structures for Dedekind groups and finite rings
On the size of the minimum critical set of a Latin square
Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
The combinatorics of effective resistances and resistive inverses
EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS
Maintaining transitive closure in first order after node-set and edge-set deletions
An exact algorithm for the subset sum problem
scientific article; zbMATH DE number 686998 (Why is no real title available?)
A note on the Stirling matrix of the second kind.
Orthomorphisms and the construction of projective planes
New recurrence algorithms for the nonclassic Adomian polynomials
Designs, groups and computing
Lower bounds for the transition complexity of NFAs
Residual \(q\)-Fano planes and related structures
New families of graphs without short cycles and large size
Generalized binomial coefficients and the subset-subspace problem
Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution
Decimations of languages and state complexity
A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
Trace-minimal graphs and D-optimal weighing designs
Least squares isotonic regression in two dimensions
The effective length of subcodes

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)