Zobrazeno 1 - 10
of 67 006
pro vyhledávání: '"A. A. Seymour"'
The broad-band radio spectral energy distribution (SED) of star-forming galaxies (SFGs) contains a wealth of complex physics. We aim to determine the physical emission and loss processes causing radio SED curvature and steepening to see which observe
Externí odkaz:
http://arxiv.org/abs/2412.03143
Autor:
Pérez-Martínez, J. M., Dannerbauer, H., Emonts, B. H. C., Allison, J. R., Champagne, J. B., Indermuehle, B., Norris, R. P., Serra, P., Seymour, N., Thomson, A. P., Casey, C. M., Chen, Z., Daikuhara, K., De Breuck, C., D'Eugenio, C., Drouart, G., Hatch, N., Jin, S., Kodama, T., Koyama, Y., Lehnert, M. D., Macgregor, P., Miley, G., Naufal, A., Röttgering, H., Sánchez-Portal, M., Shimakawa, R., Zhang, Y., Ziegler, B.
We obtain CO(1-0) molecular gas measurements with ATCA on a sample of 43 spectroscopically confirmed H$\alpha$ emitters in the Spiderweb protocluster at $z=2.16$ and investigate the relation between their star formation and cold gas reservoirs as a f
Externí odkaz:
http://arxiv.org/abs/2411.12138
The analysis of neural power spectra plays a crucial role in understanding brain function and dysfunction. While recent efforts have led to the development of methods for decomposing spectral data, challenges remain in performing statistical analysis
Externí odkaz:
http://arxiv.org/abs/2410.20896
We prove that for every complete graph $K_t$, all graphs $G$ with no induced subgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at least $|G|/{\rm polylog}|G|$. This is close to best possible, because for $t\ge 6$, not all suc
Externí odkaz:
http://arxiv.org/abs/2409.09400
When $H$ is a forest, the Gy\'arf\'as-Sumner conjecture implies that every graph $G$ with no induced subgraph isomorphic to $H$ and with bounded clique number has a stable set of linear size. We cannot prove that, but we prove that every such graph $
Externí odkaz:
http://arxiv.org/abs/2409.09397
A {\em $k$-kernel} in a digraph $G$ is a stable set $X$ of vertices such that every vertex of $G$ can be joined from $X$ by a directed path of length at most $k$. We prove three results about $k$-kernels. First, it was conjectured by Erd\H{o}s and Sz
Externí odkaz:
http://arxiv.org/abs/2409.05039
We prove the existence of murmurations in the family of Maass forms of weight 0 and level 1 with their Laplace eigenvalue parameter going to infinity (i.e., correlations between the parity and Hecke eigenvalues at primes growing in proportion to the
Externí odkaz:
http://arxiv.org/abs/2409.00765
Publikováno v:
Discrete Mathematics, Volume 343, Issue 5, 2020
The fork is the tree obtained from the claw $K_{1,3}$ by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs that do not contain the fork or antifork as induced subgraphs.
Com
Com
Externí odkaz:
http://arxiv.org/abs/2408.15005
Autor:
Broderick, J. W., Seymour, N., Drouart, G., Knight, D., Afonso, J. M., De Breuck, C., Galvin, T. J., Hedge, A. J., Lehnert, M. D., Noirot, G., Shabala, S. S., Turner, R. J., Vernet, J.
We present deep near-infrared $K_{\rm s}$-band imaging for 35 of the 53 sources from the high-redshift ($z > 2$) radio galaxy candidate sample defined in Broderick et al. (2022). These images were obtained using the High-Acuity Widefield $K$-band Ima
Externí odkaz:
http://arxiv.org/abs/2407.19145
Autor:
Nyarko-Agyei, Albert, Moser, Scott, Seymour, Rowland G, Brewster, Ben, Li, Sabrina, Weir, Esther, Landman, Todd, Wyman, Emily, Torres, Christine Belle, Fell, Imogen, Boyd, Doreen
Effective policy and intervention strategies to combat human trafficking for child sexual exploitation material (CSEM) production require accurate prevalence estimates. Traditional Network Scale Up Method (NSUM) models often necessitate standalone su
Externí odkaz:
http://arxiv.org/abs/2407.13267