Related papers: Factors of composite $4n^2 +1$ using Fermat's fact…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. We interpret the factorization in a new way and use it to generate missing attributes from test data. We provide a joint…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
We compute the graded rank of the cohomology of the hyperplane complement associated with a quaternionic reflection group, and observe that it factors into irreducible factors with positive integer coefficients. For an irreducible group,…
We derive closed recursion equations for the symmetric polynomials occuring in the form factors of $D_n^{(1)}$ affine Toda field theories. These equations follow from kinematical- and bound state residue equations for the full form factor.…
In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…
The equation $f^n+g^n=1$, $n\in\mathbb{N}$ can be regarded as the Fermat Diophantine equation over the function field. In this paper we study the characterization of entire solutions of some system of Fermat type functional equations by…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
Composite fermion wavefuctions have been used to describe electrons in a strong magnetic field. We show that the polynomial part of these wavefunctions can be obtained by applying a normal ordered product of suitably defined annihilation…
Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…
We study the necessary conditions for sets of quadratic $n$-fold Pfister forms to have a common $(n-1)$-fold Pfister factor. For any set $S$ of $n$-fold Pfister forms generating a subgroup of $I_q^n F/I_q^{n+1} F$ of order $2^s$ in which…
Recently, \cite{Cao:2025hio} demonstrated the $2$-split for form factor under specific kinematic constraints. This factorization is analogous to that observed in scattering amplitudes. A key consequence of this structure is the presence of…
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…