Related papers: Geometric duality, perfect graphs, and the Sierpi\…
Petersen's theorem, one of the earliest results in graph theory, states that any bridgeless cubic multigraph contains a perfect matching. While the original proof was neither constructive nor algorithmic, Biedl, Bose, Demaine, and Lubiw [J.…
Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…
We characterise the pairs of graphs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are perfect. Similarly, we characterise pairs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are…
We investigate a Grothendieck-type inequality for pairs of Banach spaces $E,F$ assuming $E$ is finite-dimensional and study the associated Grothendieck-type constant. We prove that if there is a $C >0$ such that $\|A\otimes…
We give a nonlinear representation of the duals for a class of Banach spaces. This leads to classroom-friendly proofs of the classical representation theorems $H'=H$ and $(L^p)'=L^q$. Our proofs extend to a family of Orlicz spaces, and…
In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs $(G,H)$ such that for any digraph, $D$, $G\to D$ if and only if $D\not\to H$. The directed path on $k+1$ vertices together with the transitive tournament…
In this article we use the cluster structure on the Grassmannian and the combinatorics of plabic graphs to exhibit a new aspect of mirror symmetry for Grassmannians in terms of polytopes. For our $A$-model, we consider the Grassmannian…
We study the complementation (in $\ell_\infty$) of the Banach space $c_{0,\mathcal{I}}$, consisting of all bounded sequences $(x_n)$ that $\mathcal{I}$-converge to $0$, endowed with the supremum norm, where $\mathcal{I}$ is an ideal of…
The aim of this paper is to relate the classical result of Gabriel-Ulmer to the geometry of topoi. The usage of the attribute 'left exact' when dealing with functors involved in this duality is indeed not casual and it is related to the…
We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…
Cembranos and Freniche proved that for every two infinite compact Hausdorff spaces $X$ and $Y$ the Banach space $C(X\times Y)$ of continuous real-valued functions on $X\times Y$ endowed with the supremum norm contains a complemented copy of…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…
Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2$ such that $|M_1\cap X|\not\equiv |M_2\cap X| \pmod 2$.…
Gelfand-Naimark-Stone duality establishes a dual equivalence between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category ${\boldsymbol{\mathit{uba}\ell}}$ of uniformly complete bounded archimedean $\ell$-algebras. We…
Starting from Sinclair's 1976 work {\it Automatic Continuity of Linear Operators}, Cambridge University Press, (1976), on automatic continuity of linear operators on Banach spaces, we prove that sequences of intertwining continuous linear…
Suppose that $B$ is a $G$-Banach algebra over $\mathbb{F} = \mathbb{R}$ or $\mathbb{C}$, $X$ is a finite dimensional compact metric space, $\zeta : P \to X$ is a standard principal $G$-bundle, and $A_\zeta = \Gamma (X, P \times_G B)$ is the…
In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band…
Since their inception perfectoid spaces have catalyzed a revolution in p-adic geometry. We redevelop the foundations of perfectoid spaces from the point of view of Berkovich Spaces, where the underlying topological space of an affinoid…
Let alpha(G) denote the maximum size of an independent set of vertices and mu(G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is perfect. If alpha(G) + mu(G) equals the number of vertices of…