Related papers: An algorithm for computing the integral closure
We study the algebraic and geometric properties of the integral closure of different rings of functions on a real algebraic variety : the regular functions and the continuous rational functions.
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
Let $R$ be a complete regular local ring with an algebraically closed residue field and let $A$ be a Noetherian $R$-subalgebra of the polynomial ring $R[X]$. It has been shown in \cite{DO2} that if $\dim R=1$, then $A$ is necessarily…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
This paper describes a method for computing all F-pure ideals for a given Cartier map of a polynomial ring over a finite field.
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
A formalism for the numerical integration of one- and two-loop integrals is presented. It is based on subtraction terms which remove the soft, collinear and some of the ultraviolet divergences from the integrand. The numerical integral is…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
Given a local noetherian ring $R$ whose formal completion is integral, we introduce and study the $p$-radical closure $R^\text{prc}$. Roughly speaking, this is the largest purely inseparable $R$-subalgebra inside the formal completion…
We present a package 'MixedMultiplicity' for computing mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over a field. This enables us to find mixed volumes of convex lattice polytopes…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview of Risch's algorithm including recent developments. The algorithms discussed are suited for both indefinite and definite integration. They…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows to overcome these…