A5047860690- Advanced Graph Theory Research
- Algebraic Geometry and Number Theory
- Commutative Algebra and Its Applications
- Graph Labeling and Dimension Problems
- Homotopy and Cohomology in Algebraic Topology
- Global Cancer Incidence and Screening
- Rings, Modules, and Algebras
- Advanced Combinatorial Mathematics
- Head and Neck Cancer Studies
- Graph theory and applications
- Algebraic structures and combinatorial models
- Palliative Care and End-of-Life Issues
- Obesity, Physical Activity, Diet
- Polynomial and algebraic computation
- Mining Techniques and Economics
- Religion, Spirituality, and Psychology
- Climate Change and Health Impacts
- Education and Islamic Studies
- Neonatal and fetal brain pathology
- Finite Group Theory Research
- Liver Disease Diagnosis and Treatment
- Glioma Diagnosis and Treatment
- Acute Lymphoblastic Leukemia research
- Mine drainage and remediation techniques
- Geometric and Algebraic Topology
Institute for Health Metrics and Evaluation
2018-2025
University of Washington
2018-2025
University of California, San Francisco
2025
University of California, Berkeley
2023-2025
University of California, Davis
2021
Oberlin College
2020
Williams College
2020
University of Minnesota
2020
University of Plymouth
2019
In estimating the global burden of cancer, adolescents and young adults with cancer are often overlooked, despite being a distinct subgroup unique epidemiology, clinical care needs, societal impact. Comprehensive estimates in (aged 15-39 years) lacking. To address this gap, we analysed results from Global Burden Diseases, Injuries, Risk Factors Study (GBD) 2019, focus on outcome disability-adjusted life-years (DALYs), to inform control measures adults.
Abstract Background Non-malignant tumors of the CNS contribute substantially to morbidity and mortality from tumors. It is critical understand epidemiology non-malignant separately malignancies inform resource allocation policy since treatment prognosis can differ. High quality international data on tumor burden are needed accomplish this goal. Methods We assessed cancer registry vital registration available Global Burden Disease study by its inclusion tumors, reporting availability over...
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 3 March 2020Accepted: 11 February 2021Published online: 19 April 2021Keywordsgraph, gonality sequence, chip-firing, Dhar's burning algorithmAMS Subject Headings14T05, 05C57, 05C85Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric are equivalent in the case. We show such a classification extends to combinatorial graphs of three, under certain edge- vertex-connectivity assumptions. also give construction for provide conditions determining when graph is not three.
10573 Background: Liver cancer is a leading cause of global health burden, and was the seventh death in 2021. The most common type liver adults hepatocellular carcinoma, which can be due to alcohol, hepatitis B, C, non-alcoholic steatohepatitis (NASH), or other causes. In children hepatoblastoma. Comprehensive comparative estimation burden inform policy decisions public interventions reduce incidence, morbidity, mortality. This study provides updated estimates from 1990 2021, for first time...
The divisorial gonality of a graph is the minimum degree positive rank divisor on that graph. We introduce multiplicity-free graph, which restricts our consideration to divisors place at most 1 chip each vertex. give sufficient condition in terms vertex-connectivity for these two versions be equal; and we show no function can bound gonality, even simple graphs. also prove NP-hard compute, while still determining it families currently unknown. present new gonalities, such as wheel
We compute the treewidth of a family graphs we refer to as glued grids, consisting stacked prism and toroidal grids. Our main technique is constructing strict brambles large orders. discuss connections divisorial graph theory coming from tropical geometry, use our results gonality these graphs.
In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric are equivalent in the case. We show such a classification extends to combinatorial graphs of three, under certain edge- vertex-connectivity assumptions. also give construction for provide conditions determining when graph is not three.
I have spent a lot of time thinking this past year and half about the relationship between asceticism success. As mathematics student collegiate athlete, far too often gotten caught up in pursuit objective standards. This chase has left me burnt out broken. Existential philosophy been my greatest asset discerning true purpose asceticism. reflect on journey nature assessment short reflection.
To any graph we associate a sequence of integers called the gonality graph, consisting minimum degrees divisors increasing rank on graph. This is tropical analogue an algebraic curve. We study sequences for graphs low genus, proving that genus up to $5$, determined by and first gonality. then prove reasonable pair two gonalities achieved some also develop modified version Dhar's burning algorithm more suited studying higher gonalities.
The divisorial gonality of a graph is the minimum degree positive rank divisor on that graph. We introduce multiplicity-free graph, which restricts our consideration to divisors place at most \(1\) chip each vertex. give sufficient condition in terms vertex-connectivity for these two versions be equal; and we show no function can bound gonality, even simple graphs. also prove NP-hard compute, while still determining it families currently unknown. present new gonalities, such as wheel