Related papers: A quick route to unique factorization in quadratic…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
We prove that a nodal quartic threefold $X$ containing no planes is $Q$-factorial provided that it has not more than 12 singular points, with the exception of a quartic with exactly 12 singularities containing a quadric surface. We give…
Very simple sufficient conditions for the irreducibility of $f(X^n)$ over an arbitrary unique factorization domain $Z$ are established via a generalization of a well known theorem of A. Capelli.
We provide an algorithm that factorizes one-dimensional quantum walks into a protocol of two basic operations: A fixed conditional shift that transports particles between cells and suitable coin operators that act locally in each cell. This…
We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…
This note presents a simple proof of the characteristic function of Student's $t$-distribution. The method of proof, which involves finding a differential equation satisfied by the characteristic function, is applicable to many other…
Regev recently introduced a quantum factoring algorithm that may be perceived as a $d$-dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete…
Unit-generated orders of a quadratic field are orders of the form $\mathcal{O} = \mathbb{Z}[\varepsilon]$, where $\varepsilon$ is a unit in the quadratic field. If the order $\mathcal{O}$ is a maximal order of a real quadratic field, then…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…
We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.
We discuss a general method by which a higher order difference equation on a group is transformed into an equivalent triangular system of two difference equations of lower orders. This breakdown into lower order equations is based on the…
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
A method for estimating the merit factors of sequences will be provided. The result is also effective in determining the nonexistence of certain infinite collections of cyclic difference sets and cyclic matrices and associated binary…
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…