Zobrazeno 1 - 10
of 209
pro vyhledávání: '"Cooper, Jacob"'
Autor:
Cooper, Jacob, Leventhal, Ethan
Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of vertices whos
Externí odkaz:
http://arxiv.org/abs/2405.07365
Autor:
Joynt, Veda, Cooper, Jacob, Bhargava, Naman, Vu, Katie, Kwon, O Hwang, Allen, Todd R., Verma, Aditi, Radaideh, Majdi I.
In this work, we propose and assess the potential of generative artificial intelligence (AI) to generate public engagement around potential clean energy sources. Such an application could increase energy literacy -- an awareness of low-carbon energy
Externí odkaz:
http://arxiv.org/abs/2312.01180
In the early 1980s, Erd\H{o}s and S\'os initiated the study of the classical Tur\'an problem with a uniformity condition: the uniform Tur\'an density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large hypergraph with the
Externí odkaz:
http://arxiv.org/abs/2112.01385
Autor:
Kwon, O. Hwang, Vu, Katie, Bhargava, Naman, Radaideh, Mohammed I., Cooper, Jacob, Joynt, Veda, Radaideh, Majdi I.
Publikováno v:
In Renewable and Sustainable Energy Reviews August 2024 200
Autor:
Cooper, Jacob William
The purpose of this study was to explore the experiences of practitioners and scholars in the field of positive youth development through physical activity (PA-PYD) and gather what they have learned during their experience. The primary investigator c
Externí odkaz:
https://hdl.handle.net/2144/38193
We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced with 2x2 o
Externí odkaz:
http://arxiv.org/abs/2011.07572
We show that every connected $k$-chromatic graph contains at least $k^{k-2}$ spanning trees.
Externí odkaz:
http://arxiv.org/abs/2005.05989
Autor:
Cobos, Marlon E., Nuñez-Penichet, Claudia, Campbell, Peter D., Cooper, Jacob C., Machado-Stredel, Fernando, Barve, Narayani, Ashraf, Uzma, Alkishe, Abdelghafar A., Ng'eno, Eric, Nair, Rahul Raveendran, Atauchi, P. Joser, Adeboje, Adeola, Peterson, A. Townsend
Publikováno v:
In Biological Conservation August 2023 284
A well-known conjecture of Tuza asserts that if a graph has at most $t$ pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most $2t$ edges. If true, the factor 2 would be best possible. In the directed setting, also as
Externí odkaz:
http://arxiv.org/abs/1909.07120
A long line of research on fixed parameter tractability of integer programming culminated with showing that integer programs with n variables and a constraint matrix with dual tree-depth d and largest entry D are solvable in time g(d,D)poly(n) for so
Externí odkaz:
http://arxiv.org/abs/1907.06688