Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Pesikoff, Ethan"'
We exactly determine the maximum possible hook length of $(s,t)$-core partitions with $d$-distinct parts when there are finitely many such partitions. Moreover, we provide an algorithm to construct a $d$-distinct $(s,t)$-core partition with this maxi
Externí odkaz:
http://arxiv.org/abs/2209.09973
Autor:
Fleischmann, Henry L., Konyagin, Sergei V., Miller, Steven J., Palsson, Eyvindur A., Pesikoff, Ethan, Wolf, Charles
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the
Externí odkaz:
http://arxiv.org/abs/2206.04367
Autor:
Baily, Benjamin, Dell, Justine, Fleischmann, Henry L., Jackson, Faye, Miller, Steven J., Pesikoff, Ethan, Reifenberg, Luke
For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$ is irreduci
Externí odkaz:
http://arxiv.org/abs/2111.09786
Autor:
Baily, Benjamin, Dell, Justine, Durmić, Irfan, Fleischmann, Henry, Jackson, Faye, Mijares, Isaac, Miller, Steven J., Pesikoff, Ethan, Reifenberg, Luke, Reina, Alicia Smith, Yang, Yingzi
Every positive integer may be written uniquely as a base-$\beta$ decomposition--that is a legal sum of powers of $\beta$--where $\beta$ is the dominating root of a non-increasing positive linear recurrence sequence. Guided by earlier work on a two-pl
Externí odkaz:
http://arxiv.org/abs/2109.00117
Autor:
Fleischmann, Henry L., Miller, Steven J., Palsson, Eyvindur A., Pesikoff, Ethan, Wolf, Charles
We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2 \leq P(k)
Externí odkaz:
http://arxiv.org/abs/2108.12034
Autor:
Fleischmann, Henry L., Hu, Hongyi B., Jackson, Faye, Miller, Steven J., Palsson, Eyvindur A., Pesikoff, Ethan, Wolf, Charles
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the plane. Th
Externí odkaz:
http://arxiv.org/abs/2108.12015
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:
Fleischmann, Henry L., Hu, Hongyi B., Jackson, Faye, Miller, Steven J., Palsson, Eyvindur A., Pesikoff, Ethan, Wolf, Charles
Publikováno v:
Discrete & Computational Geometry; Dec2023, Vol. 70 Issue 4, p1715-1740, 26p
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.