Related papers: On the axioms for a unique factorization domain
This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…
Ultrafunctions are a particular class of functions defined on a Non Archimedean field E. They have been introduced and studied in some previous works. In this paper we develop the notion of fine ultrafunctions which improves the older…
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…
The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. Garcia-Sanchez, together with several co-authors, derived a…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
A major problem in the quantization of fields in curved spacetimes is the ambiguity in the choice of a Fock representation for the canonical commutation relations. There exists an infinite number of choices leading to different physical…
We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…
The formal degree of a unipotent discrete series character of a simple linear algebraic group over a non-archimedean local field (in the sense of Lusztig), is a rational function of the cardinality q of the residue field. The irreducible…
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…
We discuss various square-free factorizations in monoids in the context of: atomicity, ascending chain condition for principal ideals, decomposition, and a greatest common divisor property. Moreover, we obtain a full characterization of…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
We introduce a new fractional derivative which obeys classical properties including: linearity, product rule, quotient rule, power rule, chain rule, vanishing derivatives for constant functions, the Rolle's Theorem and the Mean Value…
We introduce an interesting and rather large class of monoid homomorphisms, on arbitrary integral domain $R$, that we call Dumas valuations. Then we formulate a conjecture addressing the question asking when a polynomial $f\in R[X]$ cannot…
Soft factorization has been shown to hold to sub-leading order in QED and to sub-sub-leading order in perturbative quantum gravity, with various loop and non-universal corrections that can be found. Here we show that all terms factorizing…
Orders in an algebraic number field form a class of rings which are of special historical interest to the field of factorization theory. One of the primary tools used to study factorization is elasticity - a measure of how badly unique…
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…
The theory of $\tau$-factorizations on integral domains was developed by Anderson and Frazier. This theory characterized all the known factorizations and opened the opportunity to create new ones. It can be visualized as a restriction to…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
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.
This work starts with the observation of a certain "rule" (up to now unexplored) in the fundamental laws of Nature. We show some evidence of this, and formulate it as a fundamental principle which exhibits a number physical consequences. In…