Related papers: An Hopf algebra for counting simple cycles
Combinatorial Hopf algebras give a linear algebraic structure to infinite families of combinatorial objects, a technique further enriched by the categorification of these structure via the representation theory of families of algebras. This…
Recently, M.~Baker and N.~Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generalize the notion of minors and direct sums from ordinary matroids to…
The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with M\"obius function as antipode. Here m-weak means that…
This article introduces a method, which starting from simple and quite general mathematical data, allows to construct linear algebras of operators which are, each of them, endowed with a bialgebra structure (coproduct and counity). Moreover…
We illustrate the application of the matrix-transfer method for a number of enumeration problems concerning the party game Silent Circles, Hamiltonian cycles in the antiprism graphs, and simple paths and cycles of a fixed length in…
To any Hopf algebra H we associate two commutative Hopf algebras, which we call the first and second lazy homology Hopf algebras of H. These algebras are related to the lazy cohomology groups based on the so-called lazy cocycles of H by…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in which each edge connects exactly two vertices, an…
We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…
A \emph{simple} matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix $F$, we say that a (0,1)-matrix $A$ has $F$ as a \emph{Berge hypergraph} if there is a submatrix $B$ of $A$ and some row and column permutation of $F$,…
In this paper we investigate nilpotenct and probabilistically nilpotent Hopf algebras. We define nilpotency via a descending chain of commutators and give a criterion for nilpotency via a family of central invertible elements. These…
The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…
Two important generalizations of the Hopf algebra of symmetric functions are the Hopf algebra of noncommutative symmetric functions and its graded dual the Hopf algebra of quasisymmetric functions. A common generalization of the latter is…
We define a Hopf cyclic (co)homology theory in an arbitrary symmetric strict monoidal category. Thus we unify all different types of Hopf cyclic (co)homologies under one single universal theory. We recover Hopf cyclic (co)homology of module…
One can define the notion of primitive length spectrum for a simple regular periodic graph via counting the orbits of closed reduced primitive cycles under an action of a discrete group of automorphisms. We prove that this primitive length…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…