Related papers: The Non-Euclidean Euclidean Algorithm

We build and investigate a pure gauge theory on arbitrary discrete groups. A systematic approach to the construction of the differential calculus is presented. We discuss the metric properties of the models and introduce the action…

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

The goal of this article is to show that five explicitly given transformations, a rotation, two screw Heisenberg rotations, a vertical translation and an involution generate the Euclidean Picard modular groups with coefficient in the…

We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate…

Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…

We describe an algorithm to decide whether two genus-two surfaces embedded in the 3-sphere are isotopic or not. The algorithm employs well-known techniques in 3-manifolds topology, as well as a new algorithmic solution to a problem on free…

Discussed is mechanics of objects with internal degrees of freedom in generally non-Euclidean spaces. Geometric peculiarities of the model are investigated detailly. Discussed are also possible mechanical applications, e.g., in dynamics of…

A non-Euclidean generalization of conditional expectation is introduced and characterized as the minimizer of expected intrinsic squared-distance from a manifold-valued target. The computational tractable formulation expresses the…

To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison…

We introduce an algorithm based on Generalized Dual Method (GDM) to efficiently study the dynamics of a particle in quasiperiodic environments without the need to use periodic approximations or to save the information of the vertices that…

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…

We present a decoupled algorithm for motion planning for a collection of unit-balls moving among polyhedral obstacles in $\mathbb{R}^d$, for any $d \ge 2$. We assume that the robots have revolving areas in the vicinity of their start and…

We present the non-trivial example how to generate non-Euclidean geometries from associative unital algebras. We consider bundles of the sphere of the degenerate non-Eucleadian space and its two models. The first (conformal) model is…

In this paper, we study a class of generalized monotone variational inequality (GMVI) problems whose operators are not necessarily monotone (e.g., pseudo-monotone). We present non-Euclidean extragradient (N-EG) methods for computing…

Cuspidal robots are robots with at least two inverse kinematic solutions that can be connected by a singularity-free path. Deciding the cuspidality of generic 3R robots has been studied in the past, but extending the study to…

In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…

The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two only. The expectation of the…

Time-varying non-Euclidean random objects are playing a growing role in modern data analysis, and periodicity is a fundamental characteristic of time-varying data. However, quantifying periodicity in general non-Euclidean random objects…

Let $V$ be a set of $n$ points in the plane. The unit-disk graph $G = (V, E)$ has vertex set $V$ and an edge $e_{uv} \in E$ between vertices $u, v \in V$ if the Euclidean distance between $u$ and $v$ is at most 1. The weight of each edge…

We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…