Combinatorial Properties of Matrices of Zeros and Ones
From MaRDI portal
Publication:3246338
DOI10.4153/CJM-1957-044-3zbMath0079.01102OpenAlexW4246168648MaRDI QIDQ3246338
Publication date: 1957
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1957-044-3
Related Items
A simulated annealing for reconstructing hv-convex binary matrices, Gram mates, sign changes in singular values, and isomorphism, The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, On 12-regular nut graphs, Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen, Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments, Seven criteria for integer sequences being graphic, A network flow algorithm for reconstructing binary images from discrete X-rays, DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION, A geometrical characterization of regions of uniqueness and applications to discrete tomography, On assignment functions, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Invariant Sets for Classes of Matrices of Zeros and Ones, An inverse problem for the collapsing sum, Inequalities and existence theorems in the theory of matrices, Minimum degree conditions for the strength and bandwidth of graphs, On Double-Resolution Imaging and Discrete Tomography, Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization, On factorable bigraphic pairs, Extremal values of the chromatic number for a given degree sequence, Optimization over Degree Sequences, Neighborhood degree lists of graphs, Lorentz and Gale–Ryser theorems on general measure spaces, On vertex-weighted realizations of acyclic and general graphs, Unnamed Item, On a constructive approach to the calculation of cardinality of the Ryser classes, Sufficient Conditions for Graphicality of Bidegree Sequences, Characterization of hv-convex sequences, Regular switching components, Combinatorial aspects of poly-Bernoulli polynomials and poly-Euler numbers, Alternating signed bipartite graphs and difference-1 colourings, Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes, On a graph coloring problem arising from discrete tomography, On the enumeration of rectangular (0, 1)-matrices, Constructing bounded degree graphs with prescribed degree and neighbor degree sequences, A formulation of the wide partition conjecture using the atom problem in discrete tomography, On maximum chains in the Bruhat order of \(\mathcal A(n,2)\), Matrices of zeros and ones, Matrices of rational integers, Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision, A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC, Number of 1-factorizations of regular high-degree graphs, Asymptotic enumeration of lonesum matrices, Graphs and degree sequences. I, The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization, On the number of zero-patterns of a sequence of polynomials, On line sum optimization, Dynamic discrete tomography, Solving the Two Color Problem: An Heuristic Algorithm, Approximating Bicolored Images from Discrete Projections, The mixing time of switch Markov chains: a unified approach, Configuring Random Graph Models with Fixed Degree Sequences, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, The Grone-Merris Conjecture, Reconstruction of hv-convex Binary Matrices from Their Absorbed Projections, On the Swap-Distances of Different Realizations of a Graphical Degree Sequence, An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors, Witt vectors. Part 1, Transitive partitions in realizations of tournament score sequences, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Algorithms for linear time reconstruction by discrete tomography. II, Uniform and monotone line sum optimization, Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Combinatorial properties of poly-Bernoulli relatives, Majorization and the number of bipartite graphs for given vertex degrees, Approximating hv-Convex Binary Matrices and Images from Discrete Projections, A minimal completion of (0, 1)-matrices without total support, Randomization methods for assessing data analysis results on real‐valued matrices, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Unnamed Item, Dag Realizations of Directed Degree Sequences, Adaptive controls of FWER and FDR under block dependence, On some geometric aspects of the class of \(hv\)-convex switching components, Bigraphic pairs with a realization containing a split bipartite-graph, Solving Some Instances of the 2-Color Problem, The 1-Color Problem and the Brylawski Model, On an inequality of A. Khintchine for zero-one matrices, On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition, On d-invariant transformations of (\(p,s\))-digraphs, Solutions to problems about potentially \(K_{s,t}\)-bigraphic pair, Improved queue-size scaling for input-queued switches via graph factorization, An evolutionary algorithm for discrete tomography, Optimization and reconstruction of \(hv\)-convex (0,1)-matrices, TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES, Recursion formulas for poly-Bernoulli numbers and their applications, Reduction from three-dimensional discrete tomography to multicommodity flow problem, A sufficient condition for non-uniqueness in binary tomography with absorption, Optimization and reconstruction of hv-convex (0,1)-matrices, An experimental study of the stability problem in discrete tomography, Minimal matrices and discrete tomography, Reconstruction of binary matrices under adjacency constraints, Reconstruction of Discrete Sets from Four Projections: Strong Decomposability, An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections, Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm, Relaxed and approximate graph realizations, Binary image reconstruction based on prescribed numerical information, On the bipartite graph packing problem, On the properties of interchange operations in classes of \((0,1)\)- matrices, Some NP-complete problems for hypergraph degree sequences, An extremal problem on bigraphic pairs with an \(A\)-connected realization, New sufficient conditions on the degree sequences of uniform hypergraphs, Planar bipartite biregular degree sequences, Bipartite regulation numbers, The bipartite-splittance of a bipartite graph, Colour degree matrices of graphs with at most one cycle, Constructing integral matrices with given line sums, Realizability and uniqueness in graphs, On the eigenvalues of the structure matrix of matrices of zeros and ones, Leaf realization problem, caterpillar graphs and prefix normal words, Mathematical programming approaches for classes of random network problems, Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions, Simple existence conditions for zero-one matrices with at most one structural zero in each row and column, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Reconstructing binary matrices with timetabling constraints, Balanced home-away assignments, Arranging apples in an array, Binary matrices under the microscope: A tomographical problem, Matrices with prescribed row, column and block sums, An inequality for positive definite matrices with applications to combinatorial matrices, Exact sampling and counting for fixed-margin matrices, On nearly self-conjugate partitions of a finite set, Integer matrices with constraints on leading partial row and column sums, Dually vertex-oblique graphs, A note on the characterization of digraphic sequences, Some approaches for solving the general (\(t,k\))-design existence problem and other related problems, Reconstructing convex matrices by integer programming approaches, Discrete tomography determination of bounded lattice sets from four X-rays, Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs, On Ryser's maximum term rank formula, Ghosts in discrete tomography, Lonesum decomposable matrices, Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem, Degree sequences and edge connectivity, A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs, A majorization theorem for the C-matrices of binary designs, Multidimensional matrices uniquely recovered by their lines, Constructive extensions of two results on graphic sequences, On tiling under tomographic constraints., Matrices uniquely determined by their lonesums, Matrices of zeros and ones with fixed row and column sum vectors, On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\), The switch Markov chain for sampling irregular graphs and digraphs, Bigraphic pairs with an \(A\)-connected realization, A reconstruction algorithm for a subclass of instances of the 2-color problem, Random graphs with a given degree sequence, Wide partitions, Latin tableaux, and Rota's basis conjecture, Matrices of 0's and 1's with total support, The class A(R,S) of (0,1)-matrices, Triangular (0,1)-matrices with prescribed row and column sums, The maximal length of a chain in the Bruhat order for a class of binary matrices, Stuttering blocks of Ariki-Koike algebras, Switching codes and designs, Graphs with given valences, Plane partitions and characters of the symmetric group, A canonical construction for nonnegative integral matrices with given line sums, Rejection sampling of bipartite graphs with given degree sequence, Binary image reconstruction from a small number of projections and the morphological skeleton, Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros, A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs, Analysis on the strip-based projection model for discrete tomography, An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences, Market implementation of multiple-arrival multiple-deadline differentiated energy services, Reconstruction of binary matrices under fixed size neighborhood constraints, Scanning integer matrices by means of two rectangular windows, Block-transitive \(t\)-designs. I: Point-imprimitive designs, Contributions to the theory of graphic sequences, Integral matrices with given row and column sums, On matching numbers of tree and bipartite degree sequences, Enumeration and simulation methods for 0-1 matrices with given marginals, New linearizations of quadratic assignment problems, Majorization permutahedra and (0,1)-matrices, On the realization of a (p,s)-digraph with prescribed degrees, Complexity results for the horizontal bar packing problem, Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets, Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper, An efficient MCMC algorithm to sample binary matrices with fixed marginals, Switching components and the ambiguity problem in the reconstruction of pictures from their projections, Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree, Bidimensional allocation of seats via zero-one matrices with given line sums, Solving nonograms by combining relaxations, 2-partition-transitive tournaments, Sets of uniqueness and minimal matrices, On (0, 1)-matrices with prescribed row and column sum vectors, Reconstruction of \(hv\)-convex binary matrices from their absorbed projections, Term rank of \(0,1\) matrices, Stability results for uniquely determined sets from two directions in discrete tomography, Prime interchange graphs of classes of matrices of zeros and ones, On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\), The relationship between the class \({\mathfrak A}_2(R,S)\) of (0, 1, 2)-matrices and the collection of constellation matrices, Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs, On normal matrices of zeros and ones with fixed row sum, Matrices of zeros and ones with the maximum jump number, The class of matrices of zeros, ones, and twos with prescribed row and column sums, Reconstruction of convex 2D discrete sets in polynomial time, On the algorithmic inversion of the discrete Radon transform, Existence and constructions of connected block designs with given vectors of treatment replications and block sizes, Degree sequences and majorization, Reconstruction of Convex Sets from One or Two X-rays, On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples, Switching checkerboards in \((0,1)\)-matrices, Graph realizations: maximum degree in vertex neighborhoods, Approximating fractionally isomorphic graphons, Weighted projections of alternating sign matrices: Latin-like squares and the ASM polytope, The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\), Optimal \((0, 1)\)-matrix completion with majorization ordered objectives, Ribbon graphs and Belyi pairs with partially prescribed branching, Non-traditional 2D grids in combinatorial imaging -- advances and challenges, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, Minimal partitions with a given \(s\)-core and \(t\)-core, Degree realization by bipartite multigraphs, On the use of graphs in discrete tomography, On the use of graphs in discrete tomography, Matrices of zeros and ones with given line sums and a zero block, Matrices of zeros and ones with given line sums and a zero block, On \(\mathfrak A(R,S)\) all of whose members are indecomposable, Supersaturation problem for the bowtie, Comparison of algorithms for reconstructing \(hv\)-convex discrete sets, On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays, Reconstruction of discrete sets with absorption, NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs, Composed degree-distance realizations of graphs, Composed degree-distance realizations of graphs, Systems of representatives
