Related papers: Balanced factorisations
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
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…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
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…
Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category…
An extension to the factorisation principle as suggested by Fermat is presented.We start from a symmetry of natural numbers and obtain the factorisation principle therefrom.Later it is extended further to test the primality of any natural…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
We consider finitely generated normal algebras over an algebraically closed field of characteristic zero that come with a complexity one grading by a finitely generated abelian group such that the conditions of a UFD are satisfied for…
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
Any finite conversation can be rationalized.
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We obtain the double factorization of braided bialgebras or braided Hopf algebras, give relation among integrals and semisimplicity of braided Hopf algebra and its factors.
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…