Related papers: An Hopf algebra for counting simple cycles

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of…

We give an introductory survey to the use of Hopf algebras in several problems of noncommutative geometry. The main example, the Hopf algebra of rooted trees, is a graded, connected Hopf algebra arising from a universal construction. We…

We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results…

We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be…

In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$. E.g., a cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is easy to…

In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\log…

We introduce the notion of Hopf algebroids, in which neither the total algebras nor the base algebras are required to be commutative. We give a class of Hopf algebroids associated to module algebras of the Drinfeld doubles of Hopf algebras…

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…

Using the shuffle structure of the graphs, we introduce a new kind of the Hopf algebraic structure for tagged graphs with, or without loops. Like a quantum group structure, its product is non-commutative. With the help of the Hopf algebraic…

We construct algebraic cycles in Bloch's cubical cycle group which correspond to multiple polylogarithms with generic arguments. Moreover, we construct out of them a Hopf subalgebra in the Bloch-Kriz cycle Hopf algebra. In the process, we…

In this paper we extend counting of traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, for a fixed finite set of tiles, counting traversing Hamiltonian cycles can be done in linear time with…

A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this…

We show by a direct computation that, for any Hopf algebra with a modulus-like character, the formulas first introduced in [CM] in the context of characteristic classes for actions of Hopf algebras, do define a cyclic module. This provides…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.

Any simplicial Hopf algebra involves $2n$ different projections between the Hopf algebras $H_n,H_{n-1}$ for each $n \geq 1$. The word projection, here meaning a tuple $\partial \colon H_{n} \to H_{n-1}$ and $i \colon H_{n-1} \to H_{n}$ of…

The cyclic (co)homology of Hopf algebras is defined by Connes and Moscovici [math.DG/9806109] and later extended by Khalkhali et.al [math.KT/0306288] to admit stable anti-Yetter-Drinfeld coefficient module/comodules. In this paper we will…

Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…