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

The tropical variety of a $d$-dimensional prime ideal in a polynomial ring with complex coefficients is a pure $d$-dimensional polyhedral fan. This fan is shown to be connected in codimension one. We present algorithmic tools for computing…

Gotzmann's Persistence states that the growth of an arbitrary ideal can be controlled by comparing it to the growth of the lexicographic ideal. This is used, for instance, in finding equations which cut out the Hilbert scheme (of subschemes…

Let $K$ be a number field, let $X$ be a smooth integral variety over $K$, and assume that there exists a finite set of finite places $S$ of $K$ such that the $S$-integral points on $X$ are dense. Then the combined conjectures of Campana and…

In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the $n$th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set…

We apply convex geometry (cones, fans) to homological input (abelian categories, hearts of bounded t-structures) to construct a new invariant of an abelian category, its heart fan. This can be viewed as a `universal phase diagram' for…

This is the first part of a work dedicated to the study of Bernstein-Sato polynomials for several analytic functions depending on parameters. The main result of this part is a constructibility result for the analytic Gr\"obner fan of a…

An association scheme is $P$-polynomial if and only if it consists of the distance matrices of a distance-regular graph. Recently, bivariate $P$-polynomial association schemes of type $(\alpha,\beta)$ were introduced by Bernard et al., and…

We show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Following Hausel-Hitchin, we investigate core Lagrangians and upward flows in Hilbert schemes of points on elliptic surfaces. We compute the scheme-theoretic multiplicities of core Lagrangians, as well as the equivariant multiplicities of…

We link $n$-jets of the affine monomial scheme defined by $x^p$ to the stable set polytope of some perfect graph. We prove that, as $p$ varies, the dimension of the coordinate ring of a certain subscheme of the scheme of $n$-jets as a…

In this paper, we study fan-planar drawings that use $h$ layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter…

We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…

We describe explicitly how certain standard opens of the Hilbert scheme of points are embedded into Grassmannians. The standard opens of the Hilbert scheme that we consider are given as the intersection of a corresponding basic open affine…

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

A graph $G$ with $p$ vertices and $q$ edges is said to be edge-graceful if its edges can be labeled from $1$ through $q$, in such a way that the labels induced on the vertices by adding over the labels of incident edges modulo $p$ are…