Related papers: Generating Bijections between HOAS and the Natural…

We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…

Providing a human-understandable explanation of classifiers' decisions has become imperative to generate trust in their use for day-to-day tasks. Although many works have addressed this problem by generating visual explanation maps, they…

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

We apply the loop module construction of arXiv:1504.05114 in the context of Lie colour algebras. We construct a bijection between the equivalence classes of all finite-dimensional graded irreducible Lie colour algebra representations from…

In this paper, we present a new method to derive formulas for the generating functions of interval orders, counted with respect to their size, magnitude, and number of minimal and maximal elements. Our method allows us not only to…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

The $P$-partition generating function of a (naturally labeled) poset $P$ is a quasisymmetric function enumerating order-preserving maps from $P$ to $\mathbb{Z}^+$. Using the Hopf algebra of posets, we give necessary conditions for two…

We construct non-power words which have small image in SL(2; 22n) for each n. In particular, the corresponding word maps are non-surjective. We also use this to construct word maps whose values are precisely the identity and a single…

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

Type checking algorithms and theorem provers rely on unification algorithms. In presence of type families or higher-order logic, higher-order (pre)unification (HOU) is required. Many HOU algorithms are expressed in terms of…

We establish a general bijective framework for encoding faces of some classical hyperplane arrangements. Precisely, we consider hyperplane arrangements in $\mathbb{R}^n$ whose hyperplanes are all of the form $\{x_i-x_j=s\}$ for some…

We clarify the relation between the `bosonisation' construction (due to the author) which can be used to turn a Hopf algebra $B$ in the category of $H$-modules or $H$-comodules into an equivalent ordinary Hopf algebra, and a version of…

We construct a natural bijection between the set of admissible pictures and the set of $U_q(gl(m,n))$-Littlewood-Richardson tableaux.

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…