Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Milgrim, Wyatt"'
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
The Turaev surface of a link diagram $D$ is a closed, oriented surface constructed from a cobordism between the all-$A$ and all-$B$ Kauffman states of $D$. The Turaev genus of a link $L$ is the minimum genus of the Turaev surface of any diagram $D$ o
Externí odkaz:
http://arxiv.org/abs/2211.10009
Autor:
Cheigh, Justin, Moura, Guilherme Zeus Dantas e, Jeong, Ryan, Duke, Jacob Lehmann, Milgrim, Wyatt, Miller, Steven J., Ngamlamai, Prakod
Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by $F_1 = 1, F_2 = 2, F_{n+1} = F_n + F_{n-1}$. Motivated by this result, Baird, Epstein, Flint, and Miller defined the two-
Externí odkaz:
http://arxiv.org/abs/2210.11038
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
Publikováno v:
In Topology and its Applications 1 April 2024 346
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.