Related papers: Factoring Permutation Matrices Into a Product of T…
A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…
A convergent algorithm for nonnegative matrix factorization with orthogonality constraints imposed on both factors is proposed in this paper. This factorization concept was first introduced by Ding et al. with intent to further improve…
The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary $n^2 \times n^2$ S-permutation matrix, a lower band of the number of all disjoint with it S-permutation…
Consider a random graph $G$ of size $N$ constructed according to a \textit{graphon} $w \, : \, [0,1]^{2} \mapsto [0,1]$ as follows. First embed $N$ vertices $V = \{v_1, v_2, \ldots, v_N\}$ into the interval $[0,1]$, then for each $i < j$…
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…
The orbits in $\Gamma_{\infty}(3) \backslash \Gamma(3)$ are in bijection with sets of invariants satisfying certain relations. We explain how wedge product matrices give an alternative definition of the invariants of matrix orbits. This new…
We consider the design of an orthogonal symmetric/antisymmetric multiwavelet from its matrix product filter by matrix spectral factorization (MSF). As a test problem, we construct a simple matrix product filter with desirable properties,…
Given a pattern $P$ and a text $T$, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of $P$ occurs in $T$. The indexed version of this problem, i.e., preprocessing a…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
An n x n permutative matrix is a matrix in which every row is a permutation of the first row. In this paper the result given by Paparella in [Electron. J. Linear Algebra 31 (2016) 306-312] is extended to a more general lists of real and…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
Given $d, N \in \mathbb{N}$, we define $\mathfrak{C}_d(N)$ to be the number of pairs of $d\times d$ matrices $A,B$ with entries in $[-N,N] \cap \mathbb{Z}$ such that $AB = BA$. We prove that $$ N^{10} \ll \mathfrak{C}_3(N) \ll N^{10},$$…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series?…
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
We consider the derived category of permutation modules over a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the set underlying the tt-spectrum of compact…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…
We address the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain nineteen further…
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…