Related papers: Normalization of Rings
Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their…
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
Let I be an ideal of a regular local ring Q with residue field k. The length of the minimal free resolution of R=Q/I is called the codepth of R. If it is at most 3, then the resolution carries a structure of a differential graded algebra,…
In this paper, an algebraic theory for local rings of finite embedding dimension is developed. Several extensions of (Krull) dimension are proposed, which are then used to generalize singularity notions from commutative algebra. Finally,…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
Through examples, we illustrate how to compute differential operators on a quotient of an affine semigroup ring by a radical monomial ideal, when working over an algebraically closed field of characteristic 0.
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a…
The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.
Erasure codes are widely used in today's storage systems to cope with failures. Most of them use the finite field arithmetic. In this paper, we propose an implementation and a coding speed evaluation of an original method called PYRIT…
We characterize the seminormality of an affine semigroup ring in terms of the dualizing complex, and the normality of a Cohen-Macaulay semigroup ring by the "shape" of the canonical module. We also characterize the seminormality of a toric…
In this paper, the notion of F-schemes, a "generalization" of schemes, is introduced to cover unitary noncommutative rings.
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…
To initiate a systematic study on the applications of perfectoid methods to Noetherian rings, we introduce the notions of perfectoid towers and their tilts. We mainly show that the tilting operation preserves several homological invariants…
We present an algorithm for the efficient numerical evaluation of integrals of the form \[ I(\omega) = \int_0^1 F( x,\mathrm e^{\mathrm i \omega x}; \omega) \, \mathrm d x \] for sufficiently smooth but otherwise arbitrary $F$ and $\omega…
We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
Local rings are ubiquitous in algebraic geometry. Not only are they naturally meaningful in a geometric sense, but also they are extremely useful as many problems can be attacked by first reducing to the local case and taking advantage of…
We investigate the cryptanalysis of affine ciphers using a hybrid neural network architecture that combines modular arithmetic-aware and statistical feature-based learning. Inspired by recent advances in interpretable neural networks for…
In this paper, we consider optimal low-rank regularized inverse matrix approximations and their applications to inverse problems. We give an explicit solution to a generalized rank-constrained regularized inverse approximation problem,…
Here, I present a novel method for normalizing a finite set of numbers, which is studied by the domain of biological vision. Normalizing in this context means searching the maximum and minimum number in a set and then rescaling all numbers…