Related papers: Combinatorial construction of toric residues
An almost-toric hypersurface is parameterized by monomials multiplied by polynomials in one extra variable. We determine the Newton polytope of such a hypersurface, and apply this to give an algorithm for computing the implicit equation.
The Tautological Lamination arises in holomorphic dynamics as a combinatorial model for the geometry of 1-dimensional slices of the Shift Locus. In each degree $q$ the tautological lamination defines an iterated sequence of partitions of…
We prove the existence and give a classification of toric non-commutative crepant resolutions (NCCRs) of Gorenstein toric singularities with divisor class group of rank one. We prove that they correspond bijectively to non-trivial upper…
This paper studies two related subjects. One is some combinatorics arising from linear projections of polytopes and fans of cones. The other is quotient varieties of toric varieties. The relation is that projections of polytopes are related…
We consider subtorus actions on divisorial toric varieties. Here divisoriality means that the variety has many Cartier divisors like quasiprojective and smooth ones. We characterize when a subtorus action on such a toric variety admits a…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
Let $L$ be an ample line bundle over a smooth projective toric surface $X$. Then $L$ corresponds to a very ample lattice polytope $P$ that encodes many geometric properties of $L$. In this article, by studying $P$, we will give some…
Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…
Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…
We investigate combinatorial aspects of exceptional sequences in the derived category of coherent sheaves on certain smooth and complete algebraic surfaces. We show that to any such sequence there is canonically associated a complete toric…
For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most…
An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
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…