Related papers: Unit triangular factorization of the matrix symple…
Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological -- and indeed, linear -- algebra. However, matrices in this domain are typically large, with rows and columns…
In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…
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 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent $\omega$…
We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
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…
Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term…
In this paper, we introduce the $k\times n$ (with $k\leq n$) truncated, supplemented Pascal matrix which has the property that any $k$ columns form a linearly independent set. This property is also present in Reed-Solomon codes; however,…
The notion of a symmetrically factorizable Lie group is introduced. It is shown that each symmetrically factorizable Lie group is related to a set-theoretical solution of the pentagon equation. Each simple Lie group (after a certain Abelian…
Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric…
The coupled angular momenta are a family of completely integrable systems that depend on three parameters and have a compact phase space. They correspond to the classical version of the coupling of two quantum angular momenta and they…
We construct new families of symplectic capacities indexed by certain symmetric polynomials, defined using rational symplectic field theory. In particular, we introduce a sequence of capacities based on an L-infinity structure on linearized…
We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…
The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…
In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization. This algorithm can be used to show that every integral…
Symplectic integrator plays a pivotal role in the long-term tracking of charged particles within accelerators. To get symplectic maps in accurate simulation of single-particle trajectories, two key components are addressed: precise…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters,…