Related papers: Set-oriented numerical computation of rotation set…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…
Detecting symmetry is crucial for effective object grasping for several reasons. Recognizing symmetrical features or axes within an object helps in developing efficient grasp strategies, as grasping along these axes typically results in a…
Consider a homeomorphism h of the closed annulus S^1*[0,1], isotopic to the identity, such that the rotation set of h is reduced to a single irrational number alpha (we say that h is an irrational pseudo-rotation). For every positive…
The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures. Specifically, we focus on the family of Bregman…
We expand the dictionary between the action of a torus homeomorphism on the fine curve graph and its rotation set. More precisely, we show that the fixed points at infinity of a loxodromic element determine the rotation set up to scale. A…
Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…
We derive a new bound on the effectiveness of the Petz map as a universal recovery channel in approximate quantum error correction using the second sandwiched R\'{e}nyi relative entropy $\tilde{D}_{2}$. For large Hilbert spaces, our bound…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
Numerical integrations in celestial mechanics often involve the repeated computation of a rotation with a constant angle. A direct evaluation of these rotations yields a linear drift of the distance to the origin. This is due to roundoff in…
We establish that every second countable completely regularly preordered space (E,T,\leq) is quasi-pseudo-metrizable, in the sense that there is a quasi-pseudo-metric p on E for which the pseudo-metric p\veep^-1 induces T and the graph of…
Stochastic orbital techniques offer reduced computational scaling and memory requirements to describe ground and excited states at the cost of introducing controlled statistical errors. Such techniques often rely on two basic operations,…
We investigate the evolution of families of periodic orbits in a bisymmetrical potential made up of a two-dimensional harmonic oscillator with only one quartic perturbing term, in a number of resonant cases. Our main objective is to compute…
In this paper, we present a method for unconstrained end-to-end head pose estimation. We address the problem of ambiguous rotation labels by introducing the rotation matrix formalism for our ground truth data and propose a continuous 6D…
Motivated by the question whether a round disk can be realized as the rotation set of a torus diffeomorphism, we study the roundness of rotation sets of a parametric family of torus diffeomorphisms $F_\rho$, where the parameter $\rho$…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
We study quasiperiodically forced circle endomorphisms, homotopic to the identity, and show that under suitable conditions these exhibit uncountably many minimal sets with a complicated structure, to which we refer to as `strangely…