scientific article; zbMATH DE number 51878
From MaRDI portal
Publication:4002255
Cited in
(only showing first 100 items - show all)- A combinatorial approach for studying local operations and classical communication transformations of multipartite states
- Hamilton cycles and eigenvalues of graphs
- Random planar graphs
- The combinatorics of Dom de Caen
- A characterization of Delsarte's linear programming bound as a ratio bound
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- Not So Many Runs in Strings
- Some new evaluations of the Tutte polynomial
- On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial.
- New Nordhaus-Gaddum-type results for the Kirchhoff index
- Generalized binomial coefficients and the subset-subspace problem
- Conference matrices and unimodular lattices
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- Ring geometries, two-weight codes, and strongly regular graphs
- \(r\)-strong edge colorings of graphs
- Pólya distributions, combinatorial identities, and generalized stirling numbers
- Some colouring problems for Paley graphs
- Families of sets not belonging to algebras and combinatorics of finite sets of ultrafilters
- New families of graphs without short cycles and large size
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Random planar graphs with bounds on the maximum and minimum degrees
- Finite state complexity
- Boundary partitions in trees and dimers
- Vertex coloring acyclic digraphs and their corresponding hypergraphs
- Signed domination in regular graphs and set-systems
- Quadratic double circulant codes over fields
- Inversion Of A Generalized Vandermonde Matrix
- On the number of tilings of a square by rectangles
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- A Kruskal-Katona type theorem for graphs
- A \(q\)-analog of approximation inclusion-exclusion
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- Decimations of languages and state complexity
- Tight bounds for eternal dominating sets in graphs
- More on pooling spaces
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements.
- Extremal problems in Minkowski space related to minimal networks
- Low-lying zeros of quadratic Dirichlet \(L\)-functions, hyper-elliptic curves and random matrix theory
- A new approach to the theory of classical hypergeometric polynomials
- Hadamard tensors and lower bounds on multiparty communication complexity
- CMV: The unitary analogue of Jacobi matrices
- The polytope of degree sequences of hypergraphs
- Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
- Statistics for phylogenetic trees
- 5-chromatic strongly regular graphs
- The permanent of a square matrix
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- Exact spectra of conformal supersymmetric nonlinear sigma models in two dimensions
- On a connection between the Pascal, Vandermonde and Stirling matrices. I.
- A classification of the structures of some Sperner families and superimposed codes
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- Difference sets and intercalation pairs
- Finite posets and Ferrers shapes
- Least squares isotonic regression in two dimensions
- The effective length of subcodes
- Steinitz classes of unimodular lattices
- A candidate for the ``Next Fermat Problem
- On graphs with three eigenvalues
- Spreads in strongly regular graphs
- The geometry of graphs and some of its algorithmic applications
- Code equivalence characterizes finite Frobenius rings
- Intersection properties for coverings of \(G\)-spaces
- An upper bound on the number of high-dimensional permutations
- Lectures on advances in combinatorics
- Explicit inverse of a generalized Vandermonde matrix.
- A course in combinatorics.
- A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime
- Constructions and bounds for mixed-dimension subspace codes
- On the vertices of the \(d\)-dimensional Birkhoff polytope
- Regular LDPC codes from semipartial geometries
- On the size of the minimum critical set of a Latin square
- Hypomorphy of graphs up to complementation
- scientific article; zbMATH DE number 3935040 (Why is no real title available?)
- \(\text{ALR}^n\): accelerated higher-order logistic regression
- Finite state incompressible infinite sequences
- On the number of blocks in a generalized Steiner system
- Mappings of Latin squares
- Systems of random equations over finite algebraic structures
- Zeros of principal \(L\)-functions and random matrix theory
- Order-unit quantum Gromov--Hausdorff distance
- Bose-Mesner algebras related to type II matrices and spin models
- On computing the number of Latin rectangles
- Linear CNF formulas and satisfiability
- New recurrence algorithms for the nonclassic Adomian polynomials
- Universal associative envelopes of nonassociative triple systems
- Coloring the square of graphs whose maximum average degree is less than 4
- On the number of cycles in generalized Kautz digraphs
- Results on rotation symmetric polynomials over \(GF(p)\)
- On the optimum of Delsarte's linear program
- scientific article; zbMATH DE number 3735816 (Why is no real title available?)
- A combinatorial problem associated with nonograms
- Most Latin squares have many subsquares
- On the construction of perfect deletion-correcting codes using design theory
- Proof of a conjectural supercongruence
- Spectral hypergraph theory of the adjacency hypermatrix and matroids
- Combinatorial optimization in geometry
- On the number of arcs in primitive digraphs with large exponents
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)