English
Related papers

Related papers: $\tau$-Complete Factorization in Commutative Rings…

200 papers

We demonstrate a factorization formula for semi-inclusive deep-inelastic scattering with hadrons in the current fragmentation region detected at low transverse momentum. To facilitate the factorization, we introduce the transverse-momentum…

High Energy Physics - Phenomenology · Physics 2011-08-01 Xiangdong Ji , Jian-ping Ma , Feng Yuan

A new deterministic algorithm for finding square divisors, and finding $r$-power divisors in general, is presented. This algorithm is based on Lehman's method for integer factorization and is straightforward to implement. While the…

Number Theory · Mathematics 2022-10-03 Jonathon Hales , Ghaith Hiary

In the well-known construction of the field of fractions of an integral domain, division by zero is excluded. We introduce "fracpairs" as pairs subject to laws consistent with the use of the pair as a fraction, but do not exclude…

Rings and Algebras · Mathematics 2019-04-02 Jan A. Bergstra , Alban Ponse

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

Rings and Algebras · Mathematics 2026-05-14 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

Digitized adiabatic quantum factorization is a hybrid algorithm that exploits the advantage of digitized quantum computers to implement efficient adiabatic algorithms for factorization through gate decompositions of analog evolutions. In…

Quantum Physics · Physics 2026-02-05 Felip Pellicer , Juan José García-Ripoll , Alan C. Santos

This paper discusses the properties and the numerical discretizations of the fractional substantial integral $$I_s^\nu f(x)=\frac{1}{\Gamma(\nu)} \int_{a}^x{\left(x-\tau\right)^{\nu-1}}e^{-\sigma(x-\tau)}{f(\tau)}d\tau,\nu>0, $$ and the…

Numerical Analysis · Mathematics 2015-02-24 Minghua Chen , Weihua Deng

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…

Rings and Algebras · Mathematics 2023-09-18 Laura Cossu , Salvatore Tringali

Let $A$ be the fiber product $R\times_TB$, where $B\to T$ is a surjective ring homomorphism with regular kernel and $R\subseteq T$ is a ring extension where $T$ is an overring of $R$. In this paper we provide a characterization of when $A$…

Commutative Algebra · Mathematics 2024-04-01 Federico Campanini , Carmelo Antonio Finocchiaro

The T-product method based upon Discrete Fourier Transformation (DFT) has found wide applications in engineering, in particular, in image processing. In this paper, we propose variable T-product, and apply the Zero-Padding Discrete Fourier…

Optimization and Control · Mathematics 2023-05-16 Liqun Qi , Rui Yan , Ziyan Luo , Hong Yan , Gaohang Yu

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…

Machine Learning · Computer Science 2016-11-18 Ruoyu Sun , Zhi-Quan Luo

As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the…

Rings and Algebras · Mathematics 2024-01-12 Laura Cossu

In this article, we study the zero-divisor graph of the commutative non-chain ring with identity $ \mathbb{F}_p + u\mathbb{F}_p + v\mathbb{F}_p + uv\mathbb{F}_p,$ where \(u^2 = 0\), \(v^2 = 0\), \(uv = vu\), and \(p\) is an odd prime. We…

Rings and Algebras · Mathematics 2026-05-19 N. Annamalai

A decomposition of a higher order linear differential operator with polynomial coefficients into a direct sum of two factor operators is obtained. This leads to a lower echelon matrix representation for operators of the above mentioned type…

Functional Analysis · Mathematics 2016-11-29 Alexandros G. Paraskevopoulos

In this work we introduce a new concept, namely, $\tau_{s}$-extending modules (rings) which is torsion-theoretic analogues of extending modules and then we extend many results from extending modules to this new concept. For instance we show…

Rings and Algebras · Mathematics 2022-01-03 Semra Dogruoz , Azime Tarhan

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…

Commutative Algebra · Mathematics 2013-11-21 Gyu Whan Chang , Daniel Smertnig

This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…

Numerical Analysis · Mathematics 2021-09-15 Jordi Feliu-Fabà , Lexing Ying

We derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with additive noise. We…

Signal Processing · Electrical Eng. & Systems 2018-05-24 Ryota Kawasumi , Koujin Takeda

Let $R$ be a commutative ring with nonzero identity and $I$ a proper ideal of $R$. The {\it ideal-based zero-divisor graph} of $R$ with respect to the ideal $I$, denoted by $\Gamma_I(R)$, is the graph on vertices $\{x \in R\setminus I \mid…

Rings and Algebras · Mathematics 2015-09-10 Jesse Gerald Smith

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…

Number Theory · Mathematics 2014-10-13 Baofeng Wu , Dongdai Lin

Given a time-evolving tensor with missing entries, how can we effectively factorize it for precisely predicting the missing entries? Tensor factorization has been extensively utilized for analyzing various multi-dimensional real-world data.…

Machine Learning · Computer Science 2020-12-17 Dawon Ahn , Jun-Gi Jang , U Kang