Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Robin Pemantle"'
Autor:
Richard Kenyon, Robin Pemantle
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
We define and study a recurrence relation in $\mathbb{Z}^3$, called the hexahedron recurrence, which is similar to the octahedron recurrence (Hirota bilinear difference equation) and cube recurrence (Miwa equation). Like these examples, solutions to
Externí odkaz:
https://doaj.org/article/e2e57b81fff74221860f2c99ea1cc6db
Autor:
Andrew Bressler, Robin Pemantle
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)
We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip matrices. Using a multivariate generating function analysis we give a simplified proof of a known phenomenon, namely that the walk has linear speed rath
Externí odkaz:
https://doaj.org/article/3f0571442ad446faab25078c34296ab0
Publikováno v:
Mathematical Statistics and Learning. 2:275-309
The insertion-deletion channel takes as input a bit string ${\bf x}\in\{0,1\}^{n}$, and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover $\bf x$ from many independent o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1351349e1aa3dae7d73c1303d6f2d2d0
https://doi.org/10.4171/msl/16
https://doi.org/10.4171/msl/16
Publikováno v:
Journal of Statistical Physics. 181:1323-1364
We explore the survival function for percolation on Galton–Watson trees. Letting g(T, p) represent the probability a tree T survives Bernoulli percolation with parameter p, we establish several results about the behavior of the random function $$g(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de5bdca7af7980140e10cbf7db118299
https://doi.org/10.1007/s10955-020-02629-6
https://doi.org/10.1007/s10955-020-02629-6
Publikováno v:
Theory of Computing. 16:1-23
We consider the problem of distributed corruption detection in networks. In this model, each vertex of a directed graph is either truthful or corrupt. Each vertex reports the type (truthful or corrupt) of each of its outneighbors. If it is truthful,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::458a7d46ac43d1aad2272994a150e281
https://doi.org/10.4086/toc.2020.v016a001
https://doi.org/10.4086/toc.2020.v016a001
Autor:
Henri Picciotto, Robin Pemantle
A collaboration between a seasoned math teacher and a research mathematician, this resource offers balanced instructional ideas based on student intellectual engagement and skilled teacher leadership. It is solidly grounded in many areas of classroom
Autor:
Robin Pemantle
Publikováno v:
Bulletin of the American Mathematical Society. 56:159-164
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2cecbb959afe830c39d175bacca4a6e
https://doi.org/10.1090/bull/1607
https://doi.org/10.1090/bull/1607
Autor:
Emanuel A. Lazar, Robin Pemantle
Publikováno v:
Israel Journal of Mathematics. 221:59-84
We study a coarsening process of one-dimensional cell complexes. We show that if cell boundaries move with velocities proportional to the difference in size of neighboring cells, then the average cell size grows at a prescribed exponential rate and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70a370898414e5cfb9da07e8e912fc1d
https://doi.org/10.1007/s11856-017-1543-6
https://doi.org/10.1007/s11856-017-1543-6
Autor:
Sneha Dey Subramanian, Robin Pemantle
Publikováno v:
Transactions of the American Mathematical Society. 369:8743-8764
We consider an analytic function $f$ whose zero set forms a unit intensity Poisson process on the real line. We show that repeated differentiation causes the zero set to converge in distribution to a random translate of the integers.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cfbfd29258b31e6adfe2662ac59094a
https://doi.org/10.1090/tran/6929
https://doi.org/10.1090/tran/6929
On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key topological invariants. Here we establish checkable conditions under wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc27ba4cd33c588152d1f6a4299337a9