2 citations · 5 across the 20 of their papers we have counts for
6 papers · 2 filters
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…
Generalized snake posets, order polytopes, and lattice-point enumeration
Eon Lee, Andrés R. Vindas-Meléndez, Zhi Wang
Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake p…
Polyhedral geometry of refined -Catalan numbers
Matthias Beck, Mitsuki Hanada, Max Hlavacek +3
We study a refinement of the -Catalan numbers introduced by Xin and Zhang (2022, 2023) using tools from polyhedral geometry. These refined -Catalan numbers depend on a ve…
Matching polytopes, Gorensteinness, and the integer decomposition property
Benjamin Eisley, Koji Matsushita, Andrés R. Vindas-Meléndez
The matching polytope of a graph is the convex hull of the indicator vectors of the matchings on . We characterize the graphs whose associated matching polytopes are Gorenst…
Combinatorics of generalized parking-function polytopes
Margaret M. Bayer, Steffen Borgwardt, Teressa Chambers +8
For , a -parking function is defined to be a sequence of positive integers whose nondecreasing rearra…
-Chromatic polynomials
Esme Bajo, Matthias Beck, Andrés R. Vindas-Meléndez
We study a -version of the chromatic polynomial of a given graph , namely, \[ χ_G^λ(q,n) \ := \sum_{\substack{\text{proper colorings}\\ c\,:\,V\to[n]}} q^{ \sum_{ v \in…