scientific article

From MaRDI portal
Revision as of 00:58, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4002255

zbMath0769.05001MaRDI QIDQ4002255

Richard M. Wilson, J. H. van Lint

Publication date: 23 January 1993


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



Related Items (only showing first 100 items - show all)

Superposition of zeros of distinct L-functionsTrade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key DistributionCMV: The unitary analogue of Jacobi matricesOrthomorphisms and the construction of projective planesGraphical Models and Message-Passing Algorithms: Some Introductory LecturesApproximation of a free Poisson process by systems of freely independent particlesMinimal systems of binomial generators and the indispensable complex of a toric idealA note on commutators in compact semisimple Lie algebrasWeighted subspace designs from \(q\)-polymatroidsUnnamed ItemStar partitions and the graph isomorphism problemSome upper bounds for permanents of (0, 1)-matricesEquitable partition for some Ramanujan graphsOn the number of vertices of the stochastic tensor polytopeCovering by complements of subspacesUnnamed ItemNot So Many Runs in StringsA Novel Quasigroup Substitution Scheme for Chaos Based Image EncryptionA new approach to the theory of classical hypergeometric polynomialsExtremal problems in Minkowski space related to minimal networksDerangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjectureAlternate product adjacencies in digital topologyThe lattice of integral flows and the lattice of integral cuts on a finite graphEncryption schemes using orthogonal arraysOptimal shooting: Characterizations and applicationsNonstandard rank-one nonincreasing maps on symmetric matricesUniversal Associative Envelopes of Nonassociative Triple SystemsIntersecting balanced families of setsFinite posets and Ferrers shapesZero correlation with lower-order terms for automorphic L-functionsCode equivalence characterizes finite Frobenius ringsExact spectra of conformal supersymmetric nonlinear sigma models in two dimensionsEXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETSConference matrices and unimodular latticesOn the optimum of Delsarte's linear programInteger Programming for Classifying Orthogonal ArraysAn exact algorithm for the subset sum problemAn alternate description of a (q + 1, 8)-cageThe General Local Form of an Analytic Mapping into the Set of Idempotent Elements of a Banach AlgebraThe scaling mean and a law of large permanentsBoundary partitions in trees and dimersOn partitions of the q‐ary Hamming space into few spheresEnumerating extreme points of the polytopes of stochastic tensors: an optimization approachGrowth in Baumslag–Solitar groups II: The Bass–Serre treeMaximal commutative subalgebras of a Grassmann algebraInversion Of A Generalized Vandermonde MatrixUnnamed ItemUnnamed ItemUnnamed ItemAtomicity and Well Quasi-Order for Consecutive Orderings on Words and PermutationsA Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial DesignsUnnamed ItemA combinatorial approach for studying local operations and classical communication transformations of multipartite statesBounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangementsOn the number of cycles in generalized Kautz digraphsOrder-unit quantum Gromov--Hausdorff distancePrym varieties associated to graphsAddressing the Petersen graphOn the construction of perfect deletion-correcting codes using design theoryThe geometry of graphs and some of its algorithmic applicationsOn the number of go positions on lattice graphsExtremum problems for eigenvalues of discrete Laplace operatorsEquidistant families of setsHamilton cycles and eigenvalues of graphsSupersymmetry and combinatoricsExponential growth and an asymptotic formula for the ranks of homotopy groups of a finite 1-connected complexA candidate for the ``Next Fermat ProblemHalf-regular factorizations of the complete bipartite graphZeros of principal \(L\)-functions and random matrix theoryThe maximum number of odd integral distances between points in the planeBell numbers and \(k\)-treesQuasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomialsMV-algebra for cultural rulesGeneralizing Sperner's lemma to a free module over a special principal ideal ringTight bounds for eternal dominating sets in graphsCounting matrices over finite fields having a given number of rows of unit weightColored ray configurationsCombinatorial identities related to eigen-function decompositions of Hill operators: open questionsLinear programming bounds for balanced arraysSome relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profileXSAT and NAE-SAT of linear CNF classesOn the vertices of the \(d\)-dimensional Birkhoff polytopeOptimal transmission schedules for lightwave networks embedded with de Bruijn graphsA new class of modified Bernstein operatorsOn the purity of minor-closed classes of graphsOn the number of zero-patterns of a sequence of polynomialsIntersecting designsUsing 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 boundThe distribution of spacings between quadratic residuesOrderly generation of half regular symmetric designs via Rahilly families of pre-difference setsCompact data structures for Dedekind groups and finite ringsThe Polytope ofm-Subspaces of a Finite Affine Space\((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsetsThe product rule in \(\kappa ^*({\mathcal {M}}_{g,n}^{ct})\)Wiener index and addressing of the total graphResults on rotation symmetric polynomials over \(GF(p)\)An efficient algorithm for multi-hoist cyclic scheduling with fixed processing timesTriangle-free distance-regular graphs







This page was built for publication: