Related papers: An Hopf algebra for counting simple cycles
The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…
We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ${\cal D}(n,p)$ for nearly optimal $p$ (up to a $\log ^cn$ factor). In particular, we show that given $t = (1-o(1))np$ Hamilton cycles $C_1,\ldots ,C_{t}$,…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…
We show that there is a family of complex semisimple Hopf algebras that do not admit a Hopf order over any number ring. They are Drinfel'd twists of certain group algebras. The twist contains a scalar fraction which makes impossible the…
A cohomology theory of the adjoint of Hopf algebras, via deformations, is presented by means of diagrammatic techniques. Explicit calculations are provided in the cases of group algebras, function algebras on groups, and the bosonization of…
We analyse the Dirichlet convolution ring of arithmetic number theoretic functions. It turns out to fail to be a Hopf algebra on the diagonal, due to the lack of complete multiplicativity of the product and coproduct. A related Hopf algebra…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
A short proof is given of the fact that various classes of algebras including the free associative algebra are Hopfian, i.e., every epimorphism is an automorphism. This further simplifies the Dicks-Lewin solution of the Jacobian conjecture…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H(m,n;h,k)$ is an $m \times n$ partially filled array with distinct…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…
We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
As an instance of a linear action of a Hopf algebra on a free associative algebra, we consider finite group gradings of a free algebra induced by gradings on the space spanned by the free generators. The homogeneous component corresponding…
In the random hypergraph H=H(n,p;3) each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {x_i,y_i,x_{i+1}\} for i=1,2,...,n/2. We prove that there exists an absolute…
Leibniz algebras generated by one element, called cyclic, provide simple and illuminating examples of many basic concepts. It is the purpose of this paper to illustrate this fact.
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
We obtain a mixed complex simpler than the canonical one the computes the type cyclic homologies of a crossed product with invertible cocycle $A\times_{\rho}^f H$, of a weak module algebra $A$ by a weak Hopf algebra $H$. This complex is…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…