Pseudo-centrosymmetric matrices, with applications to counting perfect matchings
2-even symmetric graphalternating centrosymmetric matrixanti-involutoryAztec diamondAztec pillowCentrosymmetricdeterminantdomino tilingJockuschKasteleyn-Percuspseudo-centrosymmetric
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of tessellation and tiling problems (05B45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Determinants, permanents, traces, other special matrix functions (15A15) Canonical forms, reductions, classification (15A21) Factorization of matrices (15A23)
- A Gessel--Viennot-type method for cycle systems in a directed graph
- A spectral characterization of generalized real symmetric centrosymmetric and generalized real symmetric skew-centrosymmetric matrices
- Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and Eigenvectors
- Eigenvectors of certain matrices
- scientific article; zbMATH DE number 1235366 (Why is no real title available?)
- scientific article; zbMATH DE number 1392314 (Why is no real title available?)
- scientific article; zbMATH DE number 1405497 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Perfect matchings and perfect squares
- The solutions to linear matrix equations \(AX=B\), \(YA=D\) with \(k\)-involutory symmetries
- Structured least-squares problems and inverse eigenvalue problems for (P,Q)-reflexive matrices
- Matrices \(A\) such that \(RA = A^{s+1}R\) when \(R^k = I\)
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- Procrustes problems and associated approximation problems for matrices with \(k\)-involutory symmetries
- Characterizations of \(\{K,s+1\}\)-potent matrices and applications
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices
- Pseudodeterminants and perfect square spanning tree counts
- Procrustes problems for (\(P,Q,\eta \))-reflexive matrices
This page was built for publication: Pseudo-centrosymmetric matrices, with applications to counting perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2459966)