Related papers: Isomorphism classes of cut loci for a cube
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…
The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…
We obtain an explicit formula for the number of rational cuspidal curves of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed as an Euler…
A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over…
It is proved that the rank of an elliptic curve is one less the arithmetic complexity of the corresponding non-commutative torus. As an illustration, we consider a family of elliptic curves with complex multiplication.
This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these…
Since the introduction of the concept of isotopism of algebras by Albert in 1942, a prolific literature on the subject has been developed for distinct types of algebras. Nevertheless, there barely exists any result on the problem of…
Classification of cubics (that is, third order planar curves in the $R^2$ up to certain transformations is interested since Newton, and treated by several authors. We classify cubics up to affine transformations, in seven class, and give a…
We prove that if two closed, connected, regular cosymplectic manifolds have isomorphic groups of cosymplectomorphisms (as topological groups), then the underlying manifolds are diffeomorphic. The proof proceeds by characterizing the Reeb…
Start with Gott (2019)'s envelope polyhedron (Squares-4 around a point): a unit cube missing its top and bottom faces. Stretch by a factor of 2 in the vertical direction so its sides become (2x1 unit) rectangles. This has 8 faces (4…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
Let $E/\mathbb{Q}$ be an elliptic curve and let $\mathbb{Q}(3^\infty)$ be the compositum of all cubic extensions of $\mathbb{Q}$. In this article we show that the torsion subgroup of $E(\mathbb{Q}(3^\infty))$ is finite and determine 20…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
Using moduli of equinormalized curves and Ishii's theory of territories, we prove that the moduli stack of all reduced n-pointed algebraic curves of fixed arithmetic genus is connected.
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
In this paper, we classify the class of constant weighted curvature curves in the plane with a log-linear density, or in other words, classify all traveling curved fronts with a constant forcing term in $\Bbb R^2.$ The classification gives…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices…