English
Related papers

Related papers: A colourful path to matrix-tree theorems

200 papers

In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…

Differential Geometry · Mathematics 2011-02-23 Florin Dumitrescu

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Combinatorics · Mathematics 2014-04-25 Nathan Bowler , Johannes Carmesin

In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a…

Combinatorics · Mathematics 2009-09-15 ShinnYih Huang

We examine versions of the classical inequalities of Paley and Zygmund for functions of several variables. A sharp multiplier inclusion theorem and variants on the real line are obtained.

Classical Analysis and ODEs · Mathematics 2017-02-24 Odysseas Bakas

We give an elementary proof of the Mazur-Tate-Teitelbaum conjecture for elliptic curves by using Kato's element.

Number Theory · Mathematics 2007-05-23 Shinichi Kobayashi

Recently Csikv\'ari \cite{csik} proved a conjecture of Nikiforov concerning the number of closed walks on trees. Our aim is to extend his theorem to all walks. In addition, we give a simpler proof of Csikv\'ari's result and answer one of…

Combinatorics · Mathematics 2010-02-16 Bela Bollobas , Mykhaylo Tyomkyn

It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…

Discrete Mathematics · Computer Science 2012-10-31 Jan Kratochvíl , Michal Vaner

This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural…

Combinatorics · Mathematics 2007-05-23 David M. Bressoud

Kolmogorov's invariant torus theorem is proved using a simple fixed point theorem.

Dynamical Systems · Mathematics 2015-05-27 Jacques Féjoz

We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…

History and Overview · Mathematics 2015-09-23 Manjil P. Saikia

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

Combinatorics · Mathematics 2025-11-19 Vincent Brugidou

In this paper, we prove several generalizations and applications of a fixed point theorem. This theorem is used to prove the existence and uniqueness of solutions of the linear sparse matrix problem considered.

Classical Analysis and ODEs · Mathematics 2015-07-30 Xiaorong Liu

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

Number Theory · Mathematics 2021-08-03 Jorma Jormakka , Sourangshu Ghosh

We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…

Logic in Computer Science · Computer Science 2019-02-25 Thomas Powell

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

Differential Geometry · Mathematics 2007-05-23 Mark Stern

Mermin's simple "pentagram" proof of the Kochen-Specker theorem is examined from various perspectives. We emphasise the many mathematical structures intimately related to Kochen-Specker proofs, ranging through functional analysis, sheaf…

Quantum Physics · Physics 2015-11-04 Leon Loveridge , Raouf Dridi

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…

Combinatorics · Mathematics 2024-05-03 Adrian Rettich

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

Combinatorics · Mathematics 2018-05-08 David Conlon , Jeong Han Kim , Choongbum Lee , Joonkyung Lee

In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2009-10-12 A. Branquinho , F. Marcellán , A. Mendes

We use a cohomology theory coming from the canonical trace on a C*-algebra of the projective variety to prove an analog of the Riemann Hypothesis for the Kuga-Sato varieties over finite fields.

Algebraic Geometry · Mathematics 2025-03-03 Igor V. Nikolaev