Convex Rank Tests and Semigraphoids

DOI10.1137/080715822zbMath1198.62038arXivmath/0702564OpenAlexW1992058066MaRDI QIDQ3583292

Anne Shiu, Bernd Sturmfels, Lior Pachter, Jason Morton, Oliver Wienand

Publication date: 27 August 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

submodular functionsymmetric grouppermutohedrongraphical modelrank testbraid arrangementsemigraphoidpolyhedral fan

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Related Items (23)

Lifted generalized permutahedra and composition polynomials ⋮ Minkowski decomposition of associahedra and related combinatorics ⋮ Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity ⋮ Hopf Monoids and Generalized Permutahedra ⋮ Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022 ⋮ Polypositroids ⋮ Deformation cones of hypergraphic polytopes ⋮ Generalized Permutohedra from Probabilistic Graphical Models ⋮ Statistical ranking and combinatorial Hodge theory ⋮ Valuative invariants for polymatroids ⋮ Convex polytopes from nested posets ⋮ On Minkowski sums of simplices ⋮ Counting linear extensions: parameterizations by treewidth ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Using TPA to count linear extensions ⋮ Pseudograph associahedra ⋮ A realization of graph associahedra ⋮ The closure of a linear space in a product of lines ⋮ Coxeter submodular functions and deformations of Coxeter permutahedra ⋮ A quasisymmetric function for matroids ⋮ Coarsening polyhedral complexes ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Tensors of nonnegative rank two

Uses Software

• polymake
• posets

This page was built for publication: Convex Rank Tests and Semigraphoids