Related papers: An Hopf algebra for counting simple cycles
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
Let $\mathcal{H}$ be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let $G$ be an arbitrary finite $\mathcal{H}$-free graph with minimum degree at least $k$. For $p \in [0,1]$, we form a $p$-random…
We introduce the Hopf monoid of sets of cycles and paths, which contains the Fa\`a di Bruno Hopf monoid as a submonoid. We give cancellation-free and grouping-free formulas for its antipode, one in terms of tubings and one in terms of…
Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…
By applying a recent construction of free Baxter algebras, we obtain a new class of Hopf algebras that generalizes the classical divided power Hopf algebra. We also study conditions under which these Hopf algebras are isomorphic.
In a series of papers the present authors and their coworkers have developed a family of algebraic techniques to solve a number of problems in the theory of discrete or continuous dynamical systems and to analyze numerical integrators.…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…
A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be…
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
Following the idea of an invariant differential complex, we construct general-type cyclic modules that provide the common denominator of known cyclic theories. The cyclicity of these modules is governed by Hopf-algebraic structures. We…
By using cocycle deformation, we construct a certain class of Hopf algebras, containing the quantized enveloping algebras and their analogues, from what we call pre-Nichols algebras. Our construction generalizes in some sense the known…
A classical result of Loday-Quillen and Tsygan states that the Lie algebra homology of the algebra of stable matrices over an associative algebra is isomorphic, as a Hopf algebra, to the exterior algebra of the cyclic homology of the…
The correspondence between Lie algebras, Lie groups, and algebraic groups, on one side and commutative Hopf algebras on the other side are known for a long time by works of Hochschild-Mostow and others. We extend this correspondence by…
We study pure ordered simplicial complexes (i.e., simplicial complexes with a linear order on their ground sets) from the Hopf-theoretic point of view. We define a \textit{Hopf class} to be a family of pure ordered simplicial complexes that…
We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…
We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…
For a planar graph $H$, let $f(H)$ denote the minimum integer such that all graphs excluding $H$ as a minor have treewidth at most $f(H)$. We show that if $H$ is a disjoint union of $k$ cycles then $f(H)=O(|V(H)| + k \log k)$, which is best…
Operators are induced on fermion and zeon algebras by the action of adjacency matrices and combinatorial Laplacians on the vector spaces spanned by the graph's vertices. Properties of the algebras automatically give information about the…