Related papers: Castelnuovo polytopes
Let X be a complex, Gorenstein, Q-factorial, toric Fano variety. We prove two conjectures on the maximal Picard number of X in terms of its dimension and its pseudo-index, and characterize the boundary cases. Equivalently, we determine the…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal in a polynomial ring $R$. We give the formula of Castelnuovo-Mumford regularity of $R/I(\mathcal{D})$ when $\mathcal{D}$ is a weighted oriented path…
We introduce and study a notion of Castelnuovo-Mumford regularity suitable for scrolls obtained as projectivisations of sums of line bundles on $\mathbb P^m$. We show that this is a natural generalisation of the well known regularity on…
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…
Let $C$ be an algebraic curve defined by a sufficiently generic bivariate Laurent polynomial with given Newton polygon $\Delta$. It is classical that the geometric genus of $C$ equals the number of lattice points in the interior of…
We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
We present a formula for the degree of the discriminant of a smooth projective toric variety associated to a lattice polytope P, in terms of the number of integral points in the interior of dilates of faces of dimension greater or equal…
Quaternionic tori are defined as quotients of the skew field $\mathbb{H}$ of quaternions by rank-4 lattices. Using slice regular functions, these tori are endowed with natural structures of quaternionic manifolds (in fact quaternionic…
Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…
We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…
We describe a new type of spatially periodic structure (lattice models): a polaritonic crystal (PolC) formed by a two-dimensional lattice of trapped two-level atoms interacting with quantised electromagnetic field in a cavity (or in a…
L. Paoluzzi constructed a family of compact orientable three-dimensional hyperbolic manifolds with totally geodesic boundary, which were, by construction, closely related to the three-dimensional torus. This paper gives their complete…
The classical results, initiated by Castelnuovo and Fano and later refined by Eisenbud and Harris, provide several upper bounds on the number of quadrics defining a nondegenerate projective variety. Recently, it has been revealed that these…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…