Zobrazeno 1 - 10
of 22
pro vyhledávání: '"David Stoner"'
Publikováno v:
Remote Sensing, Vol 11, Iss 17, p 1980 (2019)
Migration is a valuable life history strategy for many species because it enables individuals to exploit spatially and temporally variable resources. Globally, the prevalence of species’ migratory behavior is decreasing as individuals forgo migrati
Externí odkaz:
https://doaj.org/article/c5c0e6f7bcb2432fa6a9ea426d2a2f35
Publikováno v:
arXiv
May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ4–o(1) but not O(δ4).Let M(δ) be the maximum number such
Publikováno v:
arXiv
We prove that for all fixed p > 2 , the translative packing density of unit l p -balls in R n is at most 2 ( γ p + o ( 1 ) ) n with γ p − 1 / p . This is the first exponential improvement in high dimensions since van der Corput and Schaake (1936)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99f83ec9576e5a3faae37c8bf75b8d8d
https://hdl.handle.net/1721.1/136231
https://hdl.handle.net/1721.1/136231
Publikováno v:
European Journal of Combinatorics. 70:354-363
Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithmetic progressions. The sequences constructed from this procedure are kn
Publikováno v:
Springer Berlin Heidelberg
Let $H$ be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph $G$ without isolated vertices, the weighted number of graph homomorphisms $\hom(G, H)$ satisfies the inequality \[ \hom(G, H ) \le \pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::441ad958317476fe91fbcd007eaea786
http://arxiv.org/abs/1809.09462
http://arxiv.org/abs/1809.09462
Publikováno v:
arXiv
Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the degree of ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5efec2ab8c5330bfacc5b3f438d93e3
http://arxiv.org/abs/1805.04021
http://arxiv.org/abs/1805.04021
Autor:
Mehtaab Sawhney, David Stoner
Publikováno v:
The Electronic Journal of Combinatorics. 25
Hegarty conjectured for $n\neq 2, 3, 5, 7$ that $\mathbb{Z}/n\mathbb{Z}$ has a permutation which destroys all arithmetic progressions mod $n$. For $n\ge n_0$, Hegarty and Martinsson demonstrated that $\mathbb{Z}/n\mathbb{Z}$ has an arithmetic-progres
Autor:
Ling Hei Tsang, Florian Frick, Zoe Wellner, Megumi Asada, Maxwell Polevy, David Stoner, Vivek Pisharody
We treat problems of fair division, their various interconnections, and their relations to Sperner's lemma and the KKM theorem as well as their variants. We prove extensions of Alon's necklace splitting result in certain regimes and relate it to hype
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd469f37f0bf5a93c52ade7841ec49b9
Autor:
Ling Hei Tsang, David Stoner, Ryan Chen, Megumi Asada, Frederick Huang, Maxwell Polevy, Zoe Wellner, Florian Frick
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a partition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b37bd99282535561c212d88b891e3776
http://arxiv.org/abs/1608.04279
http://arxiv.org/abs/1608.04279
Autor:
Stan E Jones, Jason Wadley, David Stoner, James Bier, Edward M Griffin, Donald E. Swihart, Amy Burns, Kerianne Hobbs
Publikováno v:
AIAA Infotech@Aerospace (I@A) Conference.
The U.S. Department of Defense has identified midair mishaps as a leading cause of loss of life, lost combat capability, and financial cost in fighter/attack aircraft operations. In the past, losses from midair mishaps were mitigated through training