Benjamin Pagano

Benjamin Pagano

Auto-generated profile, based on publicly available information

Benjamin Pagano

Department of Mathematics, Occidental College, Los Angeles, CA, United States

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2021 in Bulletin of the Polish Academy of Sciences. Mathematics
Verified
Journal Article
Closed access
PDF file
TMThomas W. Mattman
Thomas W. Mattman
RNRamin Naimi
Ramin Naimi
BPBenjamin Pagano
Benjamin Pagano

4 January 2019 in arXiv
Verified
Preprint
Open access
PDF file
TMThomas W. Mattman
Thomas W. Mattman
RNRamin Naimi
Ramin Naimi
BPBenjamin Pagano
Benjamin Pagano
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed, this is the case. In fact, much as Flapan, Mellor, and Naimi show for graphs, knotting and linking are arbitrarily complex in directed graphs. Specifically, we prove the analog for digraphs of the main theorem of their paper: for any $n$ and $\alpha$, every embedding of a sufficiently large complete digraph in $\mathbb{R}^3$ contains an oriented link with components $Q_1, \ldots, Q_n$ such that, for every $i \neq j$, $|\mathrm{lk}(Q_i,Q_j)| \geq \alpha$ and $|a_2(Q_i)| \geq \alpha$, where $a_2(Q_i)$ denotes the second coefficient of the Conway polynomial of $Q_i$.

21 November 2024 in Involve, a Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
KGKathryn Grossmann
Kathryn Grossmann
DHDongming (Merrick) Hua
Dongming (Merrick) Hua
BPBenjamin Pagano
Benjamin Pagano
HSHannah Sheats
Hannah Sheats
ESEric Sundberg
Eric Sundberg
SVSireesh Vinnakota
Sireesh Vinnakota