Related papers: Isomorphism classes of cut loci for a cube

We classify all possible automorphism groups of smooth cubic surfaces over an algebraically closed field of arbitrary characteristic. As an intermediate step we also classify automorphism groups of quartic del Pezzo surfaces. We show that…

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…

Let $\C$ be a genus 2 curve defined over $k$, $char (k) =0$. If $\C$ has a $(3,3)$-split Jacobian then we show that the automorphism group $Aut(\C)$ is isomorphic to one of the following: $\bZ_2, V_4, D_8$, or $D_{12}$. There are exactly…

Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…

Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 90^\circ$ and $\pm 180^\circ$, and allowing faces of the cube to be covered multiple times?…

A cubic space is a vector space equipped with a symmetric trilinear form. Two cubic spaces are isogeneous if each embeds into the other. A cubic space is non-degenerate if its form cannot be expressed as a finite sum of products of linear…

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…

We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice ${\bf Z}_n$. We also consider some relatives of those 28 partitions,…

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

We present a computational study of smooth curves of degree six in the real projective plane. In the Rokhlin-Nikulin classification, there are 56 topological types, refined into 64 rigid isotopy classes. We developed software that…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

A superspecial curve is a (non-singular) curve over a field of positive characteristic whose Jacobian variety is isomorphic to a product of supersingular elliptic curves over the algebraic closure. It is known that for given genus and…

A perfect cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The existence of such cuboids is neither proved, nor disproved. A rational perfect cuboid is a natural…

The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…

Considering regions in a map to be adjacent when they have nonempty intersection (as opposed to the traditional view requiring intersection in a linear segment) leads to the concept of a facially complete graph: a plane graph that becomes…

We consider unbounded curves without endpoints. Isomorphism is equivalence up to translation. Self-avoiding plane-filling curves cannot be periodic, but they can satisfy the local isomorphism property: We obtain a set $\Omega $ of coverings…