Related papers: Normalization of Rings

We introduce a simple procedure to integrate differential forms with arbitrary holomorphic poles on Riemann surfaces. It gives rise to an intrinsic regularization of such singular integrals in terms of the underlying conformal geometry.…

We investigate the transfer of regularity between commutative, noetherian, local rings through a class of local homomorphisms which we call basically regular. We give numerical characterizations of these maps, investigate their behavior…

This paper proposes a variant of the normalized cut algorithm for spectral clustering. Although the normalized cut algorithm applies the K-means algorithm to the eigenvectors of a normalized graph Laplacian for finding clusters, our…

In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…

We study Abhyankar valuations of excellent equicharacteristic local domains with an algebraically closed residue field. For zero dimensional valuations we prove that whenever the ring is complete and the semigroup of values taken by the…

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…

The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…

Depth estimation is an essential component in understanding the 3D geometry of a scene, with numerous applications in urban and indoor settings. These scenes are characterized by a prevalence of human made structures, which in most of the…

We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.

Let $R$ be a commutative Noetherian ring and $\mathfrak{a}$ be an ideal of $R$. Suppose $M$ is a finitely generated $R$-module and $N$ is an Artinian $R$-module. We define the concept of filter coregular sequence to determine the infimum of…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…

We prove some results on the structure of ind-pro completions of Noetherian rings along flags of prime ideals. In particular, we compute the Krull dimension and deduce the criterion on semilocality in the case of essentially of finite type…

The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…

Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for…

Several problems in magnetically confined fusion, such as the computation of exterior vacuum fields or the decomposition of the total magnetic field into separate contributions from the plasma and the external sources, are best formulated…

Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…

In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…

In this article, we define and explore the weak normalization of an affine semigroup. In particular, for a fixed prime integer, we provide a geometric description of the weak normalization of an affine semigroup with respect to that prime,…