6 citations · 17 across the 7 of their papers we have counts for
7 papers
Puzzles in -homology of Grassmannians
Pavlo Pylyavskyy, Jed Yang
Knutson, Tao, and Woodward formulated a Littlewood-Richardson rule for the cohomology ring of Grassmannians in terms of puzzles. Vakil and Wheeler-Zinn-Justin have found additional…
Geodesic trajectories on regular polyhedra
Diana Davis, Victor Dods, Cynthia Traub +1
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex.…
Antibiotics Time Machine is NP-hard
Ngoc Mai Tran, Jed Yang
The antibiotics time machine is an optimization question posed by Mira \latin{et al.} on the design of antibiotic treatment plans to minimize antibiotic resistance. The problem is…
Some NP-complete edge packing and partitioning problems in planar graphs
Jed Yang
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining wheth…
Tiling simply connected regions with rectangles
Igor Pak, Jed Yang
In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, Rémila showed that for…
The complexity of generalized domino tilings
Igor Pak, Jed Yang
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-compl…