Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Stepin, Alicia"'
Autor:
Albors, Alex, Bhatti, Hisham, Ganjoo, Lukshya, Guo, Raymond, Kunisky, Dmitriy, Mukherjee, Rohan, Stepin, Alicia, Zeng, Tony
The bad science matrix problem consists in finding, among all matrices $A \in \mathbb{R}^{n \times n}$ with rows having unit $\ell^2$ norm, one that maximizes $\beta(A) = \frac{1}{2^n} \sum_{x \in \{-1, 1\}^n} \|Ax\|_\infty$. Our main contribution is
Externí odkaz:
http://arxiv.org/abs/2408.00933
Autor:
Dudarov, William, Feinberg, Noah, Guo, Raymond, Goh, Ansel, Ottolini, Andrea, Stepin, Alicia, Tripathi, Raghavenda, Zhang, Joia
Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that the linear
Externí odkaz:
http://arxiv.org/abs/2307.04740