Related papers: A graph theoretic proof of Cramer's rule

The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].

In this paper, we proved the normal scalar curvature conjecture and the Bottcher-Wenzel conjecture.

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…

Using a Heegaard diagram for the pullback of a knot $K \subset S^3$ in its cyclic branched cover $\Sigma_m(K)$ obtained from a grid diagram for $K$, we give a combinatorial proof for the invariance of the associated combinatorial knot Floer…

It is known that the duals of transversal matroids are precisely the strict gammoids. The purpose of this short note is to show how the Lindstrom-Gessel-Viennot lemma gives a simple proof of this result.

In 1750, Gabriel Cramer famously stated, without proof, his eponymous rule for solving a system of linear equations with as many equations as unknowns. We give a purely combinatorial, and purely self-contained, proof of this old chestnut,…

We prove Levinson's theorem for scattering on an (m+n)-vertex graph with n semi-infinite paths each attached to a different vertex, generalizing a previous result for the case n=1. This theorem counts the number of bound states in terms of…

In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.

In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem proved by Mader [J. Graph Theory 65 (2010), 61-69. (Theorem…

This is an exposition of Gauss's proof of Descartes's rule of signs.

We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of…

Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set…

The Kneser conjecture (1955) was proved by Lov\'asz (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions.…

We present a proof of the formula (given in Lurie's Higher Algebra) for the operad governing diagrams of operad algebras. We believe that our proof corrects a flaw in the original argument. 2nd version: a corrected proof given.

We prove an analog of Levinson's theorem for scattering on a weighted (m+1)-vertex graph with a semi-infinite path attached to one of its vertices. In particular, we show that the number of bound states in such a scattering problem is equal…

This note is an exposition of the proof of Thom's conjecture by Kronheimer and Mrowka, using the new Seiberg-Witten invariants.

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…