Compressed polytopes and statistical disclosure limitation
A lattice polytope \(P\) is said to be compressed if every pulling triangulation of it (using only lattice points from \(P\)) is unimodular. (An example is the Birkhoff polytope of doubly stochastic matrices.) The author characterizes the compressed polytopes by their facet defining inequalities, shows that every compressed is affinely isomorphic to a 0/1-polytope and proves a result about pulling triangulations for highly symmetric polytopes. Also the compressed cut polytopes are characterized, and the connection between compressed polytopes and linear optimization is investigated. The last part of the paper refers to applications of these results in statistical disclosure limitation providing new families of marginals where linear programming yields sharp upper bounds on cell entries. These results also refer to integer programming.
- Algebraic algorithms for sampling from conditional distributions
- Computing the integer programming gap
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Decompositions of Rational Convex Polytopes
- Disclosure detection in multivariate categorical databases: auditing confidentiality protection through two new matrix operators
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 2186838 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Lectures on Polytopes
- Matroids and multicommodity flows
- On the cut polytope
- Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
- polymake: a framework for analyzing convex polytopes
- Delannoy orthants of Legendre polytopes
- Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes
- Reflexive polytopes arising from perfect graphs
- Reflexive polytopes arising from edge polytopes
- Seminormality, canonical modules, and regularity of cut polytopes
- Low dimensional flow polytopes and their toric ideals
- The reflexive dimension of (0, 1)-polytopes
- Moment maps, strict linear precision, and maximum likelihood degree one
- Enriched chain polytopes
- Unconditional reflexive polytopes
- Incompatible double posets and double order polytopes
- Gorenstein cut polytopes
- Bounds on the number of 2-level polytopes, cones, and configurations
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Convex hulls of algebraic sets
- The Martin Gardner Polytopes
- Existence of unimodular triangulations -- positive results
- Markov degree of the Birkhoff model
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Two double poset polytopes
- Theta rank, levelness, and matroid minors
- Non-Normal Very Ample Polytopes – Constructions and Examples
- Normal binary hierarchical models
- Integer Programming and Combinatorial Optimization
- Gelfand-Tsetlin polytopes and the integer decomposition property
- 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
- Generalized cut polytopes for binary hierarchical models
- Toric rings of (0, 1)-polytopes with small rank
- Lipschitz polytopes of posets and permutation statistics
- Stability for binary scalar products
- S-hypersimplices, pulling triangulations, and monotone paths
- Toric geometry of cuts and splits
- Grid graphs, Gorenstein polytopes, and domino stackings
- Many 2-level polytopes from matroids
- A generalization of the integer linear infeasibility problem
- Indispensable monomials of toric ideals and Markov bases
- Normality of cut polytopes of graphs is a minor closed property
- Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes
This page was built for publication: Compressed polytopes and statistical disclosure limitation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875709)
