Related papers: Very ample and Koszul segmental fibrations

Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

For a system of non-homogeneous polynomials it was constructed explicit complex morphism of a dual complex to the Koszul complex into the Koszul complex. If the ideal of these polynomials is 0-dimensional, then this mapping is a homotopic…

Koszul algebras with quadratic Groebner bases, called strong Koszul algebras, are studied. We introduce affine algebraic varieties whose points are in one-to-one correspondence with certain strong Koszul algebras and we investigate the…

The quotient singularities of dimensions two and three obtained from polyhedral groups and the corresponding binary polyhedral groups admit natural resolutions of singularities as Hilbert schemes of regular orbits whose exceptional fibres…

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

Hochschild lattices are specific intervals in the dexter meet-semilattices recently introduced by Chapoton. A natural geometric realization of these lattices leads to some cell complexes introduced by Saneblidze, called the Hochschild…

In the framework of algebraic topology the closed sequence of 4-dimensional polyhedra (algebraic polytopes) was defined. This sequence is started by the polytope {240}, discovered by Coxeter, and is determined by the second coordination…

In this paper we present some linear algebra behind quadratic parts of quadratically flat complex points of codimension two real submanifold in a complex manifold. Assuming some extra nondegenericity and using the result of Hong, complete…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…

Ordinary polytopes were introduced by Bisztriczky as a (nonsimplicial) generalization of cyclic polytopes. We show that the colex order of facets of the ordinary polytope is a shelling order. This shelling shares many nice properties with…

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

In this paper we study the lattice point covering property of some regular polygons in dimension 2.

Let $M$ be a Liouville 6-manifold which is the smooth fiber of a Lefschetz fibration on $\mathbb{C}^4$ constructed by suspending a Lefschetz fibration on $\mathbb{C}^3$. We prove that for many examples including stabilizations of Milnor…

Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…

A simple d-dimensional lattice model is proposed, incorporating some degree of frustration and thus capable of describing some aspects of molecular orientation in covalently bound molecular solids. For d=2 the model is shown to be…

Can one build an arbitrary polytope from any polytope inside by iteratively stacking pyramids onto facets, without losing the convexity throughout the process? We prove that this is indeed possible for (i) 3-polytopes, (ii) 4-polytopes…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…