相关论文: Factoring Permutation Matrices Into a Product of T…

We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…

Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of low rank. Provided that these partitionings are known,…

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…

The article discusses the matrices of the three forms whose inversions are: tridiagonal matrix, banded matrix or block-tridiagonal matrix and their relationships with the covariance matrices of measurements of ordinary (simple) Markov…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…

It is well-known that any permutation can be written as a product of two involutions. We provide an explicit formula for the number of ways to do so, depending only on the cycle type of the permutation. In many cases, these numbers are sums…

Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…

We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…

One of fundamental results of the theory of joint/generalized spectral radius, the Berger-Wang theorem, establishes equality between the joint and generalized spectral radii of a set of matrices. Generalization of this theorem on products…

We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…

In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…

In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…

The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…

We associate a complete intersection singularity to a graded matrix factorization of size two of a polynomial in three variables. We show that we get an inverse to the reduction of singularities considered by C.T.C.Wall. We study this for…

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Deformation theory refers to an apparatus in many parts of math and physics for going from an infinitesimal (= first order) deformation to a full deformation, either formal or convergent appropriately. If the algebra being deformed is that…

We study exponential factorization of invertible matrices over unital complex Banach algebras. In particular, we prove that every invertible matrix with entries in the algebra of holomorphic functions on a closed bordered Riemann surface…