Zobrazeno 1 - 10
of 46 752
pro vyhledávání: '"Ryan, R"'
Autor:
Baker, Dustin, Gomez-Leos, Enrique, Halfpap, Anastasia, Heath, Emily, Martin, Ryan R., Miller, Joe, Parker, Alex, Pungello, Hope, Schwieder, Coy, Veldt, Nick
Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow saturation
Externí odkaz:
http://arxiv.org/abs/2409.15258
Autor:
Martin, Ryan R., Patkós, Balázs
A classical result of Kleitman determines the maximum number $f(n,s)$ of subsets in a family $\mathcal{F}\subseteq 2^{[n]}$ of sets that do not contain distinct sets $F_1,F_2,\dots,F_s$ that are pairwise disjoint in the case $n\equiv 0,-1$ (mod $s$).
Externí odkaz:
http://arxiv.org/abs/2409.08694
Autor:
Martin, Ryan R, Veldt, Nick
Given a set $X$, the power set $\mathbb{P}(X)$, and a finite poset $P$, a family $F\subset \mathbb{P}(X)$ is said to be induced-$P$-free if there is no injection $\phi: P\rightarrow \mathbb{P}(X)$ such that $\phi(p)\subseteq\phi(q)$ if and only if $p
Externí odkaz:
http://arxiv.org/abs/2408.14648
A coloring of the edges of a graph $G$ in which every $K_{1,2}$ is totally multicolored is known as a proper coloring and a coloring of the edges of $G$ in which every $K_{1,2}$ and every $K_{2,2}$ is totally multicolored is called a B-coloring. In t
Externí odkaz:
http://arxiv.org/abs/2408.09081
We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_B(G)$ denote the smallest number of colors needed for a B-coloring of $G$. Motivated by earlier papers on B-colorings, he
Externí odkaz:
http://arxiv.org/abs/2408.09059
Autor:
Ryan, R. A., Tsai, P. E., Johansen, A. R., Youmans, A., Higginson, D. P., Mitrani, J. M., Adams, C. S., Sutherland, D. A., Levitt, B., Shumlak, U.
Previous measurements of neutron energy using fast plastic scintillators while operating the Fusion Z Pinch Experiment (FuZE) constrained the energy of any yield-producing deuteron beams to less than $4.65 keV$. FuZE has since been operated at increa
Externí odkaz:
http://arxiv.org/abs/2408.05171
As the size of datasets used in statistical learning continues to grow, distributed training of models has attracted increasing attention. These methods partition the data and exploit parallelism to reduce memory and runtime, but suffer increasingly
Externí odkaz:
http://arxiv.org/abs/2407.06346
While distributed training is often viewed as a solution to optimizing linear models on increasingly large datasets, inter-machine communication costs of popular distributed approaches can dominate as data dimensionality increases. Recent work on non
Externí odkaz:
http://arxiv.org/abs/2406.01753
Autor:
Mohammed, Nasser, Ordog, Anna, Booth, Rebecca A., Bracco, Andrea, Brown, Jo-Anne C., Carretti, Ettore, Dickey, John M., Foreman, Simon, Halpern, Mark, Haverkorn, Marijke, Hill, Alex S., Hinshaw, Gary, Kania, Joseph W, Kothes, Roland, Landecker, T. L., MacEachern, Joshua, Masui, Kiyoshi W., Menard, Aimee, Ransom, Ryan R., Reich, Wolfgang, Reich, Patricia, Shaw, J. Richard, Siegel, Seth R., Tahani, Mehrnoosh, Thomson, Alec J. M., Pinsonneault-Marotte, Tristan, Wang, Haochen, West, Jennifer L., Wolleben, Maik, Wulf, Dallas
A direct consequence of Faraday rotation is that the polarized radio sky does not resemble the total intensity sky at long wavelengths. We analyze G137+7, which is undetectable in total intensity but appears as a depolarization feature. We use the fi
Externí odkaz:
http://arxiv.org/abs/2405.15678
Autor:
Martin, Ryan R., Patkós, Balázs
The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where $\mathcal{A}_{k,
Externí odkaz:
http://arxiv.org/abs/2404.12971