◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Vincent Pilaud

5 papers hereh-index 28 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author2
  • last author2

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • math.CO5
same name
  • Vincent Pilaud — 3 papers, h 1
  • Vincent Pilaud — 3 papers, h 20
  • Vincent Pilaud — 2 papers, h 2
  • Vincent Pilaud — 1 paper, h 1
  • Vincent Pilaud — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators

5 papers

math.CO2026

Heaps of rhombic dodecahedra, catalan congruences on alternating sign matrices, and bases of the Temperley-Lieb algebra

Florent Hivert, Vincent Pilaud, Ludovic Schwob

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by…

math.CO2025

Plumbing bijections

Vincent Pilaud

The legendary Mario and Luigi show us that whether you slap in the crossings as early as a warp pipe can shoot you or as late as the very last bend, the water system in Yoshi Hill…

math.CO2025

Interval hypergraphic lattices

Nantel Bergeron, Vincent Pilaud

For a hypergraph H on [n], the hypergraphic poset PH​ is the transitive closure of the oriented skeleton of the hypergraphic polytope △H​…

math.CO2025

Ornamentation lattices and intreeval hypergraphic lattices

Antoine Abram, Jose Bastidas, Félix Gélinas +2

Given a directed graph D with transitive closure tc(D) and path hypergraph P(D), we study the connections between the (acyclic) reorientation poset of…

math.CO2025

Minimum maximal matchings in permutahedra

Sofia Brenner, Jiří Fink, Hung. P. Hoang +2

We prove that the minimal size M(I¨€n​) of a maximal matching in the permutahedron I¨€n​ is asymptotically n!/3. On the one hand, we obtain a lower bound $M(π_n) \ge n! (n-1)…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.