相关论文: A pairing between graphs and trees

In a preceding paper we introduced a notion of compatibility between a Jacobi structure and a Riemannian structure on a smooth manifold. We proved that in the case of fundamental examples of Jacobi structures : Poisson structures, contact…

A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory…

Lookup tables (finite maps) are a ubiquitous data structure. In pure functional languages they are best represented using trees instead of hash tables. In pure functional languages within constructive logic, without a primitive integer…

The notion of Poisson manifold with compatible pseudo-metric was introduced by the author in [1]. In this paper, we introduce a new class of Lie algebras which we call a pseudo-Rieamannian Lie algebras. The two notions are strongly related:…

We develop invariants of the lower central series of free groups through linking of letters, showing they span the rational linear dual of the lower central series subquotients. We build on an approach to Lie coalgebras through operads,…

Classical mechanical systems are defined by their kinetic and potential energies. They generate a Lie algebra under the canonical Poisson bracket. This Lie algebra, which is usually infinite dimensional, is useful in analyzing the system,…

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

We review properties of q-orthogonal polynomials, related to their orthogonality, duality and connection with the theory of symmetric (self-adjoint) operators, represented by a Jacobi matrix. In particular, we show how one can naturally…

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…

Using the combinatorial species setting, we propose two new operad structures on multigraphs and on pointed oriented multigraphs. The former can be considered as a canonical operad on multigraphs, directly generalizing the…

Cohomology and deformation theories are developed for Poisson algebras starting with the more general concept of a Leibniz pair, namely of an associative algebra $A$ together with a Lie algebra $L$ mapped into the derivations of $A$. A…

Let $\mathfrak{g}$ be a vector space and $[,],[,]'$ be a pair of Lie brackets on $\mathfrak{g}$. By definition they are compatible if $[,]+[,]'$ is again a Lie bracket. Such pairs play important role in bihamiltonian and $r$-matrix…

The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

N-Lie algebra structures on smooth function algebras given by means of multi-differential operators, are studied. Necessary and sufficient conditions for the sum and the wedge product of two $n$-Poisson sructures to be again a multi-Poisson…

We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…

A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…

The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…

We extend the classical associative PI-theory to Associative Pairs, and in doing so, we introduce related notions already present for algebras (and Jordan systems) as the ones of PI-element and PI-ideal, extended centroid and central…