Related papers: Factoring Permutation Matrices Into a Product of T…
We consider the question of the boundedness of matrix products $A_{n}B_{n}\cdots A_{1}B_{1}$ with factors from two sets of matrices, $A_{i}\in\mathscr{A}$ and $B_{i}\in\mathscr{B}$, due to an appropriate choice of matrices $\{B_{i}\}$. It…
We consider different variants of factorization of a 2x2 matrix Schroedinger/Pauli operator in two spatial dimensions. They allow to relate its spectrum to the sum of spectra of two scalar Schroedinger operators, in a manner similar to…
The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…
We study inductive bias in Transformers in the infinitely over-parameterized Gaussian process limit and argue transformers tend to be biased towards more permutation symmetric functions in sequence space. We show that the representation…
This paper aims to continue the studies initiated by Botha in [Linear Algebra Appl. 273 (1998), 65-82; Linear Algebra Appl. 286 (1999), 37-44; Linear Algebra Appl. 315 (2000), 1-23] by extending them to matrices over noncommutative division…
In this paper, we introduce the notion of a $(a,b)$-rectangle pattern on permutations that not only generalizes the notion of successive elements (bonds) in permutations, but is also related to mesh patterns introduced recently by…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
We revisit open string mirror symmetry for the elliptic curve, using matrix factorizations for describing D-branes on the B-model side. We show how flat coordinates can be intrinsically defined in the Landau-Ginzburg model, and derive the…
We define a new diffusive matrix model converging towards the $\beta$ -Dyson Brownian motion for all $\beta\in [0,2]$ that provides an explicit construction of $\beta$-ensembles of random matrices that is invariant under the…
We present an efficient algorithm for computing the permanent for matrices of size N that can written as a product of L block diagonal matrices with blocks of size at most 2. For fixed L, the time and space resources scale linearly in N,…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the…
We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…
A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…
The multiplication of a matrix by its transpose, $A^T A$, appears as an intermediate operation in the solution of a wide set of problems. In this paper, we propose a new cache-oblivious algorithm (ATA) for computing this product, based upon…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
In this paper, by analyzing the quadratic factors of an $11$-th degree polynomial over the finite field $\ftwon$, a conjecture on permutation trinomials over $\ftwon[x]$ proposed very recently by Deng and Zheng is settled, where $n=2m$ and…
Given two linear transformations, with representing matrices $A$ and $B$ with respect to some bases, it is not clear, in general, whether the Tracy-Singh product of the matrices $A$ and $B$ corresponds to a particular operation on the…
Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on finding compositional inverses of permutation polynomials of…