Related papers: Geometric duality, perfect graphs, and the Sierpi\…
There are many physically interesting superconformal gauge theories in four dimensions. In this talk I discuss a common phenomenon in these theories: the existence of continuous families of infrared fixed points. Well-known examples include…
A gauge $\gamma$ in a vector space $X$ is a distance function given by the Minkowski functional associated to a convex body $K$ containing the origin in its interior. Thus, the outcoming concept of gauge spaces $(X, \gamma)$ extends that of…
Let $G$ be a simple graph of order $n$. The double vertex graph $F_2(G)$ of $G$ is the graph whose vertices are the $2$-subsets of $V(G)$, where two vertices are adjacent in $F_2(G)$ if their symmetric difference is a pair of adjacent…
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems…
A Banach space is said to be Grothendieck if weak and weak$^*$ convergent sequences in the dual space coincide. This notion has been quantificated by H. Bendov\'{a}. She has proved that $\ell_\infty$ has the quantitative Grothendieck…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
We study the class of Banach spaces $X$ such that the locally convex space $(X,\mu(X,Y))$ is complete for every norming and norm-closed subspace $Y \subset X^*$, where $\mu(X,Y)$ denotes the Mackey topology on $X$ associated to the dual…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a different definition of a burl from the journal version of…
For a group $G$ (of type $F$) acting properly on a coarse Poincar\'{e} duality space $X$, Kapovich-Kleiner introduced a coarse version of Alexander duality between $G$ and its complement in $X$. More precisely, the cohomology of $G$ with…
Let $G=(V,E)$ be a graph and let $A_G$ be the clique-vertex incidence matrix of $G$. It is well known that $G$ is perfect iff the system $A_{_G}\mathbf x\le \mathbf 1$, $\mathbf x\ge\mathbf0$ is totally dual integral (TDI). In 1982, Cameron…
Let $G$ be a locally compact group and $(\Phi,\Psi)$ a complementary pair of Young functions satisfying the $\Delta_2$-condition. Let $A_\Phi(G)$ be the Orlicz analogue of the Fig\`{a}-Talamanca Herz algebra $A_p(G).$ The dual of the…
It was proved by Dodos and Ferenczi that the classes of Banach spaces with a separable dual and of separable reflexive Banach spaces are strongly bounded. In this note, we provide an isometric version of this result.
In this note we describe the dual and the completion of the space of finite linear combinations of $(p,\infty)$-atoms, $0<p\leq 1$ on ${\mathbb R}^n$. As an application, we show an extension result for operators uniformly bounded on…
Duality for complete discrete valuation fields with perfect residue field with coefficients in (possibly p-torsion) finite flat group schemes was obtained by Begueri, Bester and Kato. In this paper, we give another formulation and proof of…
Erd\H{o}s and P\'{o}sa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold if we restrict to odd cycles. However, in…
An \emph{incompatibility system} $(G,\mathcal{F})$ consists of a graph $G$ and a family $\mathcal{F}=\{F_v\}_{v\in V(G)}$ over $G$ with $F_v\subseteq \{\{e,e'\}\in {E(G)\choose 2}: e\cap e'=\{v\}\}$. We say that two edges $e,e'\in E(G)$ are…
Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B. Szegedy: Szemer\'edi's Lemma for the analyst, Geometric…