Výsledky vyhledávání - "Everett, Max"

Report

Chip-firing on the Platonic solids: a primer for studying graph gonality

Autor: Beougher, Marchelle, Ding, Kexin, Everett, Max, Huang, Robin, Lee, Chan, Morrison, Ralph, Weber, Ben

This paper provides a friendly introduction to chip-firing games and graph gonality. We use graphs coming from the five Platonic solids to illustrate different tools and techniques for studying these games, including independent sets, treewidth, scra

Externí odkaz: http://arxiv.org/abs/2407.05158

Zobrazit plný text záznamu

Report

Multiplicity-Free Gonality on Graphs

Autor: Dean, Frances, Everett, Max, Morrison, Ralph

The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most $1$ chip on each vertex. We

Externí odkaz: http://arxiv.org/abs/2107.12955

Zobrazit plný text záznamu

Report

On the scramble number of graphs

Autor: Echavarria, Marino, Everett, Max, Huang, Robin, Jacoby, Liza, Morrison, Ralph, Weber, Ben

The scramble number of a graph is an invariant recently developed to aid in the study of divisorial gonality. In this paper we prove that scramble number is NP-hard to compute, also providing a proof that computing gonality is NP-hard even for simple

Externí odkaz: http://arxiv.org/abs/2103.15253

Zobrazit plný text záznamu

Report

Moduli dimensions of lattice polygons

Autor: Echavarria, Marino, Everett, Max, Huang, Shinyu, Jacoby, Liza, Morrison, Ralph, Tewari, Ayush Kumar, Vlad, Raluca, Weber, Ben

Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For non-hyperellip

Externí odkaz: http://arxiv.org/abs/2010.13135

Zobrazit plný text záznamu