Related papers: Combinatorial proofs of multivariate Cayley--Hamil…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding the determinant of sum of matrices. Also we find a new…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We consider the space of $n$-tuples of pairwise commuting elements in the Lie algebra of $U(m)$. We relate its one-point compactification to the subquotients of certain rank filtrations of connective complex $K$-theory. We also describe the…
In a recent paper, Caracciolo, Sokal and Sportiello presented, inter alia, an algebraic/combinatorial proof for Cayley's identity. The purpose of the present paper is to give a "purely combinatorial" proof for this identity; i.e., a proof…
Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…
Some mathematical theorems represent ideas that are discovered again and again in different forms. One such theorem is Hall's marriage theorem. This theorem is equivalent to several other theorems in combinatorics and optimization theory,…
The q-generalizations of the two fundamental statements of matrix algebra -- the Cayley-Hamilton theorem and the Newton relations -- to the cases of quantum matrix algebras of an "RTT-" and of a "Reflection equation" types have been…
The Cayley-Hamilton-Newton theorem - which underlies the Newton identities and the Cayley-Hamilton identity - is reviewed, first, for the classical matrices with commuting entries, second, for two q-matrix algebras, the RTT-algebra and the…
The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…
We use the exterior product of double forms to reformulate celebrated classical results of linear algebra about matrices and bilinear forms namely the Cayley-Hamilton theorem, Laplace expansion of the determinant, Newton identities and…
We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases…
We deduce a special case of a theorem of M. Haiman concerning alternating polynomials in 2n variables from our results about almost commuting variety, obtained earlier in a joint work with W.-L. Gan.
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
An nxn matrix A over an arbitrary unitary ring R satisfies invariant left and right Cayley-Hamilton identities with matrix coefficients C(i), D(i) having commutator sum entries. If R has a grading similar to the case of Grassmann algebras,…
The traditional Riemann Mapping Theorem can be proved with circle packing techniques. We prove the Combinatorial Riemann Mapping Theorem for tilings of bounded size using circle packings.
We consider polynomial maps, which we call degree $d$-linear maps, that satisfy the Jacobian condition. We prove that certain infinite families of elements, which appear in the coefficients of the formal inverse of such maps, are in the…