Saturation points on faces of a rational polyhedral cone

@article{Takemura2006SaturationPO,
  title={Saturation points on faces of a rational polyhedral cone},
  author={Akimichi Takemura and Ruriko Yoshida},
  journal={arXiv: Combinatorics},
  year={2006}
}
Different commutative semigroups may have a common saturation. We consider distinguishing semigroups with a common saturation based on their ``sparsity''. We propose to qualitatively describe sparsity of a semigroup by considering which faces of the corresponding rational polyhedral cone have saturation points. For a commutative semigroup we give a necessary and sufficient condition for determining which faces have saturation points. We also show that we can construct a commutative semigroup… 
View PDF on arXiv
7 Citations
Background Citations
5
Methods Citations
1
Results Citations
1

Figures and Tables from this paper

7 Citations

On orbits of automorphism groups on horospherical varieties
In this paper we describe orbits of automorphism group on a horospherical variety in terms of degrees of homogeneous with respect to natural grading locally nilpotent derivations. In case of (may be…
Computing holes in semi-groups
In this paper we present an algorithm to compute an explicit description for the difference of a semi-group Q generated by vectors in Z d and its saturation Qsat. If H = Qsat \ Q is finite, we give…
Definition of Markov Bases and Other Bases
TLDR
This chapter defines Markov bases for general discrete exponential family models, clarifies the relations between moves and binomials and state the fundamental fact that a Markov basis is a set of generators of a toric ideal.
Holes in Semigroups and Their Applications to the Two-way Common Diagonal Effect Model
TLDR
This paper summarizes the results in [Takemura and Yoshida, 2007] and studies how the difference between the semigroup generated by columns of the design matrix for a common diagonal effect model and its saturation are distributed.
Automorphisms of Nonnormal Toric Varieties
In this paper we prove criteria for a nonnormal toric variety to be flexible, to be rigid and to be almost rigid. For rigid and almost rigid toric varieties we describe the automorphism group…
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Computing holes in semi-groups
Computing holes in semigroups
In this paper we present an algorithm to compute an explicit description for the difference of a semi-group Q generated by vectors in Z and its saturation Qsat. If H = Qsat \ Q is finite, we give an…

References

SHOWING 1-10 OF 43 REFERENCES
Unimodular Covers of Multiples of Polytopes
Let P be a d-dimensional lattice polytope. We show that there exists a natural number cd, only depending on d, such that the multiples cP have a unimodular cover for every natural number c‚ cd.…
Fundamental holes and saturation points of a commutative semigroup and their applications to contingency tables
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security…
Gröbner bases and convex polytopes
Grobner basics The state polytope Variation of term orders Toric ideals Enumeration, sampling and integer programming Primitive partition identities Universal Grobner bases Regular triangulations The…
Short rational generating functions for lattice point problems
Abstract. We prove that for any fixed d the generating function of the projectionof the set of integer points in a rational d-dimensional polytope can be computed inpolynomial time. As a corollary, we…
On Primitive Subdivisions of an Elementary Tetrahedron
A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary. An L-elementary tetrahedron has volume > (1/6). det(L), in case equality holds it is called…
Combinatorial Commutative Algebra
Monomial Ideals.- Squarefree monomial ideals.- Borel-fixed monomial ideals.- Three-dimensional staircases.- Cellular resolutions.- Alexander duality.- Generic monomial ideals.- Toric Algebra.-…
A generalization of the integer linear infeasibility problem
The largest group of invariance for Markov bases and toric ideals
Non-standard approaches to integer programming
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
TLDR
An algorithm for solving constrained diophantine equations as subproblems when designing integrated circuits for video signal processing based on lattice basis reduction, which is tested with good results on real-life data, and on instances from the literature.
...
...