相关论文: $\tau$-Complete Factorization in Commutative Rings…
We characterize the commutative rings whose ideals (resp. regular ideals) are products of radical ideals.
In this paper, we show that it is possible for a commutative ring with identity to be non-atomic (that is, there exist non-zero nonunits that cannot be factored into irreducibles) and yet have a strongly atomic polynomial extension. In…
Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and network engineering. Due…
We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
The increasing size of transformer-based models in NLP makes the question of compressing them important. In this work, we present a comprehensive analysis of factorization based model compression techniques. Specifically, we focus on…
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We…
Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…
We give a proof of local strong factorization of a birational extension of regular local rings (of equicharacteristic zero) along a valuation of rank 1 and maximal rational rank. This gives an alternate proof to the geometric proof of this…
In this paper, we continue investigation of the directed and undirected irreducible divisor graph concepts $G(x)$ and $\Gamma (x)$ of $x\in D^{\ast} \backslash U(D)$, respectively, which were introduced in [7]. Consequently, we introduce…
We generalize the theory of logarithmic derivations through a self-contained study of modules here dubbed tangential idealizers. We establish reflexiveness criteria for such modules, provided the ring is a factorial domain. As a main…
We use the concept of 2-absorbing ideal introduced by Badawi to study those commutative rings in which every proper ideal is a product of 2-absorbing ideals (we call them TAF-rings). Any TAF-ring has dimension at most one and the local…
A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…
Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for…
Landau has characterized the integrality of certain ratios of factorials. Delaygue has characterized the integrality of the Taylor coefficients of certain mirror maps constructed from series involving those ratios. Using the…
This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer…
In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.…