Related papers: Isomorphism classes of cut loci for a cube

A planar PCC graph is a simple connected planar graph with everywhere positive combinatorial curvature which is not a prism or an antiprism and with all vertices of degree at least 3. We prove that every planar PCC graph has at most 208…

In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

We consider plane curves isomorphic to C*. We prove that with one exception the branches at infinity can be separated by an automorphism of C^2. We also give a bound for selfintersection number of the resolution curve.

Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every…

This article describes the geometry of isomorphisms between complements of geometrically irreducible closed curves in the affine plane $\mathbb{A}^2$, over an arbitrary field, which do not extend to an automorphism of $\mathbb{A}^2$. We…

We classify Coble surfaces with finite automorphism group in arbitrary characteristic not equal to 2. There are exactly 9 isomorphism classes of such surfaces.

We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the…

A rational face cuboid is a cuboid that all of edges, two of three face diagonals and space diagonal have rational lengths. \[ E_{1,s}: y^2=x(x-(2s)^2)(x+(s^2-1)^2) \] for a rational number $s \neq 0, \pm 1$, and define $\tilde{A}$…

We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…

We compute the rational Chow class of the locus of genus 2 curves admitting a d-to-1 map to a genus 1 curve, recovering a result of Faber-Pagani when d=2. The answer exhibits quasi-modularity properties similar to those in the Gromov-Witten…

We prove that if $A$ and $B$ are daisy cubes whose $\tau$-graphs are forests, then $A$ and $B$ are isomorphic if and only if their $\tau$-graphs are isomorphic. The result is applied to show that a daisy cube with at least one edge is the…

We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact…

As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…

We classify affine rank three Tits arrangements whose roots are contained in the locus of a homogeneous cubic polynomial. We find that there exist irreducible affine Tits arrangements which are not locally spherical.

Let G be a finite group, and $g \geq 2$. We study the locus of genus g curves that admit a G-action of given type, and inclusions between such loci. We use this to study the locus of genus g curves with prescribed automorphism group G. We…

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…

We show that up to isomorphism there are exactly twenty pairs $(C,E)$, where $C$ is a genus-$2$ curve over ${\mathbf C}$, where $E$ is an elliptic curve over ${\mathbf C}$, and where for every integer $n>1$ there is a map of degree $n$ from…

It is proved that the mapping class group of any closed surface with finitely many marked points is quasiisometric to a CAT(0) cube complex. We provide two distinct proofs, one tailored to mapping class groups, and one applying to a larger…