Related papers: An algorithm for computing the integral closure
We present an algorithm for the optimization of a class of finite element integration loop nests. This algorithm, which exploits fundamental mathematical properties of finite element operators, is proven to achieve a locally optimal…
We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the \NPAz. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.
In this paper, we propose a numerical method of computing a Hadamard finite-part integral with a non-integral power singularity at an endpoint, that is, a finite part of a divergent integral as a limiting procedure. In the proposed method,…
By suitable examples we illustrate an algorithm for composition of inverse problems.
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
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.
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
In this note we present an algorithm for the construction of the unit group of the Burnside ring $\Omega(G)$ of a finite group $G$ from a list of representatives of the conjugacy classes of subgroups of G.
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
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…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
We describe an algorithm for listing all elements of bounded height in a given number field.
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.