Related papers: A quick route to unique factorization in quadratic…

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

I propose a way to use non-Euclidean norms to formulate a QR-like factorization which can unlock interesting and potentially useful properties of non-Euclidean norms - for example the ability of $l^1$ norm to suppresss outliers or promote…

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

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…

We propose a novel factorization algorithm that leverages the theory underlying the SQUFOF method, including reduced quadratic forms, infrastructural distance, and Gauss composition. We also present an analysis of our method, which has a…

This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization…

We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…

We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…

A canonical factorization is given for a quadratic pencil of accretive operators in a Hilbert space. Also, we establish some relationships between an m-accretive operator and its Moore-Penorse inverse. As an application, we study a result…

We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

In this paper, we discuss a systematic and self consistent procedure to factorize a rather general class of coupled nonlinear ordinary differential equations (ODEs), namely coupled quadratic and mixed Li\'enard type equations, which include…

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…

We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…

Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…