100 citations · 215 across the 10 of their papers we have counts for
10 papers
Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions
Pau Vives, Anna de Mier, Gabriel Cardona +1
We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We pr…
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem
José Aliste-Prieto, Anna de Mier, José Zamora
This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same -polynomial (or, equivalently, the same chromatic symmetric fun…
Lower bounds on the maximum number of non-crossing acyclic graphs
Clemens Huemer, Anna de Mier
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests.…
An involution on bicubic maps and β(0,1)-trees
Anders Claesson, Sergey Kitaev, Anna de Mier
Bicubic maps are in bijection with β(0,1)-trees. We introduce two new ways of decomposing β(0,1)-trees. Using this we define an endofunction on β(0,1)-trees, and thus also on bicub…
Rook and queen paths with boundaries
Joseph P. S. Kung, Anna de Mier
A rook path is a path on lattice points in the plane in which any proper horizontal step to the right or vertical step north is allowed. If, in addition, one allow bishop steps, th…
Characterizations of transversal and fundamental transversal matroids
Joseph E. Bonin, Joseph P. S. Kung, Anna de Mier
A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions o…
Spanning trees of 3-uniform hypergraphs
Andrew Goodall, Anna de Mier
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a c…
The Lattice of Cyclic Flats of a Matroid
Joseph E. Bonin, Anna de Mier
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the pers…
Lattice Path Matroids: Structural Properties
Joseph E. Bonin, Anna de Mier
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are dir…
Lattice path matroids: enumerative aspects and Tutte polynomials
Joseph E. Bonin, Anna de Mier, Marc Noy
Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that rema…