Permanents of multidimensional matrices: Properties and applications
From MaRDI portal
Publication:2959191
DOI10.1134/S1990478916040141zbMath1374.05024OpenAlexW2552668142MaRDI QIDQ2959191
Publication date: 9 February 2017
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478916040141
permanentstochastic matrixmultidimensional matrixpolystochastic matrix1-factor of a uniform hypergraphtransversal in a Latin hypercube
Orthogonal arrays, Latin squares, Room squares (05B15) Asymptotic enumeration (05A16) Transversal (matching) theory (05D15)
Related Items (12)
Transversals, near transversals, and diagonals in iterated groups and quasigroups ⋮ Values of the permanent function on multidimensional \((0,1) \)-matrices ⋮ Transversals, plexes, and multiplexes in iterated quasigroups ⋮ Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4 ⋮ An upper bound on the number of frequency hypercubes ⋮ On partly and nearly decomposable tensors ⋮ A range of the multidimensional permanent on (0, 1)-matrices ⋮ Parity of transversals of Latin squares ⋮ The permanent functions of tensors ⋮ On propositional coding techniques for the distinguishability of objects in finite sets ⋮ Multidimensional permanents of polystochastic matrices ⋮ Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum number of Latin transversals
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
- On the number of colored Birch and Tverberg partitions
- Perfect matchings in 3-partite 3-uniform hypergraphs
- An upper bound on the number of high-dimensional permutations
- An entropy proof of the Kahn-Lovász theorem
- A stronger form of the Egorychev-Falikman theorem on permanents
- The existence of Latin squares without orthogonal mates
- The number of transversals in a Latin square
- On the multidimensional permanent and \(q\)-ary designs
- Upper bounds on the permanent of multidimensional \((0,1)\)-matrices
- An efficient tree decomposition method for permanents and mixed discriminants
- On transversals in Latin squares
- An additive theorem and restricted sumsets
- On the number of Birch partitions
- The maximum number of perfect matchings in graphs with a given degree sequence
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Extremal plane stochastic matrices of dimension three
- A short proof of Minc's conjecture
- Counting 1-factors in regular bipartite graphs
- Contribution to van der Waerden's conjecture
- Additive triples of bijections, or the toroidal semiqueens problem
- Permanental bounds for nonnegative matrices via decomposition
- Permanents of d-dimensional matrices
- Elementary proof for a Van der Waerden's conjecture and related theorems
- On the vertices of the \(d\)-dimensional Birkhoff polytope
- An update on Minc's survey of open problems involving permanents
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Extremal configurations and decomposition theorems. I
- On the minimum of the permanent of a doubly stochastic matrix
- Multidimensional stochastic matrices and patterns
- Permanents and Determinants of Latin Squares
- An upper bound on the number of Steiner triple systems
- On Leonid Gurvits’s Proof for Permanents
- Computing the Partition Function for Perfect Matchings in a Hypergraph
- n-Ary Quasigroups of Order 4
- A Census of Small Latin Hypercubes
- Embedding large subgraphs into dense graphs
- An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix
- Degrees giving independent edges in a hypergraph
- Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares
- Combinatorial Matrix Functions and 1-Factors of Graphs
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- An entropy proof of Bregman's theorem
This page was built for publication: Permanents of multidimensional matrices: Properties and applications
