相关论文: A Hilbert scheme of radius two

We show that the points of a global function field, whose classes are 2-divisible in the Picard group, form a connected graph, with the incidence relation generalizing the well known quadratic reciprocity law. We prove that for every global…

Let HH_{ab}(H) be the equivariant Hilbert scheme parametrizing the zero dimensional subschemes of the affine plane k^2, fixed under the one dimensional torus T_{ab}={(t^{-b},t^a), t\in k^*} and whose Hilbert function is H. This Hilbert…

Let $k$ be an algebraically closed field of characteristic $p > 3$. Let $X$ be an irreducible smooth projective surface over $k$. Fix an integer $n \geq 1$ and let ${\mathcal{H}{\it ilb}}_X^n$ be the Hilbert scheme parameterizing effective…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

We consider imprimitive association schemes of class four which are two-fold covers of strongly regular graphs with spreads. It will be shown that a two-fold cover of a strongly regular graph with a spread provides a five class fission…

Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.

We study the structure of the relative Hilbert scheme for a family of nodal (or smooth) curves via its natural cycle map to the relative symmetric product. We show that the cycle map is the blowing up of the discriminant locus, which…

In this paper we generalize an explicit numerical scheme for the CIR process that we have proposed before. The advantage of the new proposed scheme is that preserves positivity and is well posed for a (little bit) broader set of parameters…

We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…

Let X be a smooth projective surface of irregularity 0. The Hilbert scheme of n points on X parameterizes zero-dimensional subschemes of X of length n. In this paper, we discuss general methods for studying the cone of ample divisors on the…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

The cycle space of a graph corresponds to the kernel of an incidence matrix. We investigate an analogous subspace for digraphs. In the case of digraphs of graphs, where every edge is replaced by two oppositely directed arcs, we give a…

We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…

We study double affine Hecke algebras at roots of unity and their relations with deformed Hilbert schemes.

We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…

We describe Hilbert's spacefilling curve in several different ways: as an automatic sequence of directions,as a regular and synchronized sequence of coordinates of lattice points encountered, and as an automatic bitmap image.

We show that every automorphism of the Hilbert scheme of $n$ points on a weak Fano or general type surface is natural, i.e. induced by an automorphism of the surface, unless the surface is a product of curves and $n=2$. In the exceptional…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…