Related papers: Inverting the Rational Sweep Map
In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization. This algorithm can be used to show that every integral…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this…
As a generalization of our previous result\cite{huang2025algorithm}, this paper aims to answer the following question: Given a 2-dimensional polynomial vector field $y^{\prime}=\frac{M(x,y)}{N(x,y)}$, how to find a rational transformation…
The aim of this work is to extend to a general $S_m\times S_n$-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a $m\times n$-rectangle. We obtain an explicit formula for the the "bi-Frobenius"…
Recently, Kenyon and Wilson introduced a certain matrix $M$ in order to compute pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix $M^{-1}$ is equal to the…
We introduce a modification of Pillai's prime map: the prime-power map. This map fixes $1$, divides its argument by $p$ if it is a prime-power $p^k$, otherwise subtracts from its argument the largest prime-power not exceeding it. We study…
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…
Ordinary maps satisfy topological recursion for a certain spectral curve $(x, y)$. We solve a conjecture from arXiv:1710.07851 that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy…
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n^2). The algorithm is…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
We introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are…
We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…
We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…
Let $p$ be a prime and $n\geq 2$ be a positive integer. We establish new formulae for the decompositions of the first $p-1$ symmetric powers of the Specht module $S^{(n-1,1)}$ and the irreducible module $D^{(n-1,1)}$ in characteristic $p$…
General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…