Related papers: Cauchy-Binet for Pseudo-Determinants

An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…

We compute the diagonal F-thresholds of determinantal hypersurfaces arising from a generic matrix and from a generic symmetric matrix, as well as of the Pfaffian hypersurface arising from a generic skew-symmetric matrix of even size. The…

We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

Several graph decompositions that factorize the determinant of the adjacency matrix isolate a K\H{o}nig-Egerv\'ary part, such as the SD--KE decomposition and the critical independence decomposition of Larson. This suggests that the study of…

Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…

If G is a finite graph, then the largest eigenvalue L of the adjacency matrix of G is a totally real algebraic integer (L is the Perron-Frobenius eigenvalue of G). We say that G is abelian if the field generated by L^2 is abelian. Given a…

In the past decades, determinants and Pfaffians were found for eigenvalue correlations of various random matrix ensembles. These structures simplify the average over a large number of ratios of characteristic polynomials to integrations…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Let $G$ be a finite group, and $F$ a field of characteristic $0$ or prime to the order of $G$. In $1952$, Witt and in $1956$, Berman independently proved that the number of inequivalent irreducible $F$-representations of $G$ is equal to the…

We study the PI degree of various quantum algebras at roots of unity, including quantum Grassmannians, quantum Schubert varieties, partition subalgebras, and their associated quantum affine spaces. By a theorem of De Concini and Procesi,…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…

Let $A(t)$ be an elliptic, product-type suspended (which is to say parameter-dependant in a symbolic way) family of pseudodifferential operators on the fibres of a fibration $\phi$ with base $Y.$ The standard example is $A+it$ where $A$ is…

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

In this paper, we review and extend a family of log-det divergences for symmetric positive definite (SPD) matrices and discuss their fundamental properties. We show how to generate from parameterized Alpha-Beta (AB) and Gamma Log-det…

If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O & D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a diagonal…

A graph $G$ contains a graph $H$ as an induced minor if $H$ can be obtained from $G$ after vertex deletions and edge contractions. We show that for every $k$-vertex planar graph $H$, every graph $G$ excluding $H$ as an induced minor and…

We describe a connection between the subjects of cluster algebras, polynomial identity algebras and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity…

A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the…

One of the classic results of group theory is the so-called Schur theorem. It states that if the central factor-group $G/\zeta(G)$ of a group $G$ is finite, then its derived subgroup $[G,G]$ is also finite. This result has numerous…