Related papers: $\tau$-Complete Factorization in Commutative Rings…
Since an old observation by Beenakker et al, the evaluation of QCD processes in dimensional reduction has repeatedly led to terms that seem to violate the QCD factorization theorem. We reconsider the example of the process gg->ttbar and…
We prove that one can realize certain triangulated subcategories of the singularity category of a complete intersection as homotopy categories of matrix factorizations. Moreover, we prove that for any commutative ring and non-zerodivisor,…
The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices…
In this article, we discussed the zero-divisor graph of a commutative ring with identity $\mathbb{F}_p+u\mathbb{F}_p+u^2 \mathbb{F}_p$ where $u^3=0$ and $p$ is an odd prime. We find the clique number, chromatic number, vertex connectivity,…
Let $R$ be a ring, $e$ an idempotent of $R$ and $\delta(R)$ denote the intersection of all essential maximal right ideals of $R$ which is called Zhou radical. In this paper, the Zhou radical of a ring is applied to the $e$-reduced property…
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…
We give a number of explicit matrix-algorithms for analysis/synthesis in multi-phase filtering; i.e., the operation on discrete-time signals which allow a separation into frequency-band components, one for each of the ranges of bands, say…
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
A nonzero element of an integral domain (or commutative cancellative monoid) is called atomic if it can be written as a finite product of irreducible elements (also called atoms). In this paper, we introduce and investigate an unrestricted…
For a commutative domain $R$ with nonzero identity and $I$ an ideal of $R$, we say $a=\lambda b_1 \cdots b_k$ is a $\tau_I$-factorization of $a$ if $\lambda \in R$ is a unit and $b_i \equiv b_j$(mod $I$) for all $1\leq i \leq j \leq k$.…
In this paper, we consider five possible extensions of the Pr\"ufer domain notion to the case of commutative rings with zero divisors. We investigate the transfer of these Pr\"ufer-like properties between a commutative ring and its subring…
The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…
Given a nonnegative matrix factorization, $R$, and a factorization rank, $r$, Exact nonnegative matrix factorization (Exact NMF) decomposes $R$ as the product of two nonnegative matrices, $C$ and $S$ with $r$ columns, such as $R = CS^\top$.…
The theory of fractional calculus has developed in a number of directions over the years, including: the formulation of multiple different definitions of fractional differintegration; the extension of various properties of standard calculus…
In this paper, we study factorizations in the additive monoids of positive algebraic valuations $\mathbb{N}_0[\alpha]$ of the semiring of polynomials $\mathbb{N}_0[X]$ using a methodology introduced by D. D. Anderson, D. F. Anderson, and M.…
An integral domain is atomic if every nonzero nonunit factors into irreducibles. Let $R$ be an integral domain. We say that $R$ is a bounded factorization domain if it is atomic and for every nonzero nonunit $x \in R$, there is a positive…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…