Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Williams, Kada"'
Autor:
Leader, Imre, Williams, Kada
Fern\'andez-Bret\'on, Sarmiento and Vera showed that whenever a direct sum of sufficiently many copies of ${\mathbb Z}_4$, the cyclic group of order 4, is countably coloured there are arbitrarily large finite sets $X$ whose sumsets $X+X$ are monochro
Externí odkaz:
http://arxiv.org/abs/2407.03938
Autor:
Williams, Kada
Define a queen on $\mathbb{Z}_n^d$ with admissible moves parallel to $\mathbf{x}\in\{-1,0,1\}^d$ at arbitrary length. How many queens can be placed on $\mathbb{Z}_n^d$ without any two in conflict? In two dimensions, this problem was initiated by P\'{
Externí odkaz:
http://arxiv.org/abs/2404.18237
A subgraph of the $n$-dimensional hypercube is called 'layered' if it is a subgraph of a layer of some hypercube. In this paper we show that there exist subgraphs of the cube of arbitrarily large girth that are not layered. This answers a question of
Externí odkaz:
http://arxiv.org/abs/2404.18014
Autor:
Williams, Kada
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of elements from a g
Externí odkaz:
http://arxiv.org/abs/2403.09943
Autor:
Williams, Kada
Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the bounds $$\le
Externí odkaz:
http://arxiv.org/abs/2303.11208
Autor:
Craig, Daniel J., Bailey, Morgan M., Noe, Olivia B., Williams, Kada K., Stanbery, Laura, Hamouda, Danae M., Nemunaitis, John J.
Publikováno v:
In Cancer Treatment and Research Communications 2022 30
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.