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

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…

Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many…

Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…

Integral equations are commonly encountered when solving complex physical problems. Their discretization leads to a dense kernel matrix that is block or hierarchically low-rank. This paper proposes a new way to build a low-rank…

We give several criteria for a ring to be a UFD including generalizations of some criteria due to P. Samuel. These criteria are applied to construct, for any field k, (1) a Z-graded non-noetherian rational UFD of dimension three over k, and…

When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…

The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…

We study the deterministic recursion $n_{j+1} = n_j - \tau(n_j)$, where $\tau(n)$ denotes the divisor function, and the associated orbit length $a(x)$. Heuristics based on the average order of $\tau(n)$ suggest that $a(x) \asymp x / \log…

We find matrix factorization corresponding to an anti-diagonal in ${\mathbb C}P^1 \times {\mathbb C}P^1$, and circle fibers in weighted projective lines using the idea of Chan and Leung of Strominger-Yau-Zaslow transformations. For the tear…

This paper presents a unified matrix factorization framework for classical and robust clustering. We begin by revisiting the well-known equivalence between crisp k-means clustering and matrix factorization, following and rigorously…

We define a compressed zero-divisor graph $\varTheta(K)$ of a finite commutative unital ring $K$, where the compression is performed by means of the associatedness relation. We prove that this is the best possible compression which induces…

The test ideal $\tau(R)$ of a ring $R$ of prime characteristic is an important object in the theory of tight closure. In this paper, we study a generalization of the test ideal, which is the ideal $\tau(\a^t)$ associated to a given ideal…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…

Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological -- and indeed, linear -- algebra. However, matrices in this domain are typically large, with rows and columns…

In this paper we describe new noncommutative factorizations of functions related to $d$-th tensor powers of Carlitz's $\mathbb F_q[\theta]$-module for $d\geq 1$, called higher sine functions. In recent work by the second author,…

Function theory on the unit disc proved key to a range of problems in statistics, probability theory, signal processing literature, and applications, and in this, a special place is occupied by trigonometric functions and the Fejer-Riesz…

Let $R$ and $S$ be commutative rings with identity, $f:R\to S$ a ring homomorphism and $J$ an ideal of $S$. Then the subring $R\bowtie^fJ:=\{(r,f(r)+j)\mid r\in R$ and $j\in J\}$ of $R\times S$ is called the amalgamation of $R$ with $S$…

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a…