Zobrazeno 1 - 10
of 2 237
pro vyhledávání: '"Mitchell, P. S."'
Autor:
Mitchell, Cheyenne S., Dhruva, Dhananjay, Burke, Zachary P., Durden, David J., Dingilian, Armine I., Backlund, Mikael P.
We report the experimental super-resolution of pairs of simultaneously emitting point-like fluorescent sources using a modified image inversion interferometer microscope. The technique is inspired by recent developments in the application of quantum
Externí odkaz:
http://arxiv.org/abs/2412.16835
Autor:
Biniaz, Ahmad, Maheshwari, Anil, Mitchell, Joseph S. B., Odak, Saeed, Polishchuk, Valentin, Shermer, Thomas
We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we present a simple greedy algorithm for this problem that returns a guard set
Externí odkaz:
http://arxiv.org/abs/2412.15053
Autor:
Chang, Cyuan-Han, Dommes, Vasiliy, Erramilli, Rajeev S., Homrich, Alexandre, Kravchuk, Petr, Liu, Aike, Mitchell, Matthew S., Poland, David, Simmons-Duffin, David
We compute observables of the critical 3d Ising model to high precision by applying the numerical conformal bootstrap to mixed correlators of the leading scalar operators $\sigma$ and $\epsilon$, and the stress tensor $T_{\mu\nu}$. We obtain new prec
Externí odkaz:
http://arxiv.org/abs/2411.15300
Autor:
Chakraborty, Nilanjan, Kasthurirangan, Prahlad Narasimhan, Mitchell, Joseph S. B., Nguyen, Linh, Perk, Michael
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between locations and sea
Externí odkaz:
http://arxiv.org/abs/2410.06069
Autor:
Mitchell, Joseph S. B., Nguyen, Linh
We study some variants of the $k$-\textsc{Watchman Routes} problem, the cooperative version of the classic \textsc{Watchman Routes} problem in a simple polygon. The watchmen may be required to see the whole polygon, or some pre-determined quota of ar
Externí odkaz:
http://arxiv.org/abs/2408.17343
Autor:
Mitchell, Matthew S., Poland, David
We perform a numerical bootstrap study of scalar operators in the critical 3d Gross-Neveu-Yukawa models, a family of conformal field theories containing N Majorana fermions in the fundamental representation of an O(N) global symmetry. We compute rigo
Externí odkaz:
http://arxiv.org/abs/2406.12974
Autor:
Fekete, Sándor P., Mitchell, Joseph S. B., Rieck, Christian, Scheffer, Christian, Schmidt, Christiane
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon $\mathcal{P}$, with pairwise geodesic Euclidean vertex distance of at least $1$, and a rational number $\ell$; decide whether there is a set of vertex guards such that $\
Externí odkaz:
http://arxiv.org/abs/2406.05861
Autor:
Mitchell, Joseph S. B., Nguyen, Linh
Publikováno v:
36th Canadian Conference on Computational Geometry (CCCG 2024)
The well-known \textsc{Watchman Route} problem seeks a shortest route in a polygonal domain from which every point of the domain can be seen. In this paper, we study the cooperative variant of the problem, namely the \textsc{$k$-Watchmen Routes} prob
Externí odkaz:
http://arxiv.org/abs/2405.21034
We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of investigation, w
Externí odkaz:
http://arxiv.org/abs/2403.11861
Publikováno v:
19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the length(s) of the r
Externí odkaz:
http://arxiv.org/abs/2402.05420