Related papers: A simpler $\mathbb R^3$ realization of the M\"obiu…

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

Smooth real cubic surfaces are birationally trivial (over $\R$) if and only if their real locus is connected or, equivalently, if and only if they have two skew real lines or two skew complex conjugate lines. In such a case a…

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

It is shown that the edge ring of a finite connected simple graph with a $3$-linear resolution is a hypersurface.

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.

In this paper we derive a representation of an arbitrary real matrix M as the difference of a real matrix A and the transpose of its inverse. This expression may prove useful for progressing beyond known results for which the appearance of…

We show that there are minimal graphs in R^{n+1} whose intersection with the portion of the horizontal hyperplane contained in the unit ball has any prescribed geometry, up to a small deformation. The proof hinges on the construction of…

A symplectic toric orbifold is a compact connected orbifold $M$, a symplectic form $\omega$ on $M$, and an effective Hamiltonian action of a torus $T$ on $M$, where the dimension of $T$ is half the dimension of $M$. We prove that there is a…

In this paper, we propose a method to obtain a compact and accurate 3D wireframe representation from a single image by effectively exploiting global structural regularities. Our method trains a convolutional neural network to simultaneously…

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

We give a short proof of Bing's characterization of $S^3$: a compact, connected 3-manifold $M$ is $S^3$ if and only if every knot in $M$ is isotopic into a ball.

This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…

We introduce the M-representation of polytopes, which makes it possible to compute linear transformations, convex hulls, and Minkowski sums with linear complexity in the dimension of the polytopes. When the polytope is a convex hull of a…

We derive self-similar string solutions in a graph representation, near the point of singularity formation, which can be shown to extend to point-like singularities on M-branes, as well as to the radially symmetric case.

A new, simple method to approach enumerative questions about rational curves on rational surfaces is described. Applications include a short proof of Kontsevich's formula for plane curves and a the solution of the analogous problem for the…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…