Zobrazeno 1 - 10
of 12 657
pro vyhledávání: '"Leader, A."'
How small can a set of vertices in the $n$-dimensional hypercube $Q_n$ be if it meets every copy of $Q_d$? The asymptotic density of such a set (for $d$ fixed and $n$ large) is denoted by $\gamma_d$. It is easy to see that $\gamma_d \leq 1/(d+1)$, an
Externí odkaz:
http://arxiv.org/abs/2411.09445
Abstract Background: Pulmonary function tests (PFTs) and computed tomography (CT) imaging are vital in diagnosing, managing, and monitoring lung diseases. A common issue in practice is the lack of access to recorded pulmonary functions despite availa
Externí odkaz:
http://arxiv.org/abs/2408.05645
Autor:
Leader, Imre, Tan, Ta Sheng
The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For $n$ odd, Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin showed that the odd cover num
Externí odkaz:
http://arxiv.org/abs/2408.05053
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
A set $X$ is called Euclidean Ramsey if, for any $k$ and sufficiently large $n$, every $k$-colouring of $\mathbb{R}^n$ contains a monochromatic congruent copy of $X$. This notion was introduced by Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer an
Externí odkaz:
http://arxiv.org/abs/2406.01459
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
An $r$-daisy is an $r$-uniform hypergraph consisting of the six $r$-sets formed by taking the union of an $(r-2)$-set with each of the 2-sets of a disjoint 4-set. Bollob\'as, Leader and Malvenuto, and also Bukh, conjectured that the Tur\'an density o
Externí odkaz:
http://arxiv.org/abs/2401.16289
How many graphs on an $n$-point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum is exactly $1/2^{n-1}$ of all graphs. Our aim in this short note is t
Externí odkaz:
http://arxiv.org/abs/2309.00757
Autor:
Rebecca J Melillo, Christiane El Khoury, Amy L Shaver, Moriah Cunningham, Nathalia Benavides, Quezia Lacerda, Felix J Kim, Amy E Leader
Publikováno v:
BMC Medical Education, Vol 24, Iss 1, Pp 1-8 (2024)
Abstract Background Despite the importance of community involvement in research, little formal training in community outreach and engagement (COE) is offered to cancer research trainees. A collaboration between the Office of COE and the Office of Can
Externí odkaz:
https://doaj.org/article/eb06bea0f0cb4012b31ee2bfd0b9693e
Autor:
Amy E. Leader, Timothy R. Rebbeck, William K. Oh, Alpa V. Patel, Eric P. Winer, LeeAnn O. Bailey, Leonard G. Gomella, Crystal Y. Lumpkins, Isla P. Garraway, Lisa B. Aiello, Monica L. Baskin, Heather H. Cheng, Kathleen A. Cooney, Amanda Ganzak, Daniel J. George, Susan Halabi, Feighanne Hathaway, Claire Healy, Joseph W. Kim, Michael S. Leapman, Stacy Loeb, Kara N. Maxwell, Christopher McNair, Todd M. Morgan, Breanne Prindeville, Howard R. Soule, Whitney L. Steward, Sakinah C. Suttiratana, Mary-Ellen Taplin, Kosj Yamoah, Thierry Fortune, Kris Bennett, Joshua Blanding-Godbolt, Laura Gross, Veda N. Giri
Publikováno v:
BMC Public Health, Vol 24, Iss 1, Pp 1-13 (2024)
Abstract Background Black men consistently have higher rates of prostate cancer (PCA)- related mortality. Advances in PCA treatment, screening, and hereditary cancer assessment center around germline testing (GT). Of concern is the significant under-
Externí odkaz:
https://doaj.org/article/7a481f2b8f7f4858987d88a4639dee1d