56 research outputs found

    Ehrhart Series of Polytopes Related to Symmetric Doubly-Stochastic Matrices

    Full text link
    In Ehrhart theory, the h∗h^*-vector of a rational polytope often provide insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic matrices, has a unimodal h∗h^*-vector, but when even small modifications are made to the polytope, the same property can be very difficult to prove. In this paper, we examine the h∗h^*-vectors of a class of polytopes containing real doubly-stochastic symmetric matrices.Comment: 11 pages; this revision removes an erroneous proposition from earlier versions and expands on the implication

    A Generating Function for all Semi-Magic Squares and the Volume of the Birkhoff Polytope

    Full text link
    We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope B_n of n x n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of B_n and any of its faces.Comment: 24 pages, 1 figure. To appear in Journal of Algebraic Combinatoric

    Unimodality Problems in Ehrhart Theory

    Full text link
    Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart h∗h^*-vector. Ehrhart h∗h^*-vectors have connections to many areas of mathematics, including commutative algebra and enumerative combinatorics. In this survey we discuss what is known about unimodality for Ehrhart h∗h^*-vectors and highlight open questions and problems.Comment: Published in Recent Trends in Combinatorics, Beveridge, A., et al. (eds), Springer, 2016, pp 687-711, doi 10.1007/978-3-319-24298-9_27. This version updated October 2017 to correct an error in the original versio

    Unimodality Questions in Ehrhart Theory

    Get PDF
    An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector.Although various sufficient conditions have been found, necessary conditions remain a challenge. Highly-structured polytopes, such as the polytope of real doubly-stochastic matrices, have been proven to possess unimodal h*-vectors, but the same is unknown even for small variations of it. In this dissertation, we mainly consider two particular classes of polytopes: reflexive simplices and the polytope of symmetric real doubly-stochastic matrices. For the first class, we discuss an operation that preserves reflexivity, integral closure, and unimodality of the h*-vector, providing one explanation for why unimodality occurs in this setting. We also discuss the failure of proving unimodality in this setting using weak Lefschetz elements. With the second class, we prove partial unimodality results by examining their toric ideals and using a correspondence between these and regular triangulations of the polytopes. Lastly, we describe the computational methods used to help develop these results. Several software programs were used, and the code has proven useful outside of the main focus of this work

    Stanley's Major Contributions to Ehrhart Theory

    Full text link
    This expository paper features a few highlights of Richard Stanley's extensive work in Ehrhart theory, the study of integer-point enumeration in rational polyhedra. We include results from the recent literature building on Stanley's work, as well as several open problems.Comment: 9 pages; to appear in the 70th-birthday volume honoring Richard Stanle

    Combinatorics and Geometry of Transportation Polytopes: An Update

    Full text link
    A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have interest for discrete mathematics because permutation matrices, latin squares, and magic squares appear naturally as lattice points of these polytopes. In this paper we survey advances on the understanding of the combinatorics and geometry of these polyhedra and include some recent unpublished results on the diameter of graphs of these polytopes. In particular, this is a thirty-year update on the status of a list of open questions last visited in the 1984 book by Yemelichev, Kovalev and Kravtsov and the 1986 survey paper of Vlach.Comment: 35 pages, 13 figure

    Applications of Convex and Algebraic Geometry to Graphs and Polytopes

    Get PDF
    • …
    corecore