Related papers: Connection Between Type A and E Factorizations and…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

Using a family of graded algebra structures on a planar algebra and a family of traces coming from random matrix theory, we obtain a tower of non-commutative probability spaces, naturally associated to a given planar algebra. The associated…

New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…

Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…

We recall Borcherds's approach to vertex algebras via "singular commutative rings", and introduce new examples of his constructions which we compare to vertex algebras, chiral algebras, and factorization algebras. We show that all vertex…

Factorization theorems underly our ability to make predictions for many processes involving the strong interaction. Although typically formulated at leading power, the study of factorization at subleading power is of interest both for…

Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…

Using a Poisson bracket representation, in 3D, of the Lie algebra $\mathfrak{sl}(2)$, we first use highest weight representations to embed this into larger Lie algebras. These are then interpreted as symmetry and conformal symmetry algebras…

Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…

Factorization of quantum mechanical potentials has a long history extending back to the earliest days of the subject. In the present paper, the non-uniqueness of the factorization is exploited to derive new isospectral non-singular…

We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

In this paper we consider symplectic and contact Lie algebras. We define contactization and symplectization procedures and describe its main properties. We also give classification of such algebras in dimensions 3 and 4. The classification…

A $(2k+1)-$dimensional Lie algebra is called contact if it admits a one-form $\varphi$ such that $\varphi\wedge(d\varphi)^k\neq 0.$ Here, we extend recent work to describe a combinatorial procedure for generating contact, type-A Lie poset…

We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…

We apply the Schr\"odinger factorization method to the radial second-order equation for the relativistic Kepler-Coulomb problem. From these operators we construct two sets of one-variable radial operators which are realizations for the…

We present a new approach to RSA factorization inspired by geometric interpretations and square differences. This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that…