Related papers: Determinant Formulae for some Tiling Problems and …
Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…
We define sets of coulourings of the infinite discrete plane using monadic second order (MSO) formulas. We determine the complexity of deciding whether such a formula defines a subshift, parametrized on the quantifier alternation complexity…
We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
We present determinant formulae for the form factors of spin operators of general integrable XXX Heisenberg spin chains for arbitrary (finite dimensional) spin representations. The results apply to any "mixed" spin chains, such as…
We prove a transformation formula relating two determinants involving elliptic shifted factorials. Similar determinants have been applied to multiple elliptic hypergeometric series.
This is a review (including some background material) of the author's work and related activity on certain exactly solvable statistical models in two dimensions, including the six-vertex model, loop models and lozenge tilings. Applications…
We prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the…
We give an explicit determinant formula for a class of rational solutions of the Painlev\'e V equation in terms of the universal characters.
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice…
The problem of the limit shape of large alternating sign matrices (ASMs) is addressed by studying the emptiness formation probability (EFP) in the domain-wall six-vertex model. Assuming that the limit shape arises in correspondence to the…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…