Related papers: Inverting the Rational Sweep Map
In this note we give an algorithm to determine the rational homotopy type of the free and pointed mapping spaces $ map(F(\mathbb R^m,k), S^n)$ and $ map^*(F(\mathbb R^m,k), S^n)$. An explicit description of these spaces is given for $k=3$.…
We define an action of words in $[m]^n$ on $\mathbb{R}^m$ to give a new characterization of rational parking functions -- they are exactly those words whose action has a fixed point. We use this viewpoint to give a simple definition of…
We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…
We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial…
We present a new compactification $M(d,n)$ of the moduli space of self-maps of $\mathbb{CP}^1$ of degree $d$ with $n$ markings. It is constructed via GIT from the stable maps moduli space $\ ar M_{0,n}(\mathbb{CP}^1 \times \mathbb{CP}^1,…
Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study…
The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…
For positive integers m and n, denote S(m,n) as the associated Stirling number of the second kind and let z be a complex variable. In this paper, we introduce the Stirling functions S(m,n,z) which satisfy S(m,n,z) = S(m,n) for any z which…
Recently, Peter Doyle and Curt McMullen devised an iterative solution to the fifth degree polynomial. At the method's core is a rational mapping of the Riemann sphere with the icosahedral symmetry of a general quintic. Moreover, this map…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
An efficient method has been developed for solving the inverse problem of Doppler-Zeeman mapping of magnetic, chemically peculiar stars. A regularized iteration method is used to simultaneously solve the integral equations for the Stokes I,…
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…
Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…
We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$.…