Related papers: Dualities and reciprocities on graphs on surfaces

We present a flux formulation of Double Field Theory, in which geometric and non-geometric fluxes are dynamical and field-dependent. Gauge consistency imposes a set of quadratic constraints on the dynamical fluxes, which can be solved by…

Let $G = (V, E)$ be a connected graph, and let $T$ in $V$ be a subset of vertices. An orientation of $G$ is called $T$-odd if any vertex $v \in V$ has odd in-degree if and only if it is in $T$. Finding a T -odd orientation of G can be…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

We first introduce the class of bipartite absolute retracts with respect to tree obstructions with at most $k$ leaves. Then, using the theory of homomorphism duality, we show that this class of absolute retracts coincides exactly with the…

It is well known, due to Lindstr\"om, that the minors of a (real or complex) matrix can be expressed in terms of weights of flows in a planar directed graph. Another classical fact is that there are plenty of homogeneous quadratic relations…

We prove a recent conjecture on the duality relation for correlation functions of the Potts model for boundary spins of a planar lattice. Specifically, we deduce the explicit expression for the duality of the n-site correlation functions,…

We propose a novel type of duality that connects a sequence of well-known theories with even-multiplicity scalar amplitudes: it relates the Yang-Mills theory coupled to a specific scalar matter sector to the nonlinear sigma model on a…

In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

We generalise the electric-magnetic duality in standard Maxwell theory to its non-commutative version. Both space-space and space-time non-commutativity are necessary. The duality symmetry is then extended to a general class of…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

We advocate an account of dualities between physical theories: the basic idea is that dual theories are isomorphic representations of a common core. We defend and illustrate this account, which we call a Schema, in relation to symmetries.…

Two natural foliations, guided by area and perimeter, of the configurations spaces of planar polygons are considered and the topology of their leaves is investigated in some detail. In particular, the homology groups and the homotopy type…

Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…

In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…

We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientations is equal to the chromatic polynomial evaluated at $-1$…

We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…

We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…

In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…

We address the problem of link reciprocity, the non-random presence of two mutual links between pairs of vertices. We propose a new measure of reciprocity that allows the ordering of networks according to their actual degree of correlation…