Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Iannuzzelli, Santiago Velazquez"'
Autor:
Cheigh, Justin, Moura, Guilherme Zeus Dantas e, Duke, Jacob Lehmann, Mauro, Annika, McDonald, Zoe, Mello, Anna, Miller, Kayla, Miller, Steven J., Iannuzzelli, Santiago Velazquez
The purpose of this short note is to show the interplay between math outreach and conducting original research, in particular how each can build off the other.
Comment: 9 pages, 5 figures
Comment: 9 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/2412.09750
Autor:
Ascoli, Ruben, Betti, Livia, Cheigh, Justin, Iosevich, Alex, Jeong, Ryan, Liu, Xuyan, McDonald, Brian, Milgrim, Wyatt, Miller, Steven J., Acosta, Francisco Romero, Iannuzzelli, Santiago Velazquez
Let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field with $q$ elements. For a subset $E\subseteq \mathbb{F}_q^d$ and a fixed nonzero $t\in \mathbb{F}_q$, let $\mathcal{H}_t(E)=\{h_y: y\in E\}$, where $h_y$ is the indicator f
Externí odkaz:
http://arxiv.org/abs/2307.10425
Autor:
Moura, Guilherme Zeus Dantas e, Keisling, Andrew, Lilly, Astrid, Mauro, Annika, Miller, Steven J., Phang, Matthew, Iannuzzelli, Santiago Velazquez
Publikováno v:
Fibonacci Quarterly 61.3 (2023)
Zeckendorf's Theorem implies that the Fibonacci number $F_n$ is the smallest positive integer that cannot be written as a sum of non-consecutive previous Fibonacci numbers. Catral et al. studied a variation of the Fibonacci sequence, the Fibonacci Qu
Externí odkaz:
http://arxiv.org/abs/2210.10577
Autor:
Ascoli, Ruben, Betti, Livia, Cheigh, Justin, Iosevich, Alex, Jeong, Ryan, Liu, Xuyan, McDonald, Brian, Milgrim, Wyatt, Miller, Steven J., Acosta, Francisco Romero, Iannuzzelli, Santiago Velazquez
Given a domain $X$ and a collection $\mathcal{H}$ of functions $h:X\to \{0,1\}$, the Vapnik-Chervonenkis (VC) dimension of $\mathcal{H}$ measures its complexity in an appropriate sense. In particular, the fundamental theorem of statistical learning s
Externí odkaz:
http://arxiv.org/abs/2210.03058
Autor:
Ascoli, Ruben, Betti, Livia, Duke, Jacob Lehmann, Liu, Xuyan, Milgrim, Wyatt, Miller, Steven J., Palsson, Eyvindur A., Acosta, Francisco Romero, Iannuzzelli, Santiago Velazquez
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:1, Combinatorics (February 27, 2023) dmtcs:10037
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored along with ma
Externí odkaz:
http://arxiv.org/abs/2208.13284
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dantas E Moura, Guilherme Zeus, Keisling, Andrew, Lilly, Astrid, Mauro, Annika, Miller, Steven J., Phang, Matthew, Iannuzzelli, Santiago Velazquez
Publikováno v:
The Fibonacci Quarterly; August 2023, Vol. 61 Issue: 3 p257-274, 18p
