Related papers: Factorization (Splitting)
A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…
We propose a diagrammatic notation for matrix differentiation. Our new notation enables us to derive formulas for matrix differentiation more easily than the usual matrix (or index) notation. We demonstrate the effectiveness of our notation…
Work in progress concerning alternative formalizations of arithmetic.
Subtraction is a powerful technique for creating new bijections from old. Let's reinvent it! While we're at it, let's reinvent division as well.
Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an…
Let $k \geq 2$ be an integer. We prove that factorization of integers into $k$ parts follows the Dirichlet distribution $\text{Dir}\left(\frac{1}{k},\ldots,\frac{1}{k}\right)$ by multidimensional contour integration, thereby generalizing…
Partial algebras and datatypes are discussed with the use of signatures that allow partial functions, and a three-valued short-circuit (sequential) first order logic with a Tarski semantics. The propositional part of this logic is also…
We consider the operation of division in Pimenov algebras. We obtain necessary and sufficient conditions for prime elements in Pimenov algebras with a number of generators less than five. We adduce examples of the factorization of elements…
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…
We generalize the concept of a field by allowing addition to be a partial operation. We show that elements of such a "partially additive field" share many similarities with physical quantities. In particular, they form subsets of mutually…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online platforms. Little is known, however, about the characteristics…
In this note, we study a factorization result for graded decomposition maps associated with the specializations of graded algebras. We obtain results previously known only in the ungraded setting.
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…
Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…
We describe explicit algorithms for factoring q-difference operators and solving q-difference equations. These are well known results, presented in a "concrete" form. ----- Nous decrivons des algorithmes explicites pour la factorisation…
We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…
We construct an analogue of the ring of algebraic numbers, living in a quotient of the product of all finite fields of prime order. We use this ring to deduce some results about linear recurrent sequences.
We apply a paraconsistent logic to reason about fractions.