中文
相关论文

相关论文: Non-connected toric Hilbert schemes

200 篇论文

Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the…

计算几何 · 计算机科学 2012-10-22 Francisco Escalona , Ruy Fabila-Monroy , Jorge Urrutia

Let $\mathbb{k}$ be an algebraically closed field. We give a complete classification of non-connected pointed Hopf algebras of dimension $16$ with char$\,\mathbb{k}=2$ that are generated by group-like elements and skew-primitive elements.…

量子代数 · 数学 2022-09-05 Rongchuan Xiong

For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a finite set of forbidden minors F such that…

组合数学 · 数学 2013-12-09 Iain Crump

We generalize a result of Balister, Gy{\H{o}}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an $n$-vertex, $r$-uniform, connected, hypergraph with the maximum number of hyperedges, without a…

组合数学 · 数学 2021-04-29 Ervin Győri , Nika Salia , Oscar Zamora

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…

代数几何 · 数学 2007-05-23 GianMario Besana , Maria Lucia Fania

We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…

组合数学 · 数学 2012-01-13 Yasuyuki Tsukamoto

We classify the $5$-dimensional homogeneous geometries in the sense of Thurston. The present paper (part 2 of 3) classifies those in which the linear isotropy representation is either irreducible or trivial. The $5$-dimensional geometries…

几何拓扑 · 数学 2016-05-25 Andrew Geng

It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.

组合数学 · 数学 2014-12-30 Bartosz Walczak

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.

代数几何 · 数学 2024-12-12 Yuya Sasaki

We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an embedding enables utilisation of Hilbert…

度量几何 · 数学 2021-10-22 Atish Mitra , Žiga Virk

In the literature, various types of points and meager sets whose complements are connected have been studied, such as colocally connected points, non-weak cut points/sets, non-block points/sets, shore points/sets, etc. We extend that study,…

一般拓扑 · 数学 2024-03-26 Mauricio Chacón-Tirado , César Piceno

We propose exact count formulae for the 21 topologically distinct non-induced connected subgraphs on five nodes, in simple, unweighted and undirected graphs. We prove the main result using short and purely combinatorial arguments that can…

组合数学 · 数学 2020-09-25 Steve Lawford

A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the…

数据结构与算法 · 计算机科学 2022-11-29 Azzam Habib

We construct for all $ k\in \mathbb{N} $ a $ k $-edge-connected digraph $ D $ with $ s,t\in V(D) $ such that there are no edge-disjoint $ s \rightarrow t $ and $t\rightarrow s $ paths. We use in our construction "self-similar" graphs which…

组合数学 · 数学 2017-05-02 Attila Joó

A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at…

组合数学 · 数学 2011-04-01 Tomáš Kaiser , Petr Vrána

We construct a stratification of the punctual Hilbert scheme of points on a non-reduced and nodal plane curve, $x^uy^v=0$. Each stratum is indexed by a new combinatorial object we define: a weak diagonal partition. The approach is based on…

代数几何 · 数学 2026-04-07 Yuze Luan

In this paper, we construct infinitely many non-isotopic 3-knots in the 5-sphere, each of which has four critical points with respect to the standard height function of the 5-sphere. This contrasts with a theorem of Scharlemann which says…

几何拓扑 · 数学 2026-04-07 Seungwon Kim , Gheehyun Nahm , Alison Tatsuoka

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

群论 · 数学 2023-02-28 Mark V Lawson , Aidan Sims , Alina Vdovina

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

组合数学 · 数学 2018-10-02 Mónica Blanco , Francisco Santos

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

度量几何 · 数学 2016-03-17 Boris Lishak , Alexander Nabutovsky