相关论文: The Limiting Polytope of the Generic Initial Syste…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

We consider the polynomial ring in finitely many variables over an algebraically closed field of positive characteristic, and initiate the systematic study of ideals preserved by the action of the general linear group by changes of…

The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of…

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…

We deal with the complete-intersection property of maximally differential ideals. Also, we connect the Gorenstein homology of derivations to the Gorenstein property of the base rings. These equipped with some applications.

Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P^n, n>=3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and…

Let $R$ be a commutative $G$-graded ring with a nonzero unity. In this article, we introduce the concept of graded radically principal ideals. A graded ideal $I$ of $R$ is said to be graded radically principal if $Grad(I)=Grad(\langle…

The toric ring together with the toric ideal arising from a nested configuration is studied, with particular attention given to the algebraic study of normality of the toric ring as well as the Gr\"obner bases of the toric ideal. One of the…

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

We determine the simplicial compleses $\Delta$ whose Stanley-Reisner ideals $I_\Delta$ have the following property: for all $n\geq 1$ the powers $I_\Delta^n$ have linear resolutions and finite length local cohomologies.

Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate the generalized binomial edge ideal $J_{m}(G)$ in the polynomial ring $R=K[x_{ij}: i \in [m], j \in [n]]$. We provide a lower bound for the…

A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

A commutative local ring is generally defined to be a complete intersection if its completion is isomorphic to the quotient of a regular local ring by an ideal generated by a regular sequence. It has not previously been determined whether…

We study powers of binomial edge ideals associated with closed and block graphs.

Let $L\subset \mathbb{Z}^n$ be a lattice and $I_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle$ be the corresponding lattice ideal in $\Bbbk[x_1,\ldots, x_n]$, where $\Bbbk$ is a field. In this paper we describe minimal…

Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$ and $I\subset S$ be a squarefree monomial ideal generated in degree $n-2$. Motivated by the remarkable behavior of the powers of $I$ when $I$ admits a linear resolution, as…