Related papers: An Algorithm to compute Rotation Numbers in the ci…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
Rotational invariant circles of area-preserving maps are an important and well-studied example of KAM tori. John Greene conjectured that the locally most robust rotational circles have rotation numbers that are noble, i.e., have continued…
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…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
This article presents and compares four approaches for computing the rotation of a point about an axis by an angle in $\mathbb{R}^3$. We illustrate these methods by computing, by hand, the rotation of point $P=(1,0,1)^T$ about axis…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We consider the problem of approximate counting of triangles and longer fixed length cycles in directed graphs. For triangles, T\v{e}tek [ICALP'22] gave an algorithm that returns a $(1 \pm \eps)$-approximation in…
Let $D$ be a directed graph cellularly embedded in a surface together with non-negative cost on its arcs. Given any integer circulation in $D$, we study the problem of finding a minimum-cost non-negative integer circulation in $D$ that is…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…
We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time $O(\log n)$ for query operation and $O(d\log^2 n)$ for insertion and removal operations, where $n$ and $d$ are the maximal numbers…
Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. We give an efficient,…
We describe the relation between the dynamical properties of a quasiperiodically forced orientation-preserving circle homeomorphism and the behavior of the fibered rotation number with respect to strictly monotone perturbations. Despite the…
In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of…
In the first part of the paper we present a short review of applications of digital differential analyzers (DDA) to generation of circles showing that they can be treated as one-step numerical schemes. In the second part we present and…
Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this paper, we present a new recursive algorithm for the…
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
We study the quadratic family of one-dimensional maps $f_a (x) = a - x^2$. We conduct comprehensive numerical analysis of collections of finite orbits of the critical point, computed for intervals of parameter values using rigorous…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We show the equivalence of two possible definitions of a rotational interval exchange transformation: by the first one, it is a first return map for a circle rotation onto a union of finite number of circle arcs, and by the second one, it…