Related papers: Duality of Graph Invariants

This paper delves into three research directions, leveraging the Lov\'{a}sz $\vartheta$-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses…

Let $\Gamma$ be a function that maps two arbitrary graphs $G$ and $H$ to a non-negative real number such that $$\alpha(G^{\boxtimes n})\leq \alpha(H^{\boxtimes n})\Gamma(G,H)^n$$ where $n$ is any natural number and $G^{\boxtimes n}$ is the…

The concept of the \textit{relative fractional packing number} between two graphs $G$ and $H$, initially introduced in arXiv:2307.06155 [math.CO], serves as an upper bound for the ratio of the zero-error Shannon capacity of these graphs.…

Given a partition ${\mathcal V}=(V_1, \ldots,V_m)$ of the vertex set of a graph $G$, an {\em independent transversal} (IT) is an independent set in $G$ that contains one vertex from each $V_i$. A {\em fractional IT} is a non-negative real…

A formulation of linearized gravity which is manifestly invariant under electric-magnetic duality rotations in the internal space of the metric and its dual, and which contains both metrics as basic variables (rather than the corresponding…

We show that for any graph $G$, by considering "activation" through the strong product with another graph $H$, the relation $\alpha(G) \leq \vartheta(G)$ between the independence number and the Lov\'{a}sz number of $G$ can be made…

Given a weighted graph $G_\bx$, where $(x(v): v \in V)$ is a non-negative, real-valued weight assigned to the vertices of G, let $B(G_\bx)$ be an upper bound on the fractional chromatic number of the weighted graph $G_\bx$; so…

We show that the duality between the self-dual and Maxwell-Chern-Simons theories in 2+1-dimensions survives when the space-time becomes noncommutative. Existence of the Seiberg-Witten map is crucial in the present analysis. It should be…

In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\'asz number which is equal to its fractional packing number. The…

General Relativity can be formulated in terms of a spatially Weyl invariant gauge theory called Shape Dynamics. Using this formulation, we establish a "bulk/bulk" duality between gravity and a Weyl invariant theory on spacelike Cauchy…

We consider the reduction of the duality invariant approach to M-theory by a U-duality group valued Scherk-Schwarz twist. The result is to produce potentials for gauged supergravities that are normally associated with non-geometric…

We generalize our picture in [arXiv:0904.1744], and consider a pure abelian gauge theory on a four-manifold with nonlocal operators of every codimension arbitrarily and simultaneously inserted. We explicitly show that (i) the theory enjoys…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Given a principal fibre bundle with structure group $S$, and a fibre transitive Lie group $G$ of automorphisms thereon, Wang's theorem identifies the invariant connections with certain linear maps $\psi\colon \mathfrak{g}\rightarrow…

Let $\Theta(G)$ denote the Shannon capacity of a graph $G$. We give an elementary proof of the equivalence, for any graphs $G$ and $H$, of the inequalities $\Theta(G\sqcup H)>\Theta(G)+\Theta(H)$ and $\Theta(G\boxtimes…

We present a summary of the applications of duality to Donaldson-Witten theory and its generalizations. Special emphasis is made on the computation of Donaldson invariants in terms of Seiberg-Witten invariants using recent results in N=2…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…