Related papers: Minimal transitive factorizations of permutations …

Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decimation' scheme that maps it to neural network models of…

We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…

An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…

Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

Synthesis of distributed protocols is a hard, often undecidable, problem. Completion techniques provide partial remedy by turning the problem into a search problem. However, the space of candidate completions is still massive. In this…

We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

We study the decomposition of the Coulomb integrals of periodic systems into a tensor contraction of six matrices of which only two are distinct. We find that the Coulomb integrals can be well approximated in this form already with small…

A simple algorithm is presented to decompose any 1-loop amplitude for scattering processes of the class 2 fermions -> 4 fermions into a fixed number of gauge-invariant form factors. The structure of the amplitude is simpler than in the…

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…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ and $S=$ $K[y_{1},y_{2},\cdots, y_{m}]$ where $K$ is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain $3$-matrix factors for a given polynomial using either…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

We analyse the matrix factorization problem. Given a noisy measurement of a product of two matrices, the problem is to estimate back the original matrices. It arises in many applications such as dictionary learning, blind matrix…

Let G be a finite group. We study the group of G-equivariant self-homotopy equivalences of product of G-spaces. For a product of n-spaces, we represent it as product of n-subgroups under the assumption of equivariant reducibility. Further…

The method of factorization, based on the model of unstable particles with a smeared mass, is applied to the processes with an unstable particle in the intermediate state. It was shown, that in the framework of the method suggested, the…

Monte Carlo simulations of systems with a complex action are known to be extremely difficult. A new approach to this problem based on a factorization property of distribution functions of observables has been proposed recently. The method…