English
Related papers

Related papers: Non-connected toric Hilbert schemes

200 papers

This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…

Functional Analysis · Mathematics 2025-08-12 Anish Banerjee , Hiranmoy Garai , Pratikshan Mondal , Lakshmi Kanta Dey

We construct infinitely many non-diffeomorphic examples of $5$-dimensional contact manifolds which are tight, admit no strong fillings, and do not have Giroux torsion. We obtain obstruction results for symplectic cobordisms, for which we…

Symplectic Geometry · Mathematics 2021-01-29 Agustin Moreno

There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…

Combinatorics · Mathematics 2019-08-29 Rishi Advani

We prove that closed connected contact manifolds of dimension $\geq 5$ related by an h-cobordism with a flexible Weinstein structure become contactomorphic after some kind of stabilization. We also provide examples of non-conjugate contact…

Symplectic Geometry · Mathematics 2016-09-27 Sylvain Courte

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

Discrete Mathematics · Computer Science 2023-03-14 Paul Bastide , Linda Cook , Jeff Erickson , Carla Groenland , Marc van Kreveld , Isja Mannens , Jordi L. Vermeulen

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Combinatorics · Mathematics 2007-05-23 Klavdija Kutnar , Dragan Marusic

We give a characterisation of Atiyah's and Hitchin's transverse Hilbert schemes of points on a symplectic surface in terms of bi-Poisson structures. Furthermore, we describe the geometry of hyperk\"ahler manifolds arising from the…

Differential Geometry · Mathematics 2020-09-29 Roger Bielawski

We show that Brill--Noether loci in Hilbert scheme of points on a smooth connected surface $S$ are non-empty whenever their expected dimension is positive, and that they are irreducible and have expected dimensions. More precisely, we…

Algebraic Geometry · Mathematics 2023-10-17 Arend Bayer , Huachen Chen , Qingyuan Jiang

We construct a non-Hamiltonian symplectic circle action on a closed, connected, six-dimensional symplectic manifold with exactly 32 fixed points.

Differential Geometry · Mathematics 2015-10-13 Susan Tolman

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…

We consider the multigraded Hilbert scheme corresponding to the Hilbert function of a finite number of points in general position in a smooth projective complex toric variety. We develop several criteria for a point of that parameter space…

Algebraic Geometry · Mathematics 2023-06-16 Tomasz Mańdziuk

We expand the class of linear symmetric equations for which large sets with no non-trivial solutions are known. Our idea is based on first finding a small set with no solutions and then enlarging it to arbitrary size using a…

Number Theory · Mathematics 2024-08-21 Tomasz Kosciuszko

In this paper we construct $G$-Hilbert schemes for finite group schemes $G$. We find a construction of $G$-Hilbert schemes as relative $G$-Hilbert schemes over the quotient that does not need the Hilbert scheme of $n$ points, works under…

Algebraic Geometry · Mathematics 2011-10-26 Mark Blume

We study the Hilbert series for $5d$ Superconformal Field Theories (SCFTs) engineered by Generalized Toric Polygons (GTPs), which extend the geometric realization of these theories from toric Calabi-Yau 3-folds to theories associated to…

High Energy Physics - Theory · Physics 2025-09-12 Ignacio Carreño Bolla , Sebastián Franco , Diego Rodríguez-Gómez

This note is motivated by the Question 16 of http://cubics.wikidot.com: Which configurations of 15 points in the projective 3-space arise as eigenpoints of a cubic surface? We prove that a general eigenscheme in the projective n-space is…

Algebraic Geometry · Mathematics 2022-05-12 Valentina Beorchia , Rosa M. Miró-Roig

We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for…

Geometric Topology · Mathematics 2012-12-07 Samia Ashraf , Barbu Berceanu

C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…

Combinatorics · Mathematics 2018-01-17 S. Kh. Darbinyan

We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.

Combinatorics · Mathematics 2016-02-08 Rémy Belmonte , Archontia Giannopoulou , Daniel Lokshtanov , Dimitrios M. Thilikos
‹ Prev 1 3 4 5 6 7 10 Next ›