Related papers: Alternating sign matrices with one -1 under vertic…

We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…

Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…

In this paper we study alternative tableaux introduced by Viennot. These tableaux are in simple bijection with permutation tableaux, defined previously by Postnikov . We exhibit a simple recursive structure for alternative tableaux. From…

Let $\ell,k$ be fixed positive integers. In an earlier work, the first and third authors established a bijection between $\ell$-cores with first part equal to $k$ and $(\ell-1)$-cores with first part less than or equal to $k$. This paper…

The sign patterns of inverse doubly-nonnegative matrices are examined. A necessary and sufficient condition is developed for a sign matrix to correspond to an inverse doubly-nonnegative matrix. In addition, for a doubly-nonnegative matrix…

Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…

This paper introduces a polynomial blind algorithm that determines when two square matrices, $A$ and $B$, are permutation similar. The shifted and translated matrices $(A+\beta I+\gamma J)$ and $(B+\beta I+\gamma J)$ are used to color the…

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…

Let $1 \leq k < n$ be integers. Two $n \times n$ matrices $A$ and $B$ form a parallel pair with respect to the $k$-numerical radius $w_k$ if $w_k(A + \mu B) = w_k(A) + w_k(B)$ for some scalar $\mu$ with $|\mu| = 1$; they form a TEA…

We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…

Matrices allow two products linked by transpose. Biring is algebra which defines on the set two correlated structures of the ring. According to each product we can extend the definition of a quasideterminant given in [1, 2] and introduce…

Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…

Let $B$ be some invertible Hermitian or skew-Hermitian matrix. A matrix $A$ is called $B$-normal if $AA^\star = A^\star A$ holds for $A$ and its adjoint matrix $A^\star := B^{-1}A^HB$. In addition, a matrix $Q$ is called $B$-unitary, if…