Zobrazeno 1 - 10
of 4 685
pro vyhledávání: '"MORRIS, ROBERT A."'
Autor:
Balister, Paul, Bollobás, Béla, Campos, Marcelo, Griffiths, Simon, Hurley, Eoin, Morris, Robert, Sahasrabudhe, Julian, Tiba, Marius
The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$, that $$R_
Externí odkaz:
http://arxiv.org/abs/2410.17197
Autor:
Ozerov, Anthony, Smith, Jeffrey C., Dotson, Jessie L., Longenbaugh, Randolph S., Morris, Robert L.
The large combined field of view of the Geostationary Lightning Mapper (GLM) instruments onboard the GOES weather satellites makes them useful for studying the population of other atmospheric phenomena, such as bolides. Being a lightning mapper, GLM
Externí odkaz:
http://arxiv.org/abs/2311.02776
The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 - \varepsilon)^k \] for
Externí odkaz:
http://arxiv.org/abs/2303.09521
Autor:
Cui, Hong, Xu, Dongfang, Chong, Steven S., Ramirez, Martin, Rodenhausen, Thomas, Macklin, James A., Ludäscher, Bertram, Morris, Robert A., Soto, Eduardo M., Koch, Nicolás Mongiardino
Background: Taxonomic descriptions are traditionally composed in natural language and published in a format that cannot be directly used by computers. The Exploring Taxon Concepts (ETC) project has been developing a set of web-based software tools th
Externí odkaz:
http://hdl.handle.net/10150/622823
http://arizona.openrepository.com/arizona/handle/10150/622823
http://arizona.openrepository.com/arizona/handle/10150/622823
The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$ colours from $\{1,\ldots,r\}$, then one of the colours contains a monochromatic clique of size $
Externí odkaz:
http://arxiv.org/abs/2212.06802
Publikováno v:
Acta Mathematica Hungarica, 161 (2020), 540-549
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most famously, h
Externí odkaz:
http://arxiv.org/abs/2211.01417
Autor:
Kaashoek, Nicolaas, Morris, Robert
CheckSync provides applications with high availability via runtime-integrated checkpointing. This allows CheckSync to take checkpoints of a process running in a memory-managed language (Go, for now), which can be resumed on another machine after a fa
Externí odkaz:
http://arxiv.org/abs/2208.02884
In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a factor of
Externí odkaz:
http://arxiv.org/abs/2206.11227
In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the critical length at which such droplets appear. In this paper we construc
Externí odkaz:
http://arxiv.org/abs/2203.13808
In this paper we study monotone cellular automata in $d$ dimensions. We develop a general method for bounding the growth of the infected set when the initial configuration is chosen randomly, and then use this method to prove a lower bound on the cri
Externí odkaz:
http://arxiv.org/abs/2203.13806