Related papers: K5 and K3,3 are Toroidal Penny Graphs
We study tautological vector bundles over the Hilbert scheme of points on surfaces. For each K-trivial surface, we write down a simple criterion ensuring that the tautological bundles are big and nef, and illustrate it by examples. In the…
A rational triangle is a triangle with rational sides and rational area. A Heron triangle is a triangle with integral sides and integral area. In this article we will show that there exist infinitely many rational parametrizations, in terms…
We classify $T^2$-GKM fibrations in which both fiber and base are the GKM graph of $S^4$, with standard weights in the base. For each case in which the total space is orientable, we construct, by explicit clutching, a realization as a…
We investigate the universal Severi variety of rational curves on K3 surfaces, which parametrises irreducible rational curves in a fixed class on varying K3 surfaces of fixed genus. We investigate the conjecuted irreducibility of this space…
We prove that if G is a 4-critical graph of girth at least five then |E(G)|>=(5|V(G)|+2)/3. As a corollary, graphs of girth at least five embeddable in the Klein bottle or torus are 3-colorable. These are results of Thomas and Walls, and…
We classify the possible torsion structures of rational elliptic curves over quintic number fields. In addition, let E be an elliptic curve defined over Q and let G = E(Q)_tors be the associated torsion subgroup. We study, for a given G,…
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…
The Kelmans-Seymour conjecture states that the 5-connected nonplanar graphs contain a subdivided $K_{_5}$. Certain questions of Mader propose a "plan" towards a possible resolution of this conjecture. One part of this plan is to show that a…
Four-dimensional CFTs dual to branes transverse to toric Calabi-Yau threefolds have been described by bipartite graphs on a torus (dimer models). We use the theory of dessins d'enfants to describe these in terms of triples of permutations…
Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
We proved that the union of rational curves is dense on a very general K3 surface and the union of elliptic curves is dense in the 1st jet space of a very general K3 surface, both in the strong topology.
We extend our recent study of K3 metrics near the $T^4/Z_2$ orbifold locus to the other torus orbifold loci. In particular, we provide several new constructions of K3 surfaces as hyper-K\"ahler quotients, which yield new formulae for K3…
We study certain pencils of del Pezzo surfaces generated by a smooth del Pezzo surface S of degree less or equal to 3 anti-canonically embedded into a weighted projective space P and an appropriate multiple of a hyperplane H. Our main…
We show that any effective isometric torus action of maximal rank on a compact Riemannian manifold with positive (sectional) curvature and maximal symmetry rank, that is, on a positively curved sphere, lens space, complex or real projective…
We show how to construct non-isotrivial families of supersingular K3 surfaces over rational curves using a relative form of the Artin-Tate isomorphism and twisted analogues of Bridgeland's results on moduli spaces of stable sheaves on…
Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…
Given a graph H, we call a graph $\textit{H-free}$ if it does not contain H as a subgraph. The planar Tur\'an number of a graph H, denoted by $ex_{\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
It is shown that for any locally knotted edge of a 3-connected graph in $S^3$, there is a ball that contains all of the local knots of that edge and is unique up to an isotopy setwise fixing the graph. This result is applied to the study of…