Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Winstein, Vilas"'
Independent sets in graphs, i.e., subsets of vertices where no two are adjacent, have long been studied, for instance as a model of hard-core gas. The $d$-dimensional hypercube, $\{0,1\}^d$, with the nearest neighbor structure, has been a particularl
Externí odkaz:
http://arxiv.org/abs/2410.07080
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm. In case o
Externí odkaz:
http://arxiv.org/abs/2112.10637
Autor:
Vengal, Adu, Winstein, Vilas
Publikováno v:
Journal of Knot Theory and Its Ramifications Vol. 31, No. 07 (2022) 2250052 (24 pages)
In their paper entitled "Quantum Enhancements and Biquandle Brackets," Nelson, Orrison, and Rivera introduced biquandle brackets, which are customized skein invariants for biquandle-colored links. These invariants generalize the Jones polynomial, whi
Externí odkaz:
http://arxiv.org/abs/2006.07692
Publikováno v:
Journal of Knot Theory and Its Ramifications Vol. 29, No. 6 (2020) 2050042 (13 pages)
In their paper entitled "Quantum Enhancements and Biquandle Brackets," Nelson, Orrison, and Rivera introduced biquandle brackets, which are customized skein invariants for biquandle-colored links. We prove herein that if a biquandle bracket is the po
Externí odkaz:
http://arxiv.org/abs/1907.11487
Publikováno v:
Special Matrices, Vol 10, Iss 1, Pp 394-416 (2022)
We discuss spectral clustering from a variety of perspectives that include extending techniques to rectangular arrays, considering the problem of discrepancy minimization, and applying the methods to directed graphs. Near-optimal clusters can be obta
Externí odkaz:
https://doaj.org/article/00496577c17b43de9cb7bf677621358d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.