Related papers: Generalized U-factorization in Commutative Rings w…

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…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

For a regular normal element in an arbitrary ring, we study the category of its module factorizations. The cokernel functor relates module factorizations with Gorenstein projective components to Gorenstein projective modules over the…

Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

Frieze patterns have attracted significant attention recently, motivated by their relationship with cluster algebras. A longstanding open problem has been to provide a combinatorial model for frieze patterns over the ring of integers modulo…

We prove several new variants of the Lambert series factorization theorem established in the first article "Generating special arithmetic functions by Lambert series factorizations" by Merca and Schmidt (2017). Several characteristic…

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

We give a natural generalization of the classification of commutative rings of ordinary differential operators, given in works of Krichever, Mumford, Mulase, and determine commutative rings of operators in a completed ring of partial…

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…

In 1994, Sule presented the necessary and sufficient conditions of the feedback stabilizability of systems over unique factorization domains in terms of elementary factors and in terms of reduced minors. Recently, Mori and Abe have…

A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…

Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…

Let R be a polynomial ring over k(u), where k is a field k and u is a finite family or inderterminates. The paper introduces the specialization of an arbitrary finitely generated R-module by the substitution of u to elements of k. This…

We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer $\nu\ne 0$, we also obtain new bounds on exponential sums with $\nu$-th powers of such…

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…

Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…

Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…

In this work we generalize the concept of injective module and develop a theory of divisibility for modules over a general ring, which provides a general and unified framework to study Kummer-like field extensions arising from commutative…