Frobenius polytopes

The Frobenius problem, rational polytopes, and Fourier-Dedekind Sums

We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear Diophantine problem of Frobenius: given relatively prime positive integers $a_1,...,a_n$, find the largest value of t (the Frobenius number) such that $m_1 a_1 + ... + m_n a_n = t$ has no solution in positive integers $m_1,...,m_n$. This is equivalent to the problem of finding the largest dilate tP such that the facet $\sum_{k=1}^n x_k a_k = t$ contains no …

On Volumes of Permutation Polytopes

This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups, dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the calculation of Ehrhart polynomials. We also present results on the theta body hierarchy of various permutation polytopes.

Regular Incidence Complexes, Polytopes, and C-Groups

Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of abstract regular polytopes has been well-studied. The paper describes the combinatorial structure of a regular incidence complex in terms of a system of distinguished generating subgroups of its automorphism group or a flag-transitive subgroup. Then the groups admitting a flag-transitive action on an incidence complex are characterized as generalized string C-group…

Characterization of polytopes via tilings with similar pieces

Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be improved.

关于一个推广雷努特数数半群的弗罗贝尼乌斯数和亏格

On the Frobenius Number and Genus of a Collection of Semigroups Generalizing Repunit Numerical Semigroups

本文研究了特定数数半群的弗罗贝尼乌斯数和亏格，提出d可为负整数的新方法，并针对特殊情形如梅森、塔比特和雷努特数数半群给出简化公式，部分解决了普罗思数数半群的开放问题。

Marked chain-order polytopes

We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizing the marked chain polytopes and marked order polytopes by putting them as extremal cases in an Ehrhart equivalent family. Some combinatorial properties of these polytopes are studied. This work is motivated by the framework of PBW degenerations in representation theory of Lie algebras.