Related papers: Generating Bijections between HOAS and the Natural…
A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from \fun\ to \uqg\ , given by elements of the pure braid group. These operators --- the `reflection matrix' $Y \equiv…
We get new Hopf algebras (HA): 1. A wealth of quotient HA's of the Malvenuto-Reutenauer HA (the Loday-Ronco HA being a special case). They consist of the permutations avoiding an {\it arbitrary} set of permutations without global descents,…
We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters. This in particular implies that any binary language…
We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…
The mathematical software \texttt{GAP} (Groups, Algorithms, Programming) offers a powerful set of tools to investigate computationally group theory. Using this software package we investigate a variation of a well-known problem in…
We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…
An algorithmic computation of the set of unpointed stable homotopy classes of equivariant fibrewise maps was described in a recent paper of the author and his collaborators. In the present paper, we describe a simplification of this…
What makes sets, or more precisely, the category {\bf Set} important in Mathematics are the well known {\it two} specific ways in which arbitrary mappings $f : X \longrightarrow Y$ between any two sets $X, Y$ can {\it fail} to be…
Recently, Jel\'{i}nek derived that the number of self-dual interval orders of reduced size $n$ is twice the number of row-Fishburn matrices of size $n$ by using generating functions. In this paper, we present a bijective proof of this…
We exhibit a bijective correspondence between certain left ideal coideals in a Hopf algebroid for which the resulting quotient is a coequalizer and certain right coideal subrings which are themselves an equalizer, remarkably improving a…
The collection of open sets of a topological space forms a Heyting algebra, which leads to the idea of a Heyting algebra as a generalized topological space. In fact, a sober topological space may be reconstructed from its locale of open…
We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…
Based on Sch\"utzenberger's evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function…
Generating explanations for neural networks has become crucial for their applications in real-world with respect to reliability and trustworthiness. In natural language processing, existing methods usually provide important features which…
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…
We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…
Rough set theory is an important mathematical tool for dealing with uncertain or vague information. This paper studies some new topologies induced by a binary relation on universe with respect to neighborhood opera- tors. Moreover, the…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…