相关论文: A pairing between graphs and trees

Let X be an ordered alphabet. Lie_2(n) (and P_2(n) respectively) are the multilinear parts of the free Lie algebra (and the free Poisson algebra respectively) on X with a pair of compatible Lie brackets. In this paper, we prove the…

We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…

We construct quadratic finite-dimensional Poisson algebras and their quantum versions related to rank N and degree one vector bundles over elliptic curves with n marked points. The algebras are parameterized by the moduli of curves. For N=2…

The aim of this paper is to present remarkable classes of Lie-admissible algebras containing in particular the associative algebras, the Vinberg algebras and pre-Lie algebras. We determine the associated quadratic operads and their dual…

A $\mathfrak{g}$-oper for a simple Lie algebra $\mathfrak{g}$ is a specific type of flat principal bundle on an algebraic curve. When the base field is of prime characteristic $p$, those with vanishing $p$-curvature are called dormant…

We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

A new family of $n$-dimensional solutions of the Jacobi identities is characterized. Such a family is very general, thus unifying in a common framework many different well-known Poisson systems seemingly unrelated. This unification is not…

We define the Laplacian matrix and the Jacobian group of a finite graph of groups. We prove analogues of the matrix tree theorem and the class number formula for the order of the Jacobian of a graph of groups. Given a group $G$ acting on a…

We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the…

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

In \cite{CGH15} we introduced TiRS graphs and TiRS frames to create a new natural setting for duals of canonical extensions of lattices. In this continuation of \cite{CGH15} we answer Problem 2 from there by characterising the perfect…

Jacobi/Poisson algebras are algebraic counterparts of Jacobi/Poisson manifolds. We introduce representations of a Jacobi algebra $A$ and Frobenius Jacobi algebras as symmetric objects in the category. A characterization theorem for…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

We introduce a function of the density of states for periodic Jacobi matrices on trees and prove a useful formula for it. This allows new, streamlined proofs of the gap labeling and Aomoto index theorems. We prove a version of this new…

We study the correspondence assigning the vertices of a certain quotient of the local Bruhat-Tits tree for the general linear group over a global function field, to conjugacy classes of maximal orders in some quaternion algebras. The…

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…

Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…