Related papers: Non-connected toric Hilbert schemes

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

For $d \ge 2$, we show that all graphs of $d$-polytopes have a Hamiltonian line graph if and only if $d \ne 3$: We exhibit a graph of a $3$-polytope on $252$ vertices whose line graph does not even have Hamiltonian paths. Adapting a…

In this paper we consider linear systems of $\mathbb{P}^2$ with all but one of the base points of multiplicity 5. We give an explicit way to evaluate the dimensions of such systems.

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar)…

The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…

For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This strengthens…

We characterise the quintic (i.e. 5-regular) multigraphs with the property that every edge lies in a triangle. Such a graph is either from a set of small graphs or is formed by adding a perfect matching to a line graph of a cubic graph as…

We prove that the Gorenstein locus of the Hilbert scheme of points on $\mathbb A^n$ is non-reduced for $n\geq 12$; we construct examples of non-reduced points that come from apolar algebras of the sum of general cubics. As a corollary, we…

Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…

Given a sequence of oriented links L^1,L^2,L^3,... each of which has a distinguished, unknotted component, there is a decomposition of the 3-sphere naturally associated to it, which is constructed as the components of the intersection of an…

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…

We call a polytope P of dimension 3 admissible if it has the following two properties: (1) for each vertex of P the set of its first-neighbours is coplanar; (2) all planes determined by the first-neighbours are distinct. It is shown that…

The torus T of projective space also acts on the Hilbert scheme of subschemes of projective space. The T-graph of the Hilbert scheme has vertices the fixed points of this action, and edges connecting pairs of fixed points in the closure of…

This work presents an initial analysis of using bijective mappings to extend the Theory of Functional Connections to non-rectangular two-dimensional domains. Specifically, this manuscript proposes three different mappings techniques: a)…

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

We give several new constructions for moderate rank elliptic curves over $\mathbb{Q}(T)$. In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over $\mathbb{Q}$ using polynomials of…

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…