相关论文: $\tau$-Complete Factorization in Commutative Rings…

In this paper we develop a Morse-like theory in order to decompose birational maps and morphisms of smooth projective varieties defined over a field of characteristic zero into more elementary steps which are locally \'etale isomorphic to…

In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…

We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…

In 2020, Cossu and Zanardo raised a conjecture on the idempotent factorization on singular matrices in the form $\begin{pmatrix} p&z\\ \bar{z}&\sfrac{\lVert z\rVert}{p} \end{pmatrix},$ where $p$ is a prime integer which is irreducible but…

We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao's celebrated addition-deletion theorem for free arrangements for…

We study universal mapping properties of $(\sigma,\tau)$-derivations over commutative algebras and characterize them over rings of integers of quadratic number fields. As a result we provide extension of some well known results on UFD's of…

This paper considers the general question of when a topological action of a countable group can be factored into a direct product of a nontrivial actions. In the early 1980's D. Lind considered such questions for $\mathbb{Z}$-shifts of…

We present the first deterministic, finite-step algorithm for exact tensor ring (TR) decomposition, addressing an open question about the existence of such procedures. Our method leverages blockwise simultaneous diagonalization to recover…

With the tremendous success of large transformer models in natural language understanding, down-sizing them for cost-effective deployments has become critical. Recent studies have explored the low-rank weight factorization techniques which…

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…

We study rooted cluster algebras and rooted cluster morphisms which were introduced in \cite{ADS13} recently and cluster structures in $2$-Calabi-Yau triangulated categories. An example of rooted cluster morphism which is not ideal is…

In Disquisitiones Arithmeticae, Gauss studied binary quadratic forms and introduced a very general version of a composition operator that allows composing even forms of different discriminants and imprimitive forms. Section V of…

Measurements of the branching fractions of the semileptonic decays $B\to D^{(*)}\tau\bar\nu_\tau$ and $B_c\to J/\psi\tau\bar\nu_\tau$ systematically exceed the Standard Model (SM) predictions, pointing to possible signals of new physics…

In the present article, a new method for the evaluation of fractional derivatives of arbitrary real order is proposed. Numerous but inequivalent formulations have been given in the past. Some of them exhibit unsatisfactory properties such…

In \cite[Problem 72]{Fuchs60} Fuchs posed the problem of characterizing the groups which are the groups of units of commutative rings. In the following years, some partial answers have been given to this question in particular cases. In a…

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

Nonnegative matrix factorization can be used to automatically detect topics within a corpus in an unsupervised fashion. The technique amounts to an approximation of a nonnegative matrix as the product of two nonnegative matrices of lower…

The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if 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…