activity
20162024
most citedThe categorical graph minor theorem

5 citations · 9 across the 7 of their papers we have counts for

collaborators

9 papers

math.CO2024★ 2 cited

Categorical valuative invariants of polyhedra and matroids

Ben Elias, Dane Miyata, Nicholas Proudfoot +1

We introduce the notion of a categorical valuative invariant of polyhedra or matroids, in which alternating sums of numerical invariants are replaced by split exact sequences in an…

math.CO2022

Ehrhart Theory of Paving and Panhandle Matroids

Derek Hanely, Jeremy L. Martin, Daniel McGinnis +4

We show that the base polytope of any paving matroid can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of latt…

math.CO2021

Equivariant log concavity and representation stability

Jacob P. Matherne, Dane Miyata, Nicholas Proudfoot +1

We expand upon the notion of equivariant log concavity, and make equivariant log concavity conjectures for Orlik--Solomon algebras of matroids, Cordovil algebras of oriented matroi…

math.CO2020

The graph minor theorem in topological combinatorics

Dane Miyata, Eric Ramos

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor c…

math.AT2020★ 1 cited

Deletion and contraction in configuration spaces of graphs

Sanjana Agarwal, Maya Banks, Nir Gadish +1

The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we…

math.CO2020★ 5 cited

The categorical graph minor theorem

Dane Miyata, Nicholas Proudfoot, Eric Ramos

We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can b…

math.CO2018

Approval Gap of Weighted k-Majority Tournaments

Jeremy Coste, Breenn Flesch, Joshua D. Laison +2

A -majority tournament on a finite set of vertices is defined by a set of linear orders on , with an edge in if in a majority of the linear…

q-bio.NC2016

Gröbner Bases of Neural Ideals

Rebecca Garcia, Luis David García Puente, Ryan Kruse +5

The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the co…

q-bio.NC2016★ 1 cited

Neural Ideals in SageMath

Ethan Petersen, Nora Youngs, Ryan Kruse +3

A major area in neuroscience research is the study of how the brain processes spatial information. Neurons in the brain represent external stimuli via neural codes. These codes oft…