Related papers: Formalizing Factorization on Euclidean Domains and…
An excellent ring of prime characteristic for which the Frobenius map is pure is also Frobenius split in many commonly occurring situations in positive characteristic commutative algebra and algebraic geometry. However, using a fundamental…
As in Zariski's Uniformization Theorem we show that a valuation ring $V$ of characteristic $p>0$ of dimension one is a filtered direct limit of smooth ${\bf F}_p$-algebras under some conditions of transcendence degree. Under mild…
Here we define a new unification algorithm for terms interpreted in semantic domains denoted by a subclass of regular types here called deterministic regular types. This reflects our intention not to handle the semantic universe as a…
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 consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…
Let g be a Lie algebra over an algebraically closed field of characteristic p>0 and let U(g) be the universal enveloping algebra of g. We prove in this paper that for g=gl_n and g=sl_n the centre of U(g) is a unique factorisation domain and…
Unique factorization fails in many rings and monoids, but divisor and transfer homomorphisms provide tools to understand non-unique factorizations. In this expository article, we first explore these notions in the classical setting of…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
In this paper, we develop the foundations of the theory of quasiregular mappings in general metric measure spaces. In particular, nine definitions of quasiregularity for a discrete open mapping with locally bounded multiplicity are proved…
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…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
This paper offers a new perspective to ease the challenge of domain generalization, which involves maintaining robust results even in unseen environments. Our design focuses on the decision-making process in the final classifier layer.…
In this paper, we give semiring version of some classical results in commutative algebra related to Euclidean rings, PIDs, UFDs, G-domains, and GCD and integrally closed domains.
In the realm of supercommutative superrings, this article investigates the unique factorization of elements. We build upon recent findings by Naser et. al. concerning similar results in noncommutative symmetric rings with zerodivisors,…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…