In this paper, we study the Hankel edge ideals of graphs. We determine minimal prime ideal labeled Hamiltonian and semi-Hamiltonian graphs, investigate radicality, being a complete intersection, almost intersection set-theoretic for such also consider trees with natural labeling, called rooted labeling. characterize whose is moreover, those initial respect to reverse lexicographic order satisfi...

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...

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

‎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...

We show that the Stanley-Reisner ideal of the one-dimensional simplicial complex whose diagram is an n-gon is always a set-theoretic complete intersection in any positive characteristic.

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted universal role quantifications, set union, intersection, subset and disjointness. A sound, complete and terminating consistency checking procedure is provided to...