2 citations · 4 across the 17 of their papers we have counts for
15 papers · 1 filter
Fibonacci Polyominoes: Refined Enumeration and Dyck-Path Bijections
Jean-Luc Baril, José L. Ramírez, Samuel Ramírez
We study Fibonacci polyominoes, a class of column-convex polyominoes whose lower boundary is a staircase path made of unit horizontal and vertical steps. We derive generating funct…
Enumeration of paths in a hexagonal circle packing
Jean-Luc Baril, José Luis Ramí rez
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kerne…
Inversions in Colored Permutations, Derangements, and Involutions
Moussa Ahmia, José L. Ramírez, Diego Villamizar
Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations,…
Enumeration of Colored Tilings on Graphs via Generating Functions
José L. Ramírez, Diego Villamizar
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques,…
Generating Trees and Fibonacci Polyominoes
Juan F. Pulido, José L. Ramírez, Andrés R. Vindas-Meléndez
We study a new class of polyominoes, called -Fibonacci polyominoes, defined using -Fibonacci words. We enumerate these polyominoes by applying generating functions to capture…
Some distributions in increasing and flattened permutations
Jean-Luc Baril, José L. Ramírez
We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing…