Related papers: A heuristic algorithm for computing the Poincar\'e…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
The $GL_2$ Poincar\'{e} series giving the subconvexity results of Diaconu and Garrett is the solution to an automorphic partial differential equation, constructed by winding-up the solution to the corresponding differential equation on the…
We review the construction and applications of exactly Poincar\'e invariant quantum mechanical models of few-degree of freedom systems. We discuss the construction of dynamical representations of the Poincar\'e group on few-particle Hilbert…
The main contribution of this paper is to develop a hierarchical Bayesian formulation of PINNs for linear inverse problems, which is called BPINN-IP. The proposed methodology extends PINN to account for prior knowledge on the nature of the…
In this paper we use Weil conjectures (Deligne's theorem) to calculate the Betti numbers of the moduli spaces of semi-stable parabolic bundles on a curve. The quasi parabolic analogue of the Siegel formula, together with the method of…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given…
We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions by small…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We provide a programmable recursive algorithm for the $\mathbb{S}_n$-representations on the cohomology of the moduli spaces $\overline{\mathcal M}_{0,n}$ of $n$-pointed stable curves of genus 0. As an application, we find explicit inductive…
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…
We prove a theorem that allows one to count solutions to determinant equations twisted by a periodic weight with high uniformity in the modulus. It is obtained by using spectral methods of $\operatorname{SL}_2(\mathbb{R})$ automorphic forms…
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
The library \emph{fast\_polynomial} for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as H\"orner, divide and conquer and new ones can be added easily. Notably, a new…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
This paper continues our researches \cite{DS1, DS2, DS3} by computing some invariants based on Hilbert-Poincar\'{e} series associated to Milnor algebras. Our computations are for some of the classical surfaces and 3-folds with different…