Related papers: A Hilbert scheme of radius two

In this paper we prove two results which further classify smoothness properties of Hilbert schemes of points. This is done by counting classes of arrows on Young diagrams corresponding to monomial ideals, building on the approach taken by…

Let B be a ring and $A=B[X,Y]/(aX^2+bXY+cY^2-1)$ where $a,b,c\in B$. We study the smoothness of A over B, and the regularity of B when B is a ring of algebraic integers.

A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…

Let X be a quasiprojective smooth surface defined over an algebraically closed field of positive characteristic. We show that if X is Frobenius split then so is the Hilbert scheme Hilb^n(X) of n points in X. In particular, we get the higher…

An incidence of a hypergraph $\mathcal{H}=(X,S)$ is a pair $(x,s)$ with $x\in X$, $s\in S$ and $x\in s$. Two incidences $(x,s)$ and $(x',s')$ are adjacent if (i) $x=x'$, or (ii) $\{x,x'\}\subseteq s$ or $\{x,x'\}\subseteq s'$. A proper…

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…

An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.

Bipartite incidence graph sampling provides a unified representation of many sampling situations for the purpose of estimation, including the existing unconventional sampling methods, such as indirect, network or adaptive cluster sampling,…

Given a smooth projective variety $X$ over an algebraically closed field $k$, we compute the Chow ring of the Hilbert scheme of three points on $X$, $\operatorname{Hilb}^3(X)$, as an algebra with generators and relations over the Chow ring…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…

We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…

Let $N_2DL(v)$ denote the set of degrees of vertices at distance 2 from $v$. The $2$-neighborhood degree list of a graph is a listing of $N_2DL(v)$ for every vertex $v$. A degree restricted $2$-switch on edges $v_1v_2$ and $w_1w_2$, where…

Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $\lambda =\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the…

The aim of this paper is to describe the closure of the numerical range of the product of two orthogonal projections in Hilbert space as a closed convex hull of some explicit ellipses parametrized by points in the spectrum. Several…

We study the geometry and topology of Hilbert schemes of points on the orbifold surface [C^2/G], respectively the singular quotient surface C^2/G, where G is a finite subgroup of SL(2,C) of type A or D. We give a decomposition of the…

In this paper we prove that, for any $n\ge 3$, there exist infinitely many $r\in \N$ and for each of them a smooth, connected curve $C_r$ in $\P^r$ such that $C_r$ lies on exactly $n$ irreducible components of the Hilbert scheme…

The rational Chow ring A?(S[n],Q) of the Hilbert scheme S[n] parametrising the length n zero-dimensional subschemes of a toric surface S can be described with the help of equivariant techniques. In this paper, we explain the general method…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.