Zobrazeno 1 - 10
of 2 658
pro vyhledávání: '"Fox, Nathan"'
Autor:
Fox, N. Bradley, Fox, Nathan H., Grundman, Helen G., Lynn, Rachel, Namoijam, Changningphaabi, Vanderschoot, Mary
For a base $b \geq 2$, the $b$-elated function, $E_{2,b}$, maps a positive integer written in base $b$ to the product of its leading digit and the sum of the squares of its digits. A $b$-elated number is a positive integer that maps to $1$ under iter
Externí odkaz:
http://arxiv.org/abs/2409.09863
Autor:
Fox, Nathan
In this paper, we study the three-term nested recurrence relation $B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3))$ subject to initial conditions where the first $N$ terms are the integers $1$ through $N$. This recurrence is the three-term analog of Hofstad
Externí odkaz:
http://arxiv.org/abs/2406.00904
Autor:
Maliniemi, Tuija, Tukiainen, Helena, Hjort, Jan, Toivanen, Maija, Vernham, Grant, Bailey, Joseph J., Baines, Oliver, Benniston, Lucy, Brilha, José, Field, Richard, Fox, Nathan, Gray, Murray, Grytnes, John-Arvid, Huusko, Karoliina, Kemppinen, Julia, Pereira, Paulo, Salminen, Henriikka, Schrodt, Franziska, Turner, Laura, Alahuhta, Janne
Publikováno v:
Diversity and Distributions, 2024 Jun 01. 30(6), 1-7.
Externí odkaz:
https://www.jstor.org/stable/48771601
Autor:
Bailey, Lora, Blake, Heather Smith, Cochran, Garner, Fox, Nathan, Levet, Michael, Mahmoud, Reem, Singgih, Inne, Stadnyk, Grace, Wiedemann, Alexander
Genome rearrangement is a common model for molecular evolution. In this paper, we consider the Pairwise Rearrangement problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming
Externí odkaz:
http://arxiv.org/abs/2402.01942
Autor:
Boyko, James, Cohen, Joseph, Fox, Nathan, Veiga, Maria Han, Li, Jennifer I-Hsiu, Liu, Jing, Modenesi, Bernardo, Rauch, Andreas H., Reid, Kenneth N., Tribedi, Soumi, Visheratina, Anastasia, Xie, Xin
In this paper, we describe the capabilities and constraints of Large Language Models (LLMs) within disparate academic disciplines, aiming to delineate their strengths and limitations with precision. We examine how LLMs augment scientific inquiry, off
Externí odkaz:
http://arxiv.org/abs/2311.04929
Autor:
Bailey, Lora, Blake, Heather Smith, Cochran, Garner, Fox, Nathan, Levet, Michael, Mahmoud, Reem, Matson, Elizabeth, Singgih, Inne, Stadnyk, Grace, Wang, Xinyi, Wiedemann, Alexander
Publikováno v:
Theoretical Computer Science (2024)
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010)
Externí odkaz:
http://arxiv.org/abs/2305.01851
Autor:
Fox, Nathan
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward descriptions in
Externí odkaz:
http://arxiv.org/abs/2203.09340
Autor:
Fox, Nathan A., Pérez-Edgar, Koraly, Morales, Santiago, Brito, Natalie H., Campbell, Alana M., Cavanagh, James F., Gabard-Durnam, Laurel Joy, Hudac, Caitlin M., Key, Alexandra P., Larson-Prior, Linda J., Pedapati, Ernest V., Norton, Elizabeth S., Reetzke, Rachel, Roberts, Timothy P., Rutter, Tara M., Scott, Lisa S., Shuffrey, Lauren C., Antúnez, Martín, Boylan, Maeve R., Garner, Bailey M., Learnard, Britley, McNair, Savannah, McSweeney, Marco, Castillo, Maria Isabella Natale, Norris, Jessica, Nyabingi, Olufemi Shakuur, Pini, Nicolò, Quinn, Alena, Stosur, Rachel, Tan, Enda, Troller-Renfree, Sonya V., Yoder, Lydia
Publikováno v:
In Developmental Cognitive Neuroscience October 2024 69
Autor:
Kanel, Dana, Fox, Nathan A., Pine, Daniel S., Zeanah, Charles H., Nelson, Charles A., McLaughlin, Katie A., Sheridan, Margaret A.
Publikováno v:
In Developmental Cognitive Neuroscience October 2024 69