Related papers: The Main Diagonal of a Permutation Matrix

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content of various decomposition theorems. In this paper, we…

Let F : P^n --> P^n be a morphism of degree d > 1 defined over C. The dynamical Mordell--Lang conjecture says that the intersection of an orbit O_F(P) and a subvariety X of P^n is usually finite. We consider the number of linear…

A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…

We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…

The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two…

We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids (which is not possible for…

The diagonal spin-spin correlations of the square lattice Ising model, originally expressed as Toeplitz determinants, are given by two distinct Fredholm determinants - one with an integral operator having an Appell function kernel and…

We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…

We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…

A celebrated theorem of Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number $p$, we prove that there is an…

We study the diagonals of two-dimensional tilings generated by direct product substitutions. The properties of these diagonals are primarily determined by the eigenvalues of the substitution matrix, but also the order of the letters in the…

When using a finite difference method to solve an initial--boundary--value problem, the truncation error is often of lower order at a few grid points near boundaries than in the interior. Normal mode analysis is a powerful tool to analyze…

Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…

The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…

We prove that the set of permutations sorted by a stack of depth $t \geq 3$ and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a…

Let F be a field of characteristic different from $2$, and let $UT_2(F)$ be the algebra of $2\times 2$ upper triangular matrices over $F$. For every involution of the first kind on $UT_2(F)$, we describe the set of all $*$-central…

Just like Atiyah Lie algebroids encode the infinitesimal symmetries of principal bundles, exact Courant algebroids are believed to encode the infinitesimal symmetries of $S^1$-gerbes. At the same time, transitive Courant algebroids may be…

Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…

We propose a new definition of the interface in the context of the Bernoulli percolation model. We construct a coupling between two percolation configurations, one which is a standard percolation configuration, and one which is a…