Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Korsky, Samuel A."'
In this work we attempt to count the number of integer-valued $h$-Lipschitz functions (functions that change by at most $h$ along edges) on two classes of sparse graphs; grid graphs $L_{m,n}$, and sparse random graphs $G(n,d/n)$. We find that for all
Externí odkaz:
http://arxiv.org/abs/2401.07223
Autor:
Korsky, Samuel
We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion, and Moran
Externí odkaz:
http://arxiv.org/abs/2112.04965
Autor:
Korsky, Samuel A.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Co
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Co
Externí odkaz:
https://hdl.handle.net/1721.1/127704