Three Counterexamples on Semigraphoids

Simple item page
dc.creatorHemmecke, Raymond
dc.creatorMorton, Jason
dc.creatorShiu, Anne
dc.creatorSturmfels, Bernd
dc.creatorWienand, Oliver
dc.date2006-10-15
dc.date.accessioned2026-07-07T08:08:15Z
dc.date.available2026-07-07T08:08:15Z
dc.descriptionSemigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on semigraphoids posed in Studeny's book, and we answer a related question by Postnikov, Reiner, and Williams on generalized permutohedra. We also study the semigroup and the toric ideal associated with semigraphoids.
dc.identifierhttps://arxiv.org/abs/math/0610451
dc.identifierhttp://arxiv.org/abs/math/0610451
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131201
dc.subjectCombinatorics
dc.subjectStatistics Theory
dc.titleThree Counterexamples on Semigraphoids
dc.typetext

Files

Collections

arXiv