相关论文: An Invitation to Ehrhart Theory: Polyhedral Geomet…

In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…

We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…

We extend the Barvinok-Woods algorithm for enumerating projections of integer points in polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the…

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…

We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…

The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…

Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…

We provide an expository introduction to $\mathbb{A}^1$-enumerative geometry, which uses the machinery of $\mathbb{A}^1$-homotopy theory to enrich classical enumerative geometry questions over a broader range of fields. Included is a…

We give a combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices. In a special case, where these polytopes coincide with the base polytope of the panhandle matroid $\textrm{Pan}_{k,n-2,n}$, we…

We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…