Related papers: An Hopf algebra for counting simple cycles
Gian-Carlo Rota mentioned in one of his last articles the problem of developing a theory around the notion of integration algebras, which should be dual to the one of differential algebras. This idea has been developed historically along…
In this paper, we define a Hopf algebra structure on the vector space spanned by packed words using a selection-quotient coproduct. We show that this algebra is free on its irreducible packed words. Finally, we give some brief explanations…
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the…
In this dissertation we study the coefficients spaces (SAYD modules) of Hopf-cyclic cohomology theory over a certain family of bicrossed product Hopf algebras, and we compute the Hopf-cyclic cohomology of such Hopf algebras with…
In this article we discuss the question of presence of Hamiltonian cycle in the un-directed power graph of a group. In the process we develop weighted Hamiltonian cycle concept and prove a few general results regarding the Hamiltonian…
A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.
Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
A graph is called chordal if it forbids induced cycles of length 4 or more. In this paper, we attempt to identify the non-nilpotent groups whose power graph is a chordal graph (this question was raised by Cameron in [4]). In this direction,…
By finite quantum groups we mean Lusztig's finite-dimensional pointed Hopf algebras called quantum Frobenius Kernels [9, 10], and their natural generalizations due to Andruskiewitsch and Schneider [2, 3]. For a Hopf algebra $H$ in a special…
Described the algebraic structure on the space of homotopy classes of cycles with marked topological flags of disks. This space is a non-commutative monoid, with an Abelian quotient corresponding to the group of singular homologies…
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown…
In this paper we calculate both the periodic and non-periodic Hopf-cyclic cohomology of Drinfeld-Jimbo quantum enveloping algebra $U_q(\mathfrak{g})$ for an arbitrary semi-simple Lie algebra $\mathfrak{g}$ with coefficients in a modular…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We show, for all $n\ge 2$ even and $d\ge 2+\frac{4}{n}$, that the moduli of smooth degree $d$ hypersurfaces of $\mathbb{P}^{n+1}$ contains infinitely many different Hodge loci whose Zariski tangent space has the same codimension as the…
A generalized de Bruijn digraph generalizes a de Bruijn digraph to the case where the number of vertices need not be a pure power of an integer. Hamiltonian cycles in these digraphs thus generalize regular de~Bruijn cycles, and we will thus…
We determine, for all $k\geq 6$, the typical structure of graphs that do not contain an induced $2k$-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the typical structure of such graphs is richer than that…
We define the concept of \emph{companion automorphism} of a Hopf algebra $H$ as an automorphism $\sigma:H \rightarrow H$: $\sigma^2=S^2$ --where $S$ denotes the antipode--. A Hopf algebra is said to be \emph{almost involutive} (AI) if it…
In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…