Related papers: Principal minors and rhombus tilings
We study intertwining relations for matrix one-dimensional, in general, non-Hermitian Hamiltonians by matrix differential operators of arbitrary order. It is established that for any matrix intertwining operator Q_N^- of minimal order N…
A linear principal minor polynomial or lpm polynomial is a linear combination of principal minors of a symmetric matrix. By restricting to the diagonal, lpm polynomials are in bijection to multiaffine polynomials. We show that this…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…
Let $\mathcal{M}$ be a square matrix over a commutative ring and let $\mathcal{A}$ be a principal submatrix. We give relations between the determinants of $\mathcal{M}$ and $\mathcal{A}$ based on an annihilating polynomial for one of them.…
We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…
Kenyon and Wilson showed how to test if a circular planar electrical network with $n$ nodes is well-connected by checking the positivity of $\binom{n}{2}$ central minors of the response matrix. Their test is based on the fact that any…
Our motivation comes from the work of Engel and Schneider (1980). Their main theorem implies that two symmetric matrices have equal corresponding principal minors of all orders if and only if they are diagonally similar. This study was…
The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…
We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…
Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…
We study the tropicalization of the image of the cone of positive definite matrices under the principal minors map. It is a polyhedral subset of the set of $M$-concave functions on the discrete $n$-dimensional cube. We show it coincides…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
We review the connections between the octahedral recurrence, $\lambda$-determinants and tiling problems. This provides in particular a direct combinatorial interpretation of the $\lambda$-determinant (and generalizations thereof) of an…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
We consider the inverse problem of finding a magnitude-symmetric matrix (matrix with opposing off-diagonal entries equal in magnitude) with a prescribed set of principal minors. This problem is closely related to the theory of recognizing…
A rhombus tiling of a hexagon is said to be centered if it contains the central lozenge. We compute the number of vertically symmetric rhombus tilings of a hexagon with side lengths $a, b, a, a, b, a$ which are centered. When $a$ is odd and…
We show that there is an isometry between the real ambient space of all Mueller matrices and the space of all Hermitian matrices which maps the Mueller matrices onto the positive semidefinite matrices. We use this to establish an optimality…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…