Related papers: A pairing between graphs and trees
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
We introduce a general definition of a $n$-crossed module of $P$-algebras over an algebraic operad $P$, which coincides with historical definitions in the cases of the operads As and Lie and $n = 1$. We establish a natural isomorphism…
The notion of a generalized Lie bialgebroid (a generalization of the notion of a Lie bialgebroid) is introduced in such a way that a Jacobi manifold has associated a canonical generalized Lie bialgebroid. As a kind of converse, we prove…
We develop a curved Koszul duality theory for algebras presented by quadratic-linear-constant relations over unital versions of binary quadratic operads. As an application, we study Poisson $n$-algebras given by polynomial functions on a…
Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…
We show how classical and quantum dualities, as well as duality relations that appear only in a sector of certain theories ("emergent dualities"), can be unveiled, and systematically established. Our method relies on the use of morphisms of…
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
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…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.
Our main goal in this paper is to translate the diagram relating groups, Lie algebras and Hopf algebras to the corresponding 2-objects, i.e. to categorify it. This is done interpreting 2-objects as crossed modules and showing the…
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
Adopting the omni-Lie algebroid approach to Dirac-Jacobi structures, we propose and investigate a notion of weak dual pairs in Dirac-Jacobi geometry. Their main motivating examples arise from the theory of multiplicative precontact…
Double construction bialgebras for Poisson 3-Lie algebras and transposed Poisson 3-Lie algebras are defined and studied using matched pairs. Poisson 3-Lie algebras and transposed Poisson 3-Lie algebras are constructed on direct sums and…
The aim of this paper is to further explore an idea from J.-L. Loday briefly exposed in [5]. We impose a natural and simple symmetry on a unit action over the most general quadratic relation which can be written. This leads us to two…