Related papers: Multigraded regularity of complete intersections

Let $k$ be an arbitrary field, $P = P_k^{m_1} \times_k \cdots \times_k P_k^{m_p}$ be a multiprojective space over $k$, and $X \subseteq P$ be a closed subscheme of $P$. We provide necessary and sufficient conditions for the positivity of…

The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…

We let R be a one-dimensional graded complete intersection, satisfying certain degree conditions which are satisfied whenever R is a numerical semigroup ring of embedding dimension at least three. We show that a graded maximal…

We show that the Hilbert-Kunz multiplicity of a $d$-dimensional nonregular complete intersection over the algebraic closure of $F_p$, $p>2$ prime, is bounded by below by the Hilbert-Kunz multiplicity of the hypersurface $\sum _{i=0}^{d}…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Punctual noncommutative Hilbert schemes are projective varieties parametrizing finite codimensional left ideals in noncommutative formal power series rings. We determine their motives and intersection cohomology, by constructing affine…

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…

Let X be a zero-dimensional scheme contained in a multiprojective space. Let $s_i$ be the length of the projection of X onto the i-th component of the multiprojective space. A result of Van Tuyl states that the Hilbert function of X, in the…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

We determine every Jordan type partition that occurs as the Jordan block decomposition for the multiplication map by a linear form in a height two homogeneous complete intersection (CI) Artinian algebra $A$ over an algebraically closed…

Let $p$ be a prime number, $\Bbbk$ a field of characteristic $p$ and $G$ a finite $p$-group. Let $V$ be a finite-dimensional linear representation of $G$ over $\Bbbk$. Write $S = \mathrm{Sym} V^*$. For a class of $p$-groups which we call…

We study the problem of maximizing the number of full degree vertices in a spanning tree $T$ of a graph $G$; that is, the number of vertices whose degree in $T$ equals its degree in $G$. In cubic graphs, this problem is equivalent to…

Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…

We give upper bounds for the dimension of the set of hypersurfaces of $\mathbb{P}^N$ whose intersection with a fixed integral projective variety is not integral. Our upper bounds are optimal. As an application, we construct, when possible,…

Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…

Correlations of active and passive random intersection graphs are studied in this letter. We present the joint probability generating function for degrees of $G^{active}(n,m,p)$ and $G^{passive}(n,m,p)$, which are generated by a random…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…