Related papers: Dualities and reciprocities on graphs on surfaces
We recall fundamental aspects of the pluriclosed flow equation and survey various existence and convergence results, and the various analytic techniques used to establish them. Building on this, we formulate a precise conjectural…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
The paper deals with first order self-adjoint elliptic differential operators on a smooth compact oriented surface with non-empty boundary. We consider such operators with self-adjoint local boundary conditions. The paper is focused on…
We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic…
We introduce a combinatorial model based on measured foliations in surfaces which captures the phenomenology of open/closed string interactions. The predicted equations are derived in this model, and new equations can be discovered as well.…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
We prove several new sufficient conditions for hamiltonicity and bipancyclicity in balanced bipartite digraphs, in terms of sums of degrees over dominating or dominated pairs of vertices.
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
Flows on surfaces are one of the most fundamental and classical objects in dynamical systems, and are studied from various areas (e.g. integrable systems, differential equations, fluid mechanics). Though hyperbolic flows and recurrent flows…
Bases, mappings, projections and metrics, natural for Neural network training, are introduced. Graph-theoretical interpretation is offered. Non-Gaussianity naturally emerges, even in relatively simple datasets. Training statistics,…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We dualize previous work on generalized persistence diagrams for filtrations to cofiltrations. When the underlying space is a manifold, we express this duality as a Poincar\'e duality between their generalized persistence diagrams. A heavy…
We introduce a notion of abelian cohomology in the context of smooth flows. This is an equivalence relation which is weaker than the standard cohomology equivalence relation for flows. We develop Livshits theory for abelian cohomology over…