An upper bound on the number of high-dimensional permutations

DOI10.1007/s00493-011-2842-8zbMath1340.05007arXiv1106.0649OpenAlexW1996947585MaRDI QIDQ485003

Nathan Linial, Zur Luria

Publication date: 8 January 2015

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.0649

zbMATH Keywords

permutationsupper and lower boundspermanentsbinary arrayshigh-dimensional permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (22)

Spanning surfaces in \(3\)-graphs ⋮ On the maximum number of Latin transversals ⋮ Substructures in Latin squares ⋮ Smoothed counting of 0–1 points in polyhedra ⋮ An upper bound on the number of frequency hypercubes ⋮ The number of \(n\)-queens configurations ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Large deviations in random latin squares ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Monotone Subsequences in High-Dimensional Permutations ⋮ A range of the multidimensional permanent on (0, 1)-matrices ⋮ Coloured and Directed Designs ⋮ Universal arrays ⋮ Approximating permanents and hafnians ⋮ The permanent functions of tensors ⋮ Unnamed Item ⋮ On the number of Sudoku squares ⋮ Constructions of transitive Latin hypercubeatin hypercubes ⋮ A universal exponent for homeomorphs ⋮ Discrepancy of high-dimensional permutations ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems ⋮ Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Proof of the van der Waerden conjecture for permanents
• A short proof of Minc's conjecture
• On Leonid Gurvits’s Proof for Permanents
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• A Census of Small Latin Hypercubes
• An entropy proof of Bregman's theorem

This page was built for publication: An upper bound on the number of high-dimensional permutations