相关论文: The Gr\"obner fan of the Hilbert scheme

We focus on strongly connected, strong for short, digraphs since in this setting distance is defined for every pair of vertices. Distance ideals generalize the spectrum and Smith normal form of several distance matrices associated with…

The monopole formula provides the Hilbert series of the Coulomb branch for a 3-dimensional N=4 gauge theory. Employing the concept of a fan defined by the matter content, and summing over the corresponding collection of monoids, allows the…

The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs. In this paper, we establish a hypergraph Heilmann--Lieb…

We investigate polytopes inscribed into a sphere that are normally equivalent (or strongly isomorphic) to a given polytope $P$. We show that the associated space of polytopes, called the inscribed cone of $P$, is closed under Minkowski…

Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge.…

The intersection of a complex plane curve with a small three-sphere surrounding one of its singularities is a non-trivial link. The refined punctual Hilbert schemes of the singularity parameterize subschemes supported at the singular point…

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

We study the locus of the liftings of a homogeneous ideal $H$ in a polynomial ring over any field. We prove that this locus can be endowed with a structure of scheme $\mathrm L_H$ by applying the constructive methods of Gr\"obner bases, for…

We show that the cohomology ring of Hilbert scheme of $n$-points in the affine plane is isomorphic to the coordinate ring of $\mathbb{G}_{m}$-fixed point scheme of the $n$-th symmetric product of $\mathbb{C}^{2}$ for a natural…

In this paper, we give new explicit representations of the Hilbert scheme of $\mu$ points in $\PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous…

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

The multigraded Hilbert scheme parametrizes all homogeneous ideals in a polynomial ring graded by an abelian group with a fixed Hilbert function. We prove that any multigraded Hilbert scheme is smooth and irreducible when the polynomial…

Following DeMeyer, Ford & Miranda [DFM93], we define a topology on a fan by declaring open sets to be its subfans. Then, like Kato [Kat94], we make our fans into monoided spaces by associating a sheaf of monoids to each fan. (Our sheaf of…

Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…

We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an induced subgraph $H$ of a graph $G$ is $f$-heavy if for…

We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically,…

The T-graph of a multigraded Hilbert scheme records the zero and one-dimensional orbits of the T = (K^*)^n action on the Hilbert scheme induced from the T-action on A^n. It has vertices the T-fixed points, and edges the one-dimensional…