Related papers: A quick route to unique factorization in quadratic…
In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.
In this work, we prove that any symplectic matrix can be factored into no more than 9 unit triangular symplectic matrices. This structure-preserving factorization of the symplectic matrices immediately reveals two well-known features that,…
We study exceptional quotient singularities. In particular, we prove an exceptionality criterion in terms of the $\alpha$-invariant of Tian, and utilize it to classify four-dimensional and five-dimensional exceptional quotient…
The minimum aberration criterion has been frequently used in the selection of fractional factorial designs with nominal factors. For designs with quantitative factors, however, level permutation of factors could alter their geometrical…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…
Using the block vec matrix, I give a necessary and sufficient condition for factorization of a matrix into the Kronecker product of two other matrices. As a consequence, I obtain an elementary algorithmic procedure to decide whether a…
We construct a Euclidean domain with no multiplicative Euclidean norm to a compatibly well-ordered monoid, and hence with no multiplicative Euclidean norm to $\mathbb{R}$ (under its usual order). A key step in the proof is showing that the…
In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.
This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.
These results stem from a course on ring theory. Quantum planes are rings in two variables $x$ and $y$ such that $yx=qxy$ where $q$ is a nonzero constant. When $q=1$ a quantum plane is simply a commutative polynomial ring in two variables.…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix $X$ with gradient descent on a factorization of $X$. We conjecture and provide empirical and theoretical evidence that with small enough…
We show that given a nonvanishing particular solution of the equation (divpgrad+q)u=0 (1) the corresponding differential operator can be factorized into a product of two first order operators. The factorization allows us to reduce the…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
Cluster analysis requires many decisions: the clustering method and the implied reference model, the number of clusters and, often, several hyper-parameters and algorithms' tunings. In practice, one produces several partitions, and a final…
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
This note is intended to explain the proof of two facts about quadrature domains: first, they are essentially unique if they exist; and second, they do exist for a large class of weight functions. The proofs roughly follow Sakai's…
This article will prove a theorem for the existence of k-factor for k>1 ,and present an efficient algorithm for computing k-factor for all values of k based on this theorem.