Compressed polytopes and statistical disclosure limitation

DOI10.2748/tmj/1163775139zbMath1121.52028arXivmath/0412535OpenAlexW1989517190MaRDI QIDQ875709

Seth Sullivant

Publication date: 13 April 2007

Published in: Tôhoku Mathematical Journal. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

linear programminginteger programmingBirkhoff polytopealgebraic statisticsaffine symmetrydisclosure limitation0/1-polytopecompressed polytope

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Contingency tables (62H17)

Related Items (39)

Non-Normal Very Ample Polytopes – Constructions and Examples ⋮ Normal Binary Hierarchical Models ⋮ Toric geometry of cuts and splits ⋮ Grid graphs, Gorenstein polytopes, and domino stackings ⋮ Non-very ample configurations arising from contingency tables ⋮ Gorenstein cut polytopes ⋮ Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes ⋮ Bounds on the number of 2-level polytopes, cones, and configurations ⋮ Two Double Poset Polytopes ⋮ Markov degree of the Birkhoff model ⋮ Moment maps, strict linear precision, and maximum likelihood degree one ⋮ Enriched chain polytopes ⋮ Toric rings of perfectly matchable subgraph polytopes ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ Torsionfreeness for divisor class groups of toric rings of integral polytopes ⋮ Unconditional reflexive polytopes ⋮ Generalized cut polytopes for binary hierarchical models ⋮ A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs ⋮ Many 2-level polytopes from matroids ⋮ A generalization of the integer linear infeasibility problem ⋮ Indispensable monomials of toric ideals and Markov bases ⋮ Seminormality, canonical modules, and regularity of cut polytopes ⋮ The Martin Gardner Polytopes ⋮ Enumeration of 2-level polytopes ⋮ Theta rank, levelness, and matroid minors ⋮ Reflexive polytopes arising from perfect graphs ⋮ Normality of cut polytopes of graphs is a minor closed property ⋮ Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes ⋮ Lipschitz polytopes of posets and permutation statistics ⋮ Reflexive polytopes arising from edge polytopes ⋮ Gelfand-Tsetlin polytopes and the integer decomposition property ⋮ Incompatible double posets and double order polytopes ⋮ Convex Hulls of Algebraic Sets ⋮ Existence of unimodular triangulations — positive results ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ Low dimensional flow polytopes and their toric ideals ⋮ Delannoy orthants of Legendre polytopes ⋮ \(S\)-hypersimplices, pulling triangulations, and monotone paths ⋮ The reflexive dimension of (0, 1)-polytopes

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids and multicommodity flows
• Algebraic algorithms for sampling from conditional distributions
• Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
• Computing the integer programming gap
• Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
• Disclosure Detection in Multivariate Categorical Databases: Auditing Confidentiality Protection Through Two New Matrix Operators
• Decompositions of Rational Convex Polytopes
• Lectures on Polytopes
• On the cut polytope
• Geometry of cuts and metrics

This page was built for publication: Compressed polytopes and statistical disclosure limitation