Faces of Birkhoff Polytopes (Q161295): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2263784
aliases / en / 0aliases / en / 0
 
Faces of Birkhoff polytopes
description / endescription / en
 
scientific article; zbMATH DE number 6416845
Property / publication date
 
19 March 2015
Timestamp+2015-03-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 March 2015 / rank
 
Normal rank
Property / author
 
Property / author: Andreas Paffenholz / rank
 
Normal rank
Property / title
 
Faces of Birkhoff polytopes (English)
Property / title: Faces of Birkhoff polytopes (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1311.52015 / rank
 
Normal rank
Property / published in
 
Property / published in: The Electronic Journal of Combinatorics / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://arxiv.org/abs/1304.3948 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p67 / rank
 
Normal rank
Property / review text
 
Summary: The Birkhoff polytope \(B_n\) is the convex hull of all \((n\times n)\) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various applications throughout mathematics. In this paper we study combinatorial types \(\mathcal L\) of faces of a Birkhoff polytope. The Birkhoff dimension \(\mathrm{bd}(\mathcal L)\) of \(\mathcal L\) is the smallest \(n\) such that \(B_n\) has a face with combinatorial type \(\mathcal L\). By a result of Billera and Sarangarajan, a combinatorial type \(\mathcal L\) of a \(d\)-dimensional face appears in some \(\mathcal B_k\) for \(k\leqslant 2d\), so \(\mathrm{bd}(\mathcal L)\leqslant 2d\). We characterize those types with \(\mathrm{bd}(\mathcal L)\geqslant 2d-3\), and we prove that any type with \(\mathrm{bd}(\mathcal L)\geqslant d\) is either a product or a wedge over some lower dimensional face. Further, we computationally classify all \(d\)-dimensional combinatorial types for \(2\leqslant d\leqslant 8\).
Property / review text: Summary: The Birkhoff polytope \(B_n\) is the convex hull of all \((n\times n)\) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various applications throughout mathematics. In this paper we study combinatorial types \(\mathcal L\) of faces of a Birkhoff polytope. The Birkhoff dimension \(\mathrm{bd}(\mathcal L)\) of \(\mathcal L\) is the smallest \(n\) such that \(B_n\) has a face with combinatorial type \(\mathcal L\). By a result of Billera and Sarangarajan, a combinatorial type \(\mathcal L\) of a \(d\)-dimensional face appears in some \(\mathcal B_k\) for \(k\leqslant 2d\), so \(\mathrm{bd}(\mathcal L)\leqslant 2d\). We characterize those types with \(\mathrm{bd}(\mathcal L)\geqslant 2d-3\), and we prove that any type with \(\mathrm{bd}(\mathcal L)\geqslant d\) is either a product or a wedge over some lower dimensional face. Further, we computationally classify all \(d\)-dimensional combinatorial types for \(2\leqslant d\leqslant 8\). / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6416845 / rank
 
Normal rank
Property / zbMATH Keywords
 
Birkhoff polytope
Property / zbMATH Keywords: Birkhoff polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
Birkhoff dimension
Property / zbMATH Keywords: Birkhoff dimension / rank
 
Normal rank
Property / zbMATH Keywords
 
lattice polytope
Property / zbMATH Keywords: lattice polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
elementary graphs
Property / zbMATH Keywords: elementary graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation polytope
Property / zbMATH Keywords: permutation polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
face lattice
Property / zbMATH Keywords: face lattice / rank
 
Normal rank
Property / zbMATH Keywords
 
low dimensional classification
Property / zbMATH Keywords: low dimensional classification / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: polymake / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: birkhoff faces / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank

Revision as of 11:15, 29 April 2024

scientific article; zbMATH DE number 6416845
  • Faces of Birkhoff polytopes
Language Label Description Also known as
English
Faces of Birkhoff Polytopes
scientific article; zbMATH DE number 6416845
  • Faces of Birkhoff polytopes

Statements

14 April 2013
0 references
19 March 2015
0 references
0 references
math.CO
0 references
0 references
0 references
0 references
0 references
0 references
Faces of Birkhoff polytopes (English)
0 references
Summary: The Birkhoff polytope \(B_n\) is the convex hull of all \((n\times n)\) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various applications throughout mathematics. In this paper we study combinatorial types \(\mathcal L\) of faces of a Birkhoff polytope. The Birkhoff dimension \(\mathrm{bd}(\mathcal L)\) of \(\mathcal L\) is the smallest \(n\) such that \(B_n\) has a face with combinatorial type \(\mathcal L\). By a result of Billera and Sarangarajan, a combinatorial type \(\mathcal L\) of a \(d\)-dimensional face appears in some \(\mathcal B_k\) for \(k\leqslant 2d\), so \(\mathrm{bd}(\mathcal L)\leqslant 2d\). We characterize those types with \(\mathrm{bd}(\mathcal L)\geqslant 2d-3\), and we prove that any type with \(\mathrm{bd}(\mathcal L)\geqslant d\) is either a product or a wedge over some lower dimensional face. Further, we computationally classify all \(d\)-dimensional combinatorial types for \(2\leqslant d\leqslant 8\).
0 references
0 references
Birkhoff polytope
0 references
Birkhoff dimension
0 references
lattice polytope
0 references
elementary graphs
0 references
permutation polytope
0 references
face lattice
0 references
low dimensional classification
0 references
0 references
0 references
0 references