A Lower Bound Theorem for Ehrhart Polynomials of Convex Polytopes

ISSN： 0001-8708

Source： Advances in Mathematics, Vol.105, Iss.2, 1994-05, pp. : 162-165

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Factorization Theorem of Characteristic Polynomials of Convex Geometries

By Hachimori M. Nakamura M.

Annals of Combinatorics, Vol. 11, Iss. 1, 2007-04 ,pp. : 39-46

Springer Publishing Company

Access to resources Recommend Favorite

A Bijective Proof for a Theorem of Ehrhart

By Sam Steven V

American Mathematical Monthly, Vol. 116, Iss. 8, 2009-10 ,pp. : 688-701

Mathematical Association of America

Access to resources Recommend Favorite

A lower bound on the barrier parameter of barriers for convex cones

By Hildebrand Roland

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 311-329

Elsevier

Access to resources Recommend Favorite

Convex Polytopes and Enumeration

By Simion R.

Advances in Applied Mathematics, Vol. 18, Iss. 2, 1997-02 ,pp. : 149-180

Academic Press

Access to resources Recommend Favorite

On a Lower Bound of the Uniform Distance in the Central Limit Theorem for -Mixing Random Variables

By Sunklodas J.

Acta Applicandae Mathematicae, Vol. 58, Iss. 1-3, 1999-09 ,pp. : 327-341

Springer Publishing Company

Access to resources Recommend Favorite