Related papers: Bijections for hook pair identities
Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…
In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.
The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…
The (dual) Cauchy identity has an easy algebraic proof utilising a commutation relation between the up and (dual) down operators. By using Fomin's growth diagrams, a bijective proof of the commutation relation can be "bijectivised" to…
A very short, bijective proof, of Touchard's Catalan identity is given, using Dyck paths.
We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. For the first time in the literature, the three different definitions of the Weil pairing are stated correctly and proved to be…
The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
We survey a vast array of known results and techniques in the area of polynomial identities in pointed Hopf algebras. Some new results are proven in the setting of Hopf algebras that appeared in papers of D. Radford and N. Andruskiewitsch -…
We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements…
Basic definitions and properties of nearly associative algebras are described. Nearly associative algebras are proved to be Lie-admissible algebras. Two-dimensional nearly associative algebras are classified, and its main classes are…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
Homology theories for associative algebraic structures are well established and have been studied for a long time. More recently, homology theories for self-distributive algebraic structures motivated by knot theory, such as quandles and…
It is shown that in every multiplicative right Hom-alternative algebra, a Hom-type generalization of the Mikheev identity holds. It is then inferred that a multiplicative right Hom-alternative algebra with an injective twisting map and…
In a Hom-Malcev algebra an identity, equivalent to the Hom-Malcev identity, is found.
A sequential test is proposed for detection and isolation of hubs in a correlation graph. Hubs in a correlation graph of a random vector are variables (nodes) that have a strong correlation edge. It is assumed that the random vectors are…
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…
We introduce the conception of matched pairs of $(H, \beta)$-Lie algebras, construct an $(H, \beta)$-Lie algebra through them. We prove that the cocycle twist of a matched pair of $(H, \beta)$-Lie algebras can also be matched.