Related papers: Dualities and reciprocities on graphs on surfaces
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…
We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…
We discuss the connections tying Laplacian matrices to abstract duality and planarity of graphs.
We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths,…
The existence of the limiting pair correlation for angles between reciprocal geodesics on the modular surface is established. An explicit formula is provided, which captures geometric information about the length of reciprocal geodesics, as…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
This article is an exposition of a body of existing results, together with an announcement of recent results. We discuss a theory of polytopes associated to bipartite graphs and trinities, developed by K\'alm\'an, Postnikov and others. This…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
We introduce a doubled formalism for the bosonic sector of the maximal supergravities, in which a Hodge dual potential is introduced for each bosonic field (except for the metric). The equations of motion can then be formulated as a twisted…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
Spectral flow in two-dimensional field theories is known to correspond to geometrical twisting between two circles in the gravity dual. We generalize this operation to the geometries which have SO(k+1) x SO(k+1) isometries with k>1 and…
Two dimensional flows on fixed smooth surfaces have been studied in the point of view of vorticity dynamics. Firstly, the related deformation theory including kinematics and kinetics is developed. Secondly, some primary relations in…
Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature for it allows to concentrate on the combinatorial problem…
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
We introduce a duality triads` notion. These are dual recurrences as used in dynamical data bases theory completed by a third pertinacious relation. Several representative examples of them are given. q-Gaussian triads as well as Fibonomial…