Almost set-theoretic complete intersections in characteristic zero

Let $I_M$ and $I_N$ be defining ideals of toric varieties such that $I_M$ is a projection of $I_N$, i.e. $I_N \subseteq I_M$. We give necessary and sufficient conditions for the equality $I_M=rad(I_N+(f_1,...,f_s))$, where $f_1,...,f_s$ belong to $I_M$. Also a method for finding toric varieties which are set-theoretic complete intersection is given. Finally we apply our method in the computation of the arithmetical rank of certain toric varieties and provide the defining equa...

Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete intersections. We illustrate our main result by giving different infinite families of examples. Our proof is constructive and provides one binomial and $(n-2)$ polynomial explicit equations for the hypersurfaces cutting out the curve in question.

We present some results on projective toric varieties which are relevant in Diophantine geometry. We interpret and study several invariants attached to these varieties in geometrical and combinatorial terms. We also give a B\'ezout theorem for the Chow weights of projective varieties and an application to the theorem of successive minima.

Let $(X, A)$ be a polarized nonsingular toric 3-fold with not effective $A+K_X$. Then for any ample line bundle $L$ on $X$ the image of the embedding by the complete linear system of $L$ is an intersections of quadrics.

A signed graph is a pair $(G,\tau)$ of a graph $G$ and its sign $\tau$, where a \textit{sign} $\tau$ is a function from $\{ (e,v)\mid e\in E(G),v\in V(G), v\in e\}$ to $\{1,-1\}$. Note that graphs or digraphs are special cases of signed graphs. In this paper, we study the toric ideal $I_{(G,\tau)}$ associated with a signed graph $(G,\tau)$, and the results of the paper give a unified idea to explain some known results on the toric ideals of a graph or a digraph. We characteri...

We present two algorithms determining all the complete and simplicial fans admitting a fixed non-degenerate set of vectors $V$ as generators of their 1-skeleton. The interplay of the two algorithms allows us to discerning if the associated toric varieties admit a projective embedding, in principle for any values of dimension and Picard number. The first algorithm is slower than the second one, but it computes all complete and simplicial fans supported by $V$ and lead us to fo...

We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity assumptions on the coefficients of the polynomials. Using these formulas, we identify at which degrees generic systems in polytopal algebras form regular sequences. Our motivation comes from sparse elimination theory, where knowing the expect...

In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation codes on complete intersections in the projective space.

Some diophantine aspects of projective toric varieties: We present several faces of projective toric varieties, of interest from the point of view of diophantine geometry. We make explicit the theory on a number of meaningful examples and we also prove a Bezout type theorem for Chow weight of projective varieties.

We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric varieties as well as algorithms checking properties (i) and (ii) and further potential properties, in Particular a weaker version of (ii) asking for scheme-theoretic definition in degree 2.