823 citations
- Centre National de la Recherche ScientifiqueFR44 papers
- Center for Astrophysics Harvard & SmithsonianUS42 papers
- Max Planck Institute for Extraterrestrial PhysicsDE38 papers
- University of Maryland, College ParkUS38 papers
- Goddard Space Flight CenterUS36 papers
- National Institute for AstrophysicsIT35 papers
- Osservatorio di Astrofisica e Scienza dello Spazio33 papers
- University of California, BerkeleyUS30 papers
- Agenzia Spaziale ItalianaIT29 papers
- California Institute of TechnologyUS28 papers
- Astronomical Observatory of RomeIT27 papers
- Pennsylvania State UniversityUS26 papers
7 papers · 1 filter
Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
Ting Guo, Svetlana Poznanović
We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do n…
Counting locally flat-foldable origami configurations via 3-coloring graphs
Alvin Chiu, William Hoganson, Thomas C. Hull +1
Origami, where two-dimensional sheets are folded into complex structures, is proving to be rich with combinatorial and geometric structure, most of which remains to be fully unders…
Morphisms and order ideals of toric posets
Matthew Macauley
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or…
Toric partial orders
Mike Develin, Matthew Macauley, Victor Reiner
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arran…
Identifying codes of the direct product of two cliques
Douglas F. Rall, Kirsti Wash
An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. It…
Commutation classes of double wiring diagrams
Patrick Dukes, Joe Rusinko
We describe a new method for computing the graph of commutation classes of double wiring diagrams. Using these methods we compute the graph for five strings or less which allows us…