Related papers: Minimal rational graphs admitting a QHD smoothing
Thanks to the recent work of Bhupal, Stipsicz, Szabo, and the author, one has a complete list of resolution graphs of weighted homogeneous complex surface singularities admitting a rational homology disk ("QHD") smoothing, i.e., one with…
In this paper we show that if the minimal good resolution graph of a normal surface singularity contains at least two nodes (i.e. vertex with valency at least 3) then the singularity does not admit a smoothing with Milnor fiber having…
We investigate the correspondence between three theories of deformations of rational surface singularities: de Jong and van Straten's picture deformations, Koll\'ar's P-resolutions, and Pinkham's smoothings of negative weights. We provide…
In this paper, a $\mathbb{Q}$HD singularity is a weighted homogeneous normal surface singularity admitting a rational homology disk ($\mathbb{Q}$HD) smoothing. These singularities are rational but often not log canonical. We classify all…
The rational blowdown operation in 4-manifold topology replaces a neighborhood of a configuration of spheres by a rational homology ball. Such configurations typically arise from resolutions of surface singularities that admit rational…
By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…
We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…
A cusp singularity is a surface singularity whose minimal resolution is a cycle of smooth rational curves meeting transversely. Cusp singularities come in naturally dual pairs. Looijenga proved in 1981 that if a cusp singularity is…
A cyclic quotient singularity of type $p^2/pq-1$ ($0<q<p, (p,q)=1$) has a smoothing whose Milnor fibre is a $\mathbb Q$HD, or rational homology disk (i.e., the Milnor number is $0$) ([9], 5.9.1). In the 1980's, we discovered additional…
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that…
In this paper we give a necessary combinatorial condition for a negative--definite plumbing tree to be suitable for rational blow--down, or to be the graph of a complex surface singularity which admits a rational homology disk smoothing.…
In this note, we prove that every even regular multigraph on $n$ vertices with multiplicity at most $r$ and minimum degree at least $rn/2 + o(n)$ has a Hamilton decomposition. This generalises a result of Vaughan who proved an asymptotic…
In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C^1 H-minimal graphs whose components of the unit horizontal Gauss map are in W^{1,1} are ruled surfaces with C^2 seed curves. In a different…
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…
A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…
In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined…
A general strategy is given for the classification of graphs of rational surface singularities. For each maximal rational double point configuration we investigate the possible multiplicities in the fundamental cycle. We classify completely…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…