Related papers: Inverting the Rational Sweep Map
We calculate the rational cohomology of the classifying space of the diffeomorphism group of the manifolds $U_{g,1}^n:= \#^g(S^n \times S^{n+1})\setminus \mathrm{int}{D^{2n+1}}$, for large $g$ and $n$, up to approximately degree $n$. The…
In this Letter we propose a systematic approach for detecting and calculating preserved measures and integrals of a rational map. The approach is based on the use of cofactors and Discrete Darboux Polynomials and relies on the use of…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
We classify rational solutions of a specific type of the set theoretical version of the pentagon equation. That is, we find all quadrirational maps $R:(x,y)\mapsto (u(x,y),v(x,y)),$ where $u, v$ are two rational functions on two arguments,…
Following Manin's approach to renormalization in the theory of computation, we investigate Dyson-Schwinger equations on Hopf algebras, operads and properads of flow charts, as a way of encoding self-similarity structures in the theory of…
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…
We present a geometric construction of push-forward maps along projective morphisms for cohomology theories representable in the stable motivic homotopy category assuming that the element corresponding to the stable Hopf map is inverted in…
We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method…
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…
We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…
Fast matrix multiplication algorithms are asymptotically faster than the classical cubic-time algorithm, but they are often slower in practice. One important obstacle is the use of complex coefficients, which increases arithmetic overhead…
We calculate the total number of humps in Dyck and in Motzkin paths, and we give Standard-Young-Tableaux-interpretations of the numbers involved. One then observes the intriguing phenomena that the humps-calculations change the partitions…
Let $M^m$ be an oriented manifold, let $N^{m-1}$ be an oriented closed manifold, and let $p$ be a point in $M^m$. For a smooth map $f:N^{m-1} \to M^m, p \not\in Im f,$ we introduce an invariant $awin_p(f)$ that can be regarded as a…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…
In this paper we describe an algorithm for generating all the possible $PIW(m,n,k)$ - integer $m\times n$ Weighing matrices of weight $k$ up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up…