Zobrazeno 1 - 10
of 871
pro vyhledávání: '"Cooper, Joshua A."'
It is a classical result due to Jacobi in algebraic combinatorics that the generating function of closed walks at a vertex $u$ in a graph $G$ is determined by the rational function \[ \frac{\phi_{G-u}(t)}{\phi_G(t)} \] where $\phi_G(t)$ is the charac
Externí odkaz:
http://arxiv.org/abs/2411.03567
Autor:
Nguyen, Thai-Son, Pieczulewsi, Naomi, Savant, Chandrashekhar, Cooper, Joshua J. P., Casamento, Joseph, Goldman, Rachel S., Muller, David A., Xing, Huili G., Jena, Debdeep
AlScN is a new wide bandgap, high-k, ferroelectric material for RF, memory, and power applications. Successful integration of high quality AlScN with GaN in epitaxial layer stacks depends strongly on the ability to control lattice parameters and surf
Externí odkaz:
http://arxiv.org/abs/2410.09153
Autor:
Cooper, Joshua, Tauscheck, Gabrielle
In 1971, Graham and Pollak provided a formula for the determinant of the distance matrix of any tree on $n$ vertices. Yan and Yeh reproved this by exploiting the fact that pendant vertices can be deleted from trees without changing the remaining entr
Externí odkaz:
http://arxiv.org/abs/2405.09656
Autor:
Cooper, Joshua, Du, Zhibin
The Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-$k$ Steiner distance hypermatrix of an $n$-vertex graph is the $n \times \cdots \times n$ ($k$ terms) ar
Externí odkaz:
http://arxiv.org/abs/2403.02287
Autor:
Cooper, Joshua, Tauscheck, Gabrielle
Graham and Pollak showed in 1971 that the determinant of a tree's distance matrix depends only on its number of vertices, and, in particular, it is always nonzero. The Steiner distance of a collection of $k$ vertices in a graph is the fewest number o
Externí odkaz:
http://arxiv.org/abs/2402.15621
In this study, we introduce an innovative deep learning framework that employs a transformer model to address the challenges of mixed-integer programs, specifically focusing on the Capacitated Lot Sizing Problem (CLSP). Our approach, to our knowledge
Externí odkaz:
http://arxiv.org/abs/2402.13380
For a general class of hypergraph Tur\'an problems with uniformity $r$, we investigate the principal eigenvector for the $p$-spectral radius (in the sense of Keevash--Lenz--Mubayi and Nikiforov) for the extremal graphs, showing in a strong sense that
Externí odkaz:
http://arxiv.org/abs/2401.10344
Autor:
Cooper, Joshua, Okur, Utku
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction problem''
Externí odkaz:
http://arxiv.org/abs/2312.16152
Autor:
Cooper, Joshua, Tauscheck, Gabrielle
Graham and Pollak showed that the determinant of the distance matrix of a tree $T$ depends only on the number of vertices of $T$. Graphical distance, a function of pairs of vertices, can be generalized to ``Steiner distance'' of sets $S$ of vertices
Externí odkaz:
http://arxiv.org/abs/2306.00243
Autor:
Cooper Joshua, Tauscheck Gabrielle
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 7-2519 (2024)
Graham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero. The Steiner distance of a collection of kk vertices in a graph is the fewest number
Externí odkaz:
https://doaj.org/article/8c5c15a9f9db4e8b95e0acb38964e68a
