Related papers: A Hilbert scheme of radius two
As one type of incidence theory, the geometry of pentagram map seems quite classical at first. However, this is an excellent example of such a classical idea developed into a marvellous insight by some modern approach. We introduce an…
In this short article, we consider a problem about $2$-partition of the vertices of a graph. If a graph admits such a partition into some 'small' graphs, then the number of edges cross an arbitrary cut of the graph $e(S,S^{c})$ has a nice…
We study the geometric structure of the statistical models for two-by-two contingency tables. One or two odds ratios are fixed and the corresponding models are shown to be a portion of a ruled quadratic surface or a segment. Some pointers…
The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >=…
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
In this paper, we show the full flag Hilbert scheme of points of nodal curves has only complete intersection singularities. We study the Hilbert scheme of points of the cusp curve and show the punctual Hilbert scheme is isomorphic to…
In this note we present eleven unit distance embeddings of the Heawood graph, i.e. the point-line incidence graph of the finite projective plane of order two, by way of pictures and 15 digit approximations of the coordinates of the…
A graph {\it has cutwidth at most 2} if one can number its vertices by $1,\ldots n$ so that for every $i=1,\ldots,n-1$ there are at most 2 edges $(u,v)$ such that $u\le i<v$. A characterization of graphs having cutwidth at most 2 in terms…
We determine the class of the Hilbert scheme of points on a surface in the Grothendieck group of varieties. As a corollary we obtain its class in the Grothendieck group of motives. We give some applications to moduli spaces of sheaves on…
Let $X$ be a very general degree $d\geq 5$ hypersurface in $\mathbb{P}^3$. We compute the ample cone of the Hilbert scheme $X^{[n]}$ of $n$ points on $X$ for various small values of $n$ (the answer is already known for large $n$). We obtain…
Via the transverse Hilbert scheme construction, we associate a holomorphic completely integrable system to a surface $S$ endowed with a holomorphic symplectic form $\omega$ and a projection onto $\mathbb{C}$. We provide a full…
We describe the Hilbert schemes parametrizing curves on a cubic threefold of degree at most 5. In a forthcoming paper, we use this description to give a new proof and extension of a theorem of Iliev, Markushevich and Tikhimirov.
We construct nonnatural automorphisms of the Hilbert scheme of two points of some simple abelian variety preserving the big diagonal by considering automorphisms of the n-th product of the abelian varieties.
We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is…
We classify the irreducible components of the Hilbert scheme of $n$ points on non-reduced algebraic plane curves, and give a formula for the multiplicities of the irreducible components. The irreducible components are indexed by partitions…
A method of induction the distances with Hilbert structure is proposed. Some properties of the method are studied. Typical examples of corresponding metric spaces are discussed. Key words: Hilbert spaces; metric spaces; isometric embedding…
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…