English
Related papers

Related papers: Non-connected toric Hilbert schemes

200 papers

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

Metric Geometry · Mathematics 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…

Metric Geometry · Mathematics 2017-08-23 Lauri Loiskekoski , Günter M. Ziegler

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Combinatorics · Mathematics 2021-08-23 C. M. Mynhardt , A. K. Wright

We show that, if a $n$-vertex triangulation $T$ of maximum degree $\Delta$ has a dual that contains a cycle of length $\ell$, then $T$ has a non-crossing straight-line drawing in which some \emph{collinear set} of $\Omega(\ell/\Delta^4)$…

Combinatorics · Mathematics 2020-09-07 Vida Dujmović , Pat Morin

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Combinatorics · Mathematics 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Combinatorics · Mathematics 2023-11-14 Vincent Pilaud , Guillermo Pineda-Villavicencio , Julien Ugon

We further the study of local profiles of trees. Bubeck and Linial showed that the set of 5-profiles contains a certain polytope, namely the convex hull of d-millipedes, and they proved that the segment [0-millipede, 1-millipede]…

Combinatorics · Mathematics 2016-01-11 Sébastien Bubeck , Katherine Edwards , Horia Mania , Cathryn Supko

Given a set of points $S \subseteq \mathbb{R}^2$, a subset $X \subseteq S$ with $|X|=k$ is called $k$-gon if all points of $X$ lie on the boundary of the convex hull of $X$, and $k$-hole if, in addition, no point of $S \setminus X$ lies in…

Combinatorics · Mathematics 2020-05-21 Manfred Scheucher

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

Geometric Topology · Mathematics 2019-10-24 Benjamin A. Burton , Jonathan Spreer

We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…

Algebraic Geometry · Mathematics 2026-05-01 Petr Hrubý , Elima Shehu

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

Combinatorics · Mathematics 2017-04-14 Joanna B. Fawcett

The 3-decomposition conjecture is wide open. It asserts that every finite connected cubic graph can be decomposed into a spanning tree, a disjoint union of cycles, and a matching. We show that every such decomposition is derived from a…

Combinatorics · Mathematics 2022-02-22 Oliver Bachtler , Irene Heinrich

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

Discrete Mathematics · Computer Science 2017-05-05 Rebecca Robinson , Graham Farr

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Symbolic Computation · Computer Science 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.

Combinatorics · Mathematics 2024-11-18 Demet Taylan

The Hilbert scheme $S^{[n]}$ of points on an algebraic surface $S$ is a simple example of a moduli space and also a nice (crepant) resolution of singularities of the symmetric power $S^{(n)}$. For many phenomena expected for moduli spaces…

Algebraic Geometry · Mathematics 2007-05-23 Lothar Göttsche

We present a complete classification of the geometry of the mutually complementary sets of entangled and separable states in three-dimensional Hilbert subspaces of bipartite and multipartite quantum systems. Our analysis begins by finding…

Quantum Physics · Physics 2024-06-24 Rotem Liss , Tal Mor , Andreas Winter

The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partially ordered sets to be associated with any triangulation of a…

Combinatorics · Mathematics 2018-10-30 Benjamin Assarf , Michael Joswig , Julian Pfeifle

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…

Algebraic Geometry · Mathematics 2022-11-15 Ritvik Ramkumar