Related papers: A Hilbert scheme of radius two
The Hilbert scheme of projective 3-folds of codimension 3 or more that are linear scrolls over the projective plane or over a smooth quadric surface or that are quadric or cubic fibrations over the projective line is studied. All known such…
Let $k$ be an algebraically closed field, and let $C\subset \mathbb{P}^n_k$ be a reduced closed subscheme with ideal sheaf $\mathcal{I}$. Let $\mathcal{I}^{<2>}$ be the second symbolic power of $\mathcal{I}$. When $C$ is an integral curve,…
Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph…
A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…
For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, for graphs $G$ with diameter 2, we show that…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We characterize Hilbert polynomials that give rise to Hilbert schemes with two Borel-fixed points and determine when the associated Hilbert schemes or their irreducible components are smooth. In particular, we show that the Hilbert scheme…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
We study an irreducible component H(X) of the Hilbert scheme Hilb^{2t+2}(X) of a smooth cubic hypersurface X containing two disjoint lines. For cubic threefolds, H(X) is always smooth, as shown in arXiv:2010.11622. We provide a second proof…
In this short note we present a far generalization of the following very well-known assertion: assume that we have two orthonormal sequences in a Hilbert space and these sequences are quadratically close to each other. Then if one of these…
It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.
An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least one of the following holds: $(a)$ $v = u$, $(b)$ $e = f$, or…
We study certain top intersection products on the Hilbert scheme of points on a nonsingular surface relative to an effective smooth divisor. We find a formula relating these numbers to the corresponding intersection numbers on the…
Generating Hilbert curves in Z^2 using L-systems appears to be efficient and easy
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…
The Hilbert scheme of n points in the projective plane has a natural stratification obtained from the associated Hilbert series. In general, the precise inclusion relation between the closures of the strata is still unknown. Guerimand…
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…