Andrés R. Vindas-Meléndez

activity

20182026

most citedGeneralized parking function polytopes

2 citations · 5 across the 20 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

3 papers · 2 filters

math.CO2022★ 2 cited

A combinatorial proof of a symmetry for a refinement of the Narayana numbers

Miklós Bóna, Stoyan Dimitrov, Gilbert Labelle +4

We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n, k, m}$ is t…

math.CO2022★ 2 cited

Generalized parking function polytopes

Mitsuki Hanada, John Lentfer, Andrés R. Vindas-Meléndez

A classical parking function of length $n$ is a list of positive integers $(a_{1}, a_{2}, \dots, a_{n})$ whose nondecreasing rearrangement $b_{1} \leq b_{2} \leq \dots \leq b_{n}$ satisfies…

math.CO2022

On the critical group of hinge graphs

Aren Martinian, Andrés R. Vindas-Meléndez

Let $G$ be a finite, connected, simple graph. The critical group $K (G)$ , also known as the sandpile group, is the torsion subgroup of the cokernel of the graph Laplacian $\operator…