Related papers: Isomorphism classes of cut loci for a cube

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

Let X be a closed oriented Riemann surface of genus > 1 of constant negative curvature -1. A surface containing a disk of maximal radius is an optimal surface. This paper gives exact formulae for the number of optimal surfaces of genus > 3…

The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…

We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…

We classify closed, simply-connected, non-negatively curved 6-manifolds of almost maximal symmetry rank up to equivariant diffeomorphism.

We ask about the simply connected compact smooth 6-manifolds which can support structures of Calabi-Yau threefolds. In particular, we study the interesting case of Calabi-Yau threefolds $X$ with second betti number 3. We have a cup-product…

We investigate asymptotically flat manifolds with cone structure at infinity. We show that any such manifold M has a finite number of ends. For simply connected ends we classify all possible cones at infinity, except for the 4-dimensional…

We present a database of rational elliptic curves, up to Q-isomorphism, with good reduction outside {2,3,5,7,11,13}. We provide a heuristic involving the abc and BSD conjectures that the database is likely to be the complete set of such…

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

It is well known that there exist twenty two symmetry type graphs associated to 4-orbit maps. For this ones we give the feasible values taken by the degree of the vertices and the number appropriate of edges in the boundary of each face of…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…

Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.

We establish a classification of cubic minimal cones in case of the so-called radial eigencubics. Our principal result states that any radial eigencubic is either a member of the infinite family of eigencubics of Clifford type, or belongs…

We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…

We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…

We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating…

A connected r-regular graph, where $r \geq 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participates in some perfect matching. We set out to: (i) characterize…

The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…

If the vertices composing a network interact at distinct time points, the temporal ordering of these interactions and the network's graph structure are sufficient to convey the routes by which information can flow in the network. Two…