Zobrazeno 1 - 10
of 2 575
pro vyhledávání: '"Hancock Robert"'
Publikováno v:
EPJ Web of Conferences, Vol 295, p 01029 (2024)
The ATLAS experiment is expected to deliver an unprecedented amount of scientific data in the High Luminosity(HL-LHC) era. As the demand for disk storage capacity in ATLAS continues to rise steadily, the BNL Scientific Data and Computing Center (SDCC
Externí odkaz:
https://doaj.org/article/2b7d4073edab496cb082d3a05fea3b77
Given a matrix $A$ with integer entries, a subset $S$ of an abelian group and $r \in \mathbb N$, we say that $S$ is $(A,r)$-Rado if any $r$-colouring of $S$ yields a monochromatic solution to the system of equations $Ax=0$. A classical result of Rado
Externí odkaz:
http://arxiv.org/abs/2405.19113
Autor:
Rind Ofer, Ito Hironori, Che Guangwei, Chou Tim, Hancock Robert, Karasawa Mizuki, Liu Zhenping, Novakov Ognian, Rao Tejas, Wu Yingzi, Zaytsev Alexandr
Publikováno v:
EPJ Web of Conferences, Vol 245, p 04011 (2020)
Large scientific data centers have recently begun providing a number of different types of data storage in order to satisfy the various needs of their users. Users with interactive accounts, for example, might want a POSIX interface for easy access t
Externí odkaz:
https://doaj.org/article/ce3811a4f37949ba803360147338db22
For graphs $G, H_1,\dots,H_r$, write $G \to (H_1, \ldots, H_r)$ to denote the property that whenever we $r$-colour the edges of $G$, there is a monochromatic copy of $H_i$ in colour $i$ for some $i \in \{1,\dots,r\}$. Mousset, Nenadov and Samotij pro
Externí odkaz:
http://arxiv.org/abs/2307.16760
Autor:
Girão, António, Hancock, Robert
Recently, Dragani\'c, Munh\'a Correia, Sudakov and Yuster showed that every tournament on $(2+o(1))k^2$ vertices contains a $1$-subdivision of a transitive tournament on $k$ vertices, which is tight up to a constant factor. We prove a counterpart of
Externí odkaz:
http://arxiv.org/abs/2305.06204
Autor:
Girão, António, Hancock, Robert
Given graphs $G$ and $H$, we say $G \stackrel{r}{\to} H$ if every $r$-colouring of the edges of $G$ contains a monochromatic copy of $H$. Let $H[t]$ denote the $t$-blowup of $H$. The blowup Ramsey number $B(G \stackrel{r}{\to} H;t)$ is the minimum $n
Externí odkaz:
http://arxiv.org/abs/2205.12826
Autor:
Girão, António, Hancock, Robert
Publikováno v:
In European Journal of Combinatorics August 2024 120
We use the hypergraph container theory of Balogh--Morris--Samotij and Saxton--Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies closed under certain families of projections. We give a number of applica
Externí odkaz:
http://arxiv.org/abs/2107.00550
Autor:
Graff, Patrick, Woerz, Dana, Wilzopolski, Jenny, Voss, Anne, Sarrazin, Jana, Blimkie, Travis M., Weiner, January, Kershaw, Olivia, Panwar, Preety, Hackett, Tillie, Lau, Susanne, Brömme, Dieter, Beule, Dieter, Lee, Young-Ae, Hancock, Robert E.W., Gruber, Achim D., Bäumer, Wolfgang, Hedtrich, Sarah
Publikováno v:
In Journal of Investigative Dermatology May 2024 144(5):1010-1021
Autor:
Ho, Charlotte S, Wong, Carlos T H, Aung, Thet Tun, Lakshminarayanan, Rajamani, Mehta, Jodhbir S, Rauz, Saaeha, McNally, Alan, Kintses, Balint, Peacock, Sharon J, de la Fuente-Nunez, Cesar, Hancock, Robert E W, Ting, Darren S J
Publikováno v:
In The Lancet Microbe