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

The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...

A tropical complete intersection curve C ⊆ Rn+1 is a transversal intersection of n smooth tropical hypersurfaces. We give a formula for the number of vertices of C given by the degrees of the tropical hypersurfaces. We also compute the genus of C (defined as the number of independent cycles of C) when C is smooth and connected. 1 Notation and definitions We work over the tropical semifield Rtr=...

We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are M parties, each storing a data P i over N replicated and non-colluding databases, we want to calculate sets ∩ xmlns:xlink="http://www.w3.org/1999/xl...

An obstruction theory for representing homotopy classes of surfaces in 4–manifolds by immersions with pairwise disjoint images is developed, using the theory of non-repeating Whitney towers. The accompanying higher-order intersection invariants provide a geometric generalization of Milnor’s link-homotopy invariants, and can give the complete obstruction to pulling apart 2–spheres in certain fam...

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Fur...

‎let $x=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the hankel matrix of size $2times n$ and let $g$ be a closed graph on the vertex set $[n].$ we study the binomial ideal $i_gsubset k[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $x$ which correspond to the edges of $g.$ we show that...