Related papers: Functionality for isomorphism classes of curves an…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $K$ be a number field of degree four that is Galois over $\mathbb{Q}$. The goal of this article is to classify the different isomorphism types of $E(K)_{\text{tors}}$.
Isoparametric hypersurfaces and their application to special geometries
Cartan's method of moving frames is briefly recalled in the context of immersed curves in the homogeneous space of a Lie group $G$. The contact geometry of curves in low dimensional equi-affine geometry is then made explicit. This delivers…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
In this paper we solve the problem of analytic classification of plane curves singularities with two branches by presenting their normal forms. This is accomplished by means of a new analytic invariant that relates vectors in the tangent…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
We show the fundamental theorems of curves and surfaces in the 3-dimensional Heisenberg group and find a complete set of invariants for curves and surfaces respectively. The proofs are based on Cartan's method of moving frames and Lie group…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood…
The conformal nature of smooth curves in $\mathbb{R}^3$ is characterised by conformal length, curvature and torsion. We present a derivation of these conformal parameters via a limiting process using inscribed polygons with circular edges .…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…
We report on the computation of invariants, covariants, and contravariants of cubic surfaces. All algorithms are implemented in the computer algebra system magma.
We propose a robust classification algorithm for curves in 2D and 3D, under the special and full groups of affine transformations. To each plane or spatial curve we assign a plane signature curve. Curves, equivalent under an affine…
We use the notion of isomorphism between two invariant vector fields to shed new light on the issue of linearization of an invariant vector field near a relative equilibrium. We argue that the notion is useful in understanding the passage…
Consider a smooth projective curve and a given embedding into projective space via a sufficiently positive line bundle. We can form the secant variety of $k$-planes through the curve. These are singular varieties, with each secant variety…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…