Related papers: Algorithm for computing the factor ring of an idea…
We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…
A pair of elements $a,b$ in an integral domain $R$ is an idempotent pair if either $a(1-a) \in bR$, or $b(1-b) \in aR$. $R$ is said to be a PRINC domain if all the ideals generated by an idempotent pair are principal. We show that in an…
Factor model is an appealing and effective analytic tool for high-dimensional time series, with a wide range of applications in economics, finance and statistics. This paper develops two criteria for the determination of the number of…
Let $D$ be a principal ideal domain and $R(D) = \{\begin{pmatrix} a & b 0 & a \end{pmatrix} \mid a, b \in D\}$ be its self-idealization. It is known that $R(D)$ is a commutative noetherian ring with identity, and hence $R(D)$ is atomic…
In this paper we study the concept of radical factorization in the context of abstract ideal theory in order to obtain a unified approach to the theory of factorization into radical ideals and elements in the literature of commutative…
In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…
First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…
The present paper studies structure of the ring of integer-valued entire functions. We characterize certain classes of prime and maximal ideals and investigate some of their properties.
Factor analysis aims to describe high dimensional random vectors by means of a small number of unknown common factors. In mathematical terms, it is required to decompose the covariance matrix $\Sigma$ of the random vector as the sum of a…
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
An algorithm to classify a general Hermitian matrix according to its signature (positive semi-definite, negative or indefinite) is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a…
Let $\mathfrak D$ be a residually finite Dedekind domain, $a\in \mathfrak D$ be a nonzero element and $\mathfrak n$ be a nonzero ideal of $\mathfrak D$. In this paper we describe the dynamics of the map $x\mapsto ax$ over the quotient ring…
This paper presents a group of analytical formulas for calculating the global maximal and minimal ranks and inertias of the quadratic matrix-valued function $\phi(X) = (\, AXB + C\,)M(\, AXB + C)^{*} + D$ and use them to derive necessary…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…
Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…