Related papers: Rotation invariants of two dimensional curves base…
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 present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two characterizations of decomposable models in terms of independence…
The purpose of this paper is to list the refined Humbert invariants for a given automorphism group of a curve $C/K$ of genus 2 over an algebraically closed field $K$ with characteristic $0$. This invariant is an algebraic generalization of…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
This paper introduces a deep learning system based on a quantum neural network for the binary classification of points of a specific geometric pattern (Two-Moons Classification problem) on a plane. We believe that the use of hybrid deep…
Rotation moment invariants have been of great interest in image processing and pattern recognition. This paper presents a novel kind of rotation moment invariants based on the Slepian functions, which were originally introduced in the…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
Recently, learning equivariant representations has attracted considerable research attention. Dieleman et al. introduce four operations which can be inserted into convolutional neural network to learn deep representations equivariant to…
We describe all possible bimodal over-twist patterns. In particular, we give an algorithm allowing one to determine what the left endpoint of the over-rotation interval of a given bimodal map is. We then define a new class of polymodal…
We find the complete equivalence group of a class of (1+1)-dimensional second-order evolution equations, which is infinite-dimensional. The equivariant moving frame methodology is invoked to construct, in the regular case of the…
We classify isomorphism-invariant random digraphs according to where randomness resides, namely, arcs, vertices, and vertices and arcs together which in turn yield arc random digraphs (ARD), vertex random digraphs (VRD) and vertex-arc…
The paper surveys variational approaches for image reconstruction in dynamic inverse problems. Emphasis is on methods that rely on parametrised temporal models. These are here encoded as diffeomorphic deformations with time dependent…
In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…
A number of machine learning tasks entail a high degree of invariance: the data distribution does not change if we act on the data with a certain group of transformations. For instance, labels of images are invariant under translations of…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
In this paper, we construct rotating frames for curves, including plane curves, space curves and curves on surfaces. Hence, the behaviour of an arbitrary moving point on a curve can be seen as the composite of linear motion and rotation.…
Inverse reinforcement learning (IRL) is computationally challenging, with common approaches requiring the solution of multiple reinforcement learning (RL) sub-problems. This work motivates the use of potential-based reward shaping to reduce…
Contours or closed planar curves are common in many domains. For example, they appear as object boundaries in computer vision, isolines in meteorology, and the orbits of rotating machinery. In many cases when learning from contour data,…