English
Related papers

Related papers: Speyer's elegant topological proof for Kasteleyn's…

200 papers

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

Combinatorics · Mathematics 2016-07-27 Forest Tong

The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…

Category Theory · Mathematics 2020-10-23 Xuexing Lu

The goal of this note is to show that Hastings' counterexample to the additivity of minimal output von Neumann entropy can be readily deduced from a sharp version of Dvoretzky's theorem on almost spherical sections of convex bodies.

Quantum Physics · Physics 2011-06-07 Guillaume Aubrun , Stanislaw Szarek , Elisabeth Werner

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…

Algebraic Topology · Mathematics 2024-04-02 Shaobo Di , Sergei O. Ivanov , Lev Mukoseev , Mengmeng Zhang

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

Combinatorics · Mathematics 2014-02-10 Vassily Olegovich Manturov

We give an alternative proof of Madsen-Weiss' generalized Mumford conjecture. Our proof is based on ideas similar to Madsen-Weiss' original proof, but it is more geometrical and less homotopy theoretical in nature. At the heart of the…

Geometric Topology · Mathematics 2014-11-11 Yakov Eliashberg , Soren Galatius , Nikolai Mishachev

We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…

Computational Geometry · Computer Science 2024-01-09 Keenan Lee , André van Renssen

In this paper we give a geometric proof of the Karpelevich's theorem that asserts that a semisimple Lie subgroup of isometries, of a symmetric space of non compact type, has a totally geodesic orbit. In fact, this is equivalent to a…

Differential Geometry · Mathematics 2014-02-26 Antonio J. Di Scala , Carlos Olmos

We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.

History and Overview · Mathematics 2021-07-20 Vyacheslav M. Abramov

We give a "soft" proof of Alberti's Luzin-type theorem in [1] (G. Alberti, A Lusintype theorem for gradients, J. Funct. Anal. 100 (1991)), using elementary geometric measure theory and topology. Applications to the $C^2$-rectifiability…

Analysis of PDEs · Mathematics 2026-01-30 Siran Li

A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations.

Combinatorics · Mathematics 2007-05-23 Kenneth P. Bogart , Douglas B. West

I expound here in a more detailed way a proof of an important Serini's theorem, which I have already sketched in a previous Note. Two related questions are briefly discussed.

General Physics · Physics 2007-05-23 A. Loinger

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

Combinatorics · Mathematics 2014-10-29 Vaidy Sivaraman

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…

Number Theory · Mathematics 2013-10-01 Mohammad Bardestani , Tristan Freiberg

We reformulate the statement of the Feit-Thompson theorem in terms of diagrams in the category of finite groups, namely iterations of the Quillen lifting property with respect to particular morphisms.

Group Theory · Mathematics 2016-08-23 Misha Gavrilovich

We present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…

Combinatorics · Mathematics 2025-10-14 Gabriel Currier

This paper is a contribution to understanding what properties should a topological algebra on a Stone space satisfy to be profinite. We reformulate and simplify proofs for some known properties using syntactic congruences. We also clarify…

General Topology · Mathematics 2023-01-31 Jorge Almeida , Herman Goulet-Ouellet , Ondřej Klíma

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

Dynamical Systems · Mathematics 2007-09-09 Bau-Sen Du

Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…

Combinatorics · Mathematics 2023-10-10 Jakub Smolík

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…

Combinatorics · Mathematics 2019-04-30 Patrick De Leenheer