scientific article
From MaRDI portal
Publication:3851094
zbMath0112.24806MaRDI QIDQ3851094
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Formulations of the inclusion–exclusion principle from Legendre to Poincaré, with emphasis on Daniel Augusto da Silva, Generalized Krawtchouk polynomials and the composition scheme, Eigenvalues of Circulant Matrices and a Conjecture of Ryser, Threshold Sequences, Entropy and the complexity of graphs: I. An index of the relative complexity of a graph, Entropy and the complexity of graphs: III. Graphs with prescribed information content, On Signed Branching Markov Processes with Age, Глобализация анализа моделей размещения частиц по ячейкам, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, State-Dependent Kernel Selection for Conditional Sampling of Graphs, Ryser's permanent identity in the symmetric algebra, Unnamed Item, Computer cryptographic techniques for processing and storage of confidential information†, On branching Markov processes, Directed star decompositions of the complete directed graph, Accuracy and stability of quaternion Gaussian elimination, Inapproximability of positive semidefinite permanents and quantum state tomography, \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems, ROhAN: row-order agnostic null models for statistically-sound knowledge discovery, A note on internal partitions: the 5-regular case and beyond, Strong simulation of linear optical processes, Invariants of quadratic forms and applications in design theory, SS/TDMA Satellite Communications withk-Permutation Switching Modes, Structure of the variety of alternative algebras with the Lie-nilpotency identity of degree 5, Unnamed Item, Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration, On data retrieval from unambiguous bit matrices, Sphere decompositions of hypercubes, Coprime permutations, Constructing and sampling directed graphs with given degree sequences, Difference graphs, A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs”, A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions, Unnamed Item, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Fast computation of the exact null distribution of Spearman's \(\rho\) and Page's \(L\) statistic for samples with and without ties, A construction of group divisible designs, Doubly transitive permutation groups which are not doubly primitive, The Hadamard core of the totally nonnegative matrices, Iterated homology and decompositions of simplicial complexes, Matrix factorizations of determinants and permanents, Diagonal sums of doubly stochastic matrices†, Reconstruction of domino tiling from its two orthogonal projections, Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms, Unnamed Item, Unnamed Item, Unnamed Item, X-rays characterizing some classes of discrete sets, Reconstruction of 4- and 8-connected convex discrete sets from row and column projections, Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices, Microreversibility, nonequilibrium current fluctuations, and response theory, The use of jacobi's lemma in unimodularity theory, The \(k\)-distinct language: parameterized automata constructions, On the depth complexity of formulas, Systems of representatives, On the solution of multiattribute problems involving counting in intersecting sets, Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors, On the classical complexity of sampling from quantum interference of indistinguishable bosons, Microreversibility and nonequilibrium response theory in magnetic fields, Matrix permanent and quantum entanglement of permutation invariant states, A multilinearity property of determinant functions, Efficient algorithms for approximating quantum partition functions, The Waring Rank of the 3 x 3 Permanent, Unnamed Item, Unnamed Item, A combinatorial decomposition of simplicial complexes, Algorithms to count paths and cycles, On asymmetric \((0,1)\)-matrices with given row and column sum vectors, Periodic endomorphisms of a free monoid, Polyominoes defined by their vertical and horizontal projections, On the hardness of computing the permanent of random matrices, Variations on a theorem of Ryser, The geometry of an interchange: Minimal matrices and circulants, A generalization of Ryser's theorem on term rank, Binary vectors partially determined by linear equation systems, On the permanent of certain \((0,1)\) Toeplitz matrices, Inclusion-exclusion: exact and approximate, On the number of cyclic projective planes, Near affine Hjelmslev planes, Multiplicative designs I: The normal and reducible cases, A theorem in combinatorial matrix theory, Helly-type theorems about sets, Structural aspects of controllability and observability. II: Digraph decomposition, A majorization theorem for the C-matrices of binary designs, Distance transitive digraphs, A polynomial identity for the permanent, Matrices of zeros and ones with fixed row and column sum vectors, Matrices and set intersections, New integer pairs for Hjelmslev planes, On the number of Latin rectangles and chromatic polynomial of L(K//(r,s)), On Haber's minimum term rank formula, Generalized intersection patterns and two-symbol balanced arrays, Mathematical crystal growth. I. II, On the permanents of complements of the direct sum of identity matrices, On the number of combinations without unit separation, The existence of symmetric block designs, Codes and designs, Matrices of 0's and 1's with total support, Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix, Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matrices, A triangulation of the n-cube, The class A(R,S) of (0,1)-matrices, Eigenvalues of graphs and digraphs, The splittance of a graph, Proof of the van der Waerden conjecture for permanents, On the distribution of Legendre symbols in Galois fields. (Appendix by G. Cecconi and R. Bicocchi), Partitionseigenschaften endlicher affiner und projektiver Räume, Characterizations of extreme normalized circulations satisfying linear constraints, Approximate inclusion-exclusion, Small matrices of large dimension, An introduction to randomized algorithms, Sets uniquely determined by projections on axes. II: Discrete case, Some aspects of the development of linear algebra in the last sixty years, The symbiotic relationship of combinatorics and matrix theory, Maximum and minimum jump number of posets from matrices, Matching theory -- a sampler: From Dénes König to the present, Approximating the permanent of graphs with large factors, A note on the nonexistence of Barker sequences, A formula for the number of Latin squares, The asymptotic number of (0,1)-matrices with zero permanent, Modular difference sets, Maximum and minimum diagonal sums of doubly stochastic matrices, The \(\lambda\)-designs with multiplicative duals, On permanents of (1,-1)-matrices, A note on matrices of zeros and ones, Un algorithme combinatoire pour la résolution des problèmes du type du permanent, A maximum-rank minimum-term-rank theorem for matroids, Enumeration of sequences by levels and rises, A number-theoretic function related to Latin squares, Blocking pairs of polyhedra arising from network flows, Ramsey graphs and block designs, Three-dimensional object reconstruction from orthogonal projections, Line-digraphs, arborescences and theorems of Tutte and Knuth, Some sufficient conditions for a Steiner triple system to be a derived triple system, Acyclic orientations of a graph and the chromatic and independence numbers, Endlichkeitssätze für k-kritische Graphen, On tactical configurations with no four-cycles, Nonisomorphic Hadamard designs, The factors of a design matrix, An upper bound for the \(\alpha\)-height of (0,1)-matrices, Construction of Hjelmslev planes from \((t,k)\)-nets, On Artin's conjecture and Euclid's algorithm in global fields, On the converse of Singer's theorem, The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov, Rectangular arrays, A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares, On the truncated assignment polytope, Asymptotic lower bounds for Ramsey functions, The length of a (0,1) matrix, An inclusion region for the field of values of a doubly stochastic matrix based on its graph, The distribution of 1-widths of (0,1)-matrices, Switching components and the ambiguity problem in the reconstruction of pictures from their projections, Some inequalities for multidimensional (0,1)-matrices, A new type of combinatorial design, On the structure of regular pairwise balanced designs, Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching, Sets of uniqueness and minimal matrices, On apolarity and generic canonical forms, The Hall number, the Hall index, and the total Hall number of a graph, On the upper bound of the diameter of interchange graphs, Chessboard graphs, related designs, and domination parameters, Sub-direct sums and positivity classes of matrices, On the computational complexity of reconstructing lattice sets from their \(X\)-rays, On normal matrices of zeros and ones with fixed row sum, Degree sequences and majorization, Computing the permanent modulo a prime power, Formal duality in finite cyclic groups, The structure matrix and a generalization of Ryser's maximum term rank formula, A Walsh–Fourier Approach to the Circulant Hadamard Conjecture, Unnamed Item, A hidden orthogonal Latin square in a work of Euler from 1770, Maximum length codes and their relation with the incomplete block design, Geometria combinatoria e geometrie finite, Partial distinguishability as a coherence resource in boson sampling, A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances, Some upper bounds for permanents of (0, 1)-matrices, Permutation classes and polyomino classes with excluded submatrices, CAZAC Sequences and Haagerup’s Characterization of Cyclic N-roots, Efficient computation of the permanent of a sparse matrix, On the parity of permanents of circulant matrices, A solvable case of image reconstruction in discrete tomography, Integral approximation sequences, Über Blockpläne mit transitiver Dilatationsgruppe, Minkowski planes, On permutation groups of prime degree p which contain (at least) two classes of conjugate subgroups of index p, Extremal configurations and decomposition theorems. I, Combinatorial equivalence of (0,1) circulant matrices, Arithmetic Circuits: A Chasm at Depth 3, On a class of doubly, but not triply transitive permutation groups, An extension of a theorem of the Bruijn and Erdős on combinatorial designs, Unbalanced Hadamard matrices and finite projective planes of even order, Pivot size in Gaussian elimination, Quasi-residual designs, A market problem, An investigation of Bhattacharya-type designs, Term ranks and permanents of nonnegative matrices, On inequivalent balanced incomplete block designs. II, Maximal subgroups of the semigroup of relations, Combinatorial designs and related systems, A lower bound for the permanent on \(U_ n(k,k)\), Algebraic Complexity Classes, Multiplier groups of difference sets, On the construction of certain Hadamard designs, Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity, Automorphisms of symmetric balanced incomplete block designs, Equivalence of Hadamard matrices, Multidimensional stochastic matrices and patterns, Funktionen über lokal endlichen Halbordnungen. I, Remarks on the van der Waerden conjecture. II, Counting of abelian words formed from letters of some collection of alphabets, On the structure of generalized quadrangles, Embedding partial idempotent Latin squares, The completion of finite incomplete Steiner triple systems with applications to loop theory, Modular Hadamard matrices and related designs. I, Endliche Vervollständigung endlicher partieller Steinerscher Systeme. (Finite completion of finite partial Steiner systems), Matrices permutable to \(^ *\) matrices, On operator ranges, Group characters and nonnegative integral matrices, On Ramsey numbers and \(K_ r\)-coloring of graphs, The number of partially ordered sets, The number of idempotents in (0,1)-matrix semigroups, On the non-existence of a class of configurations which are nearly generalized n-gons, The \(B_r\) property and chromatic numbers of generalized graphs, Symmetric designs and related configurations, Integral equivalence of Hadamard matrices, Construction of association schemes and designs from finite groups, Three mutually orthogonal Latin squares, Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols, Extension of partial diagonals of matrices. I, Ramsey's theorem for a class of categories, An extremal problem in the uniform covering of finite sets, On unitary collineation groups, Experimental designs through level reduction of the d-dimensional cuboctahedron, On completely normal (0,1)-matrices and symmetrizability, Eigenvalues and partitionings of the edges of a graph, Über die Möbiusfunktion einer lokal endlichen Halbordnung, Enumeration of matrices with prescribed row and column sums, Reconstruction of patterns by block-projection, On a generalization of Ramsey numbers, On the principle of inclusion and exclusion, A doubling construction for Room squares, Block designs with repeated blocks, A property of (\(v\),\(k\),\(\lambda\))-designs, Combinatorial structures in loops. I: Elements of the decomposition theory, Rearrangements of incidence tables, A note on generalized (\(n,K,\lambda\))-systems, On covering a product of sets with products of their subsets, A family of difference sets in non-cyclic groups, On the existence of Room squares, On the existence of triangulated spheres in 3-graphs, and related problems, On the Smith normal form of \(D\)-optimal designs, Recent progress in algebraic design theory, On the values of permanents of (0, 1) circulant matrices with three ones per row, Double arrays, triple arrays and balanced grids with \(v=r+c-1\)., An evolutionary algorithm for discrete tomography, Latin squares, partial Latin squares and their generalized quotients, A survey on modular Hadamard matrices, High connectivity keeping sets in graphs and digraphs, An introduction to periodical discrete sets from a tomographical perspective, Reconstruction of convex polyominoes from orthogonal projections of their contours, Using graphs for some discrete tomography problems, An experimental study of the stability problem in discrete tomography, Structure of Total Reconstructed Sets from Given Two Projection Data, Reconstructing a binary matrix under timetabling constraints, Minimal matrices and discrete tomography, Geometric properties of matrices induced by pattern avoidance, On the number of tournaments with prescribed score vector, Totally nonpositive completions on partial matrices, On the completability of incomplete orthogonal Latin rectangles, Extending subpermutation matrices in regular classes of matrices, New duality operator for complex circulant matrices and a conjecture of Ryser, Richardson-Gaudin geminal wavefunctions in a Slater determinant basis, A permanent formula with many zero-valued terms, Fast exact algorithms using Hadamard product of polynomials, Designs with mutually orthogonal resolutions, Simple quasidoubles of projective planes, The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices, Operators that preserve semiring matrix functions, A directed graph version of strongly regular graphs, Computing permanents via determinants for some classes of sparse matrices, Maximum permanents of matrices of zeros and ones, An incidence algebra for t-designs with automorphisms, On the nonuniform Fisher inequality, Maximum determinants of complementary acyclic matrices of zeros and ones, Jung constant in \(\ell\) \(n_ 1\), On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Some applications of doubly stochastic matrices, Doubly regular asymmetric digraphs, The Bruhat rank of a binary symmetric staircase pattern, Feasible arithmetic computations: Valiant's hypothesis, On joint realization of (0,1) matrices, Hermitian congruence and the existence of completion of generalized Hadamard matrices, Random path method with pivoting for computing permanents of matrices, Algorithms for four variants of the exact satisfiability problem, The complexity of computing the permanent, Finite planes and graphs, On the facial structure of the set covering polytope, On the Pólya permanent problem over finite fields, Ovals in projective designs, t-designs associated with non degenerate conics in a Galois plane of odd order, The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs, On Ryser's maximum term rank formula, Klingenberg structures and partial designs I: Congruence relations and solutions, Analytic aspects of the circulant Hadamard conjecture, The expected characteristic and permanental polynomials of the random Gram matrix, Evaluation of permanents in rings and semirings, The anti-field-descent method, An efficient tree decomposition method for permanents and mixed discriminants, Sequences with small correlation, New permanental bounds for Ferrers matrices, Nonlinear PDEs and measure-valued branching type processes, Arithmetic circuits: the chasm at depth four gets wider, Sufficient conditions for a conjecture of Ryser about Hadamard circulant matrices, On two generalizations of the Alon-Tarsi polynomial method, Two-colorings with many monochromatic cliques in both colors, Power Hadamard matrices, On the number of combinations without certain separations, Cycle-maximal triangle-free graphs, On realizations of a joint degree matrix, Reconstructing convex polyominoes from horizontal and vertical projections, Triangular blocks of zeros in (0,1) matrices with small permanents, Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices, Extended interlacing intervals, On the permanents of circulant and degenerate Schur matrices, Reconstruction of binary matrices under fixed size neighborhood constraints, Solving the train marshalling problem by inclusion-exclusion, Sign patterns that require repeated eigenvalues, A combinatorial decomposition of acyclic simplicial complexes, Optimality aspects of row-column designs with non-orthogonal structure, Calculation of the permanent of a sparse positive matrix, A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes, An efficient algorithm for computing permanental polynomials of graphs, Vector representations of graphs, A note on graph minors and strong products, An efficient MCMC algorithm to sample binary matrices with fixed marginals, Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices, The completable digraphs for the totally nonnegative completion problem, The combinatorics of N. G. de Bruijn, Bidimensional allocation of seats via zero-one matrices with given line sums, Hadwiger number and the Cartesian product of graphs, Weight polarization and divisibility, \((0,\lambda)\)-graphs and \(n\)-cubes, Partitions of \(\mathbb Z_n\) into arithmetic progressions, On large sets of disjoint Steiner triple systems. VI, Linear CNF formulas and satisfiability, The doubly stochastic matrices of a vector majorization, New permanent approximation inequalities via identities, Computing expectations and marginal likelihoods for permutations, On prime factors of determinants of circulant matrices, Computing sparse permanents faster, Block designs with near-minimal number of blocks, A faster tree-decomposition based algorithm for counting linear extensions, Prime interchange graphs of classes of matrices of zeros and ones, Über die Wurzelschranke für das Minimalgewicht von Codes, An extremal problem on v-partite graphs, Matrices and set differences, The network flows approach for matrices with given row and column sums, Hadamard matrices of order 28 with automorphisms of order 13, Chromatic number of classes of matrices of zeros and ones, A new look at the optimal assignment problem, Consistent social choice functions and systems of distinct representatives, The class of matrices of zeros, ones, and twos with prescribed row and column sums, A note on models of finite geometries arising from difference sets, On graphic and 3-hypergraphic sequences, Construction techniques for some thin sets in duals of compact abelian groups, Split graphs, Graph realizations constrained by skeleton graphs, The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Degree complete graphs, A hybrid algorithm for computing permanents of sparse matrices, Efficient computation of permanents, with applications to boson sampling and random matrices, Limit theorems for random permanents with exchangeable structure, Applications of cut polyhedra. II, Best packing of rods into boxes, A hybrid algorithm for multi-homogeneous Bézout number, A connection between random variables and latin \(k\)-cubes, Permanent variational wave functions for bosons, The Hafnian master theorem, Lower bounds for the determinant and the trace of a class of Hermitian matrices, Congruences for permanents and determinants of circulants, On the limits of depth reduction at depth 3 over small finite fields, Editing to a connected graph of given degrees, Identities of metabelian alternative algebras, Constructing (0,1)-matrices with large minimal defining sets, The number of convex polyominoes reconstructible from their orthogonal projections, Degree sequence for \(k\)-arc strongly connected multiple digraphs, Circulant matrices and Galois-Togliatti systems, Packing boxes with harmonic bricks, Quadratic residue codes and symplectic groups, Generating functions on idempotent semigroups. II: Semilattice variables and independence, Embedding an incomplete diagonal latin square in a complete diagonal latin square, Extension of partial diagonals of matrices. II, A generalization of circulant Hadamard and conference matrices, Cocyclic Hadamard matrices over Latin rectangles, Tiling with bars under tomographic constraints., Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections., Alternating sign matrices and hypermatrices, and a generalization of Latin squares, On tiling under tomographic constraints., Matrices uniquely determined by their lonesums, Binary matrices, Circulant partial Hadamard matrices, Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars., XSAT and NAE-SAT of linear CNF classes, On maximum chains in the Bruhat order of \(\mathcal A(n,2)\), Dissipative sequences in infinite ergodic theory., The norm of the Fourier transform on finite abelian groups, Almost Hadamard matrices: the case of arbitrary exponents, Schur coupling and related equivalence relations for operators on a Hilbert space, Plane partitions and characters of the symmetric group, Circulant matrices with orthogonal rows and off-diagonal entries of absolute value 1, Parity of transversals of Latin squares, Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games, Multicast key distribution schemes based on Stinson-Van Trung designs, Asymptotic enumeration of dense 0-1 matrices with specified line sums, Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope, Antichains of \((0, 1)\)-matrices through inversions, Characterizing Valiant's algebraic complexity classes, Equivalence classes of matchings and lattice-square designs, Lexicographic matching in Boolean algebras, Monotonicity of certain functionals under rearrangement, A constructive decomposition and Fulkerson's characterization of permutation matrices, Partial matroid representations, Counting models for 2SAT and 3SAT formulae, Matrix permanent inequalities for approximating joint assignment matrices in tracking systems, Uniform coverage designs for mixture experiments, Solution counting algorithms for constraint-centered search heuristics, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants, Approximation theorems for random permanents and associated stochastic processes, On Hadamard full propelinear codes with associated group \(C_{2t}\times C_2\), Linear immanant converters on skew-symmetric matrices of order 4, Necessary conditions for the existence of group-invariant Butson Hadamard matrices and a new family of perfect arrays, Binary periodic sequences with 2-level autocorrelation values, Highly unique network descriptors based on the roots of the permanental polynomial, Hyperdeterminants, Ménage numbers, bijections and P-recursiveness, Ramsey-Sperner theory, Term-rank, permanent, and rook-polynomial preservers, Matchings in graphs on non-orientable surfaces, The existence of circular Florentine arrays, An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem, On the computational complexity of determining polyatomic structures by X-rays, Small diameter interchange graphs of classes of matrices of zeros and ones, Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren, Further steps on the reconstruction of convex polyominoes from orthogonal projections, On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\), Concerning the number of mutually orthogonal latin squares, On \(\lambda\)-designs, The lattice of integer partitions, The 1-width of (0,1)-matrices having constant row sum 3, Binary cumulants, Block designs with repeated blocks and \((b,r,\lambda)=1\), A new class of finite cyclic permanent groups, Principle of inclusion-exclusion on semilattices, Generalization of the Gale-Ryser theorem, Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs, On the isomorphisms of Cayley graphs of Abelian groups., Computation of sparse circulant permanents via determinants, A quantum hash function with grouped coarse-grained boson sampling, Faster exponential-time algorithms in graphs of bounded average degree, The border of the Hilbert function of a set of points in \(\mathbb P^{n_1}\times \cdots \times \mathbb P^{n_k}\), The reconstruction of polyominoes from their orthogonal projections, On the algorithmic inversion of the discrete Radon transform, A short scientific biography of Maurice Nivat, Doubly stochastic matrices and Schur-Weyl duality for partition algebras, Reconstructing \(hv\)-convex polyominoes from orthogonal projections
