Margaret M. Bayer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Margaret M. Bayer has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
A. M. Bruening
Department of Mathematics University of Kansas 1502 Cypress Drive 5381 Brook Way #6 66045-7567 64034 21044 Lawrence Greenwood Columbia KS MO MD USA USA USA
1 shared publicationGerald B. Folland
Mathematics Department, University of Washington, Seattle, WA 98195-4350
1 shared publicationJ. D. Stewart
Department of Mathematics University of Kansas 1502 Cypress Drive 5381 Brook Way #6 66045-7567 64034 21044 Lawrence Greenwood Columbia KS MO MD USA USA USA
1 shared publication- Steven R. Bell
Mathematics Department, Purdue University, West Lafayette, USA
1 shared publication
Latest Publications
- Open Access
Shelling and triangulating the (extra)ordinary polytope
Ordinary polytopes were introduced by Bisztriczky as a (nonsimplicial) generalization of cyclic polytopes. We show that the colex order of facets of the ordinary polytope is a shelling order. This shelling shares many nice properties with the shellings of simplicial polytopes. We also give a shallow triangulation of the ordinary polytope, and show how the shelling and the triangulation are used to compute the toric h-vector of the ordinary polytope. As one consequence, we get that the contribution from each shelling component to the h-vector is nonnegative. Another consequence is a combinatorial proof that the entries of the h-vector of any ordinary polytope are simple sums of binomial coefficients.
Open AccessShelling and triangulating the (extra)ordinary polytope
Ordinary polytopes were introduced by Bisztriczky as a (nonsimplicial) generalization of cyclic polytopes. We show that the colex order of facets of the ordinary polytope is a shelling order. This shelling shares many nice properties with the shellings of simplicial polytopes. We also give a shallow triangulation of the ordinary polytope, and show how the shelling and the triangulation are used to compute the toric h-vector of the ordinary polytope. As one consequence, we get that the contribution from each shelling component to the h-vector is nonnegative. Another consequence is a combinatorial proof that the entries of the h-vector of any ordinary polytope are simple sums of binomial coefficients.
- 1 February 2004
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 111 (2) , 173-180
Reviews
- 1 February 2004
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 111 (2) , 173-180
Reviews
- Open Access
Flag vectors of multiplicial polytopes
Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vectors of multiplicial polytopes depend only on their face vectors. A special class of multiplicial polytopes, also discovered by Bisztriczky, is comprised of the ordinary polytopes. These are a natural generalization of the cyclic polytopes. The flag vectors of ordinary polytopes are determined. This is used to give a surprisingly simple formula for the h-vector of the ordinary d-polytope with n+1 vertices and characteristic k: h_i=binom{k-d+i}{i}+(n-k)binom{k-d+i-1}{i-1}, for i at most d/2. In addition, a construction is given for 4-dimensional multiplicial polytopes having two-thirds of their vertices on a single facet, answering a question of Bisztriczky.
Open AccessFlag vectors of multiplicial polytopes
Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vectors of multiplicial polytopes depend only on their face vectors. A special class of multiplicial polytopes, also discovered by Bisztriczky, is comprised of the ordinary polytopes. These are a natural generalization of the cyclic polytopes. The flag vectors of ordinary polytopes are determined. This is used to give a surprisingly simple formula for the h-vector of the ordinary d-polytope with n+1 vertices and characteristic k: h_i=binom{k-d+i}{i}+(n-k)binom{k-d+i-1}{i-1}, for i at most d/2. In addition, a construction is given for 4-dimensional multiplicial polytopes having two-thirds of their vertices on a single facet, answering a question of Bisztriczky.
- 1 January 2002
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 27 (1) , 49-63
A Combinatorial Study of Multiplexes and Ordinary Polytopes
- 1 January 2002
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 27 (1) , 49-63
A Combinatorial Study of Multiplexes and Ordinary Polytopes
- Open Access
Signs in the cd-index of Eulerian partially ordered sets
A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded efficiently in the cd-index. The cd-index of a polytope has all positive entries. An important open problem is to give the broadest natural class of Eulerian posets having nonnegative cd-index. This paper completely determines which entries of the cd-index are nonnegative for all Eulerian posets. It also shows that there are no other lower or upper bounds on cd-coefficients (except for the coefficient of c^n).
Open AccessSigns in the cd-index of Eulerian partially ordered sets
A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded efficiently in the cd-index. The cd-index of a polytope has all positive entries. An important open problem is to give the broadest natural class of Eulerian posets having nonnegative cd-index. This paper completely determines which entries of the cd-index are nonnegative for all Eulerian posets. It also shows that there are no other lower or upper bounds on cd-coefficients (except for the coefficient of c^n).
- 1 October 1993
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 81 (3) , 301-320
Equidecomposable and weakly neighborly polytopes
- 1 October 1993
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 81 (3) , 301-320
Equidecomposable and weakly neighborly polytopes