Polaron to molecule transition in a strongly imbalanced Fermi gas

A single down spin Fermion with an attractive, zero range interaction with a Fermi sea of up-spin Fermions forms a polaronic quasiparticle. The associated quasiparticle weight vanishes beyond a critical strength of the attractive interaction, where a many-body bound state is formed. From a variational wavefunction in the molecular limit, we determine the critical value for the polaron to molecule transition. The value agrees well with the diagrammatic Monte Carlo results of Prokof'ev and Svistunov and is consistent with recent rf-spectroscopy measurements of the quasiparticle weight by Schirotzek et. al. In addition, we calculate the contact coefficient of the strongly imbalanced gas, using the adiabatic theorem of Tan and discuss the implications of the polaron to molecule transition for the phase diagram of the attractive Fermi gas at finite imbalance.Comment: 10 pages, 4 figures, RevTex4, minor changes, references adde

Blocking Coloured Point Sets

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point in $P$ is assigned one of $k$ colours, such that distinct points $v,w\in P$ are assigned the same colour if and only if some other point in $P$ blocks $v$ and $w$. The focus of this paper is the conjecture that each $k$-blocked set has bounded size (as a function of $k$). Results in the literature imply that every 2-blocked set has at most 3 points, and every 3-blocked set has at most 6 points. We prove that every 4-blocked set has at most 12 points, and that this bound is tight. In fact, we characterise all sets $\{n_1,n_2,n_3,n_4\}$ such that some 4-blocked set has exactly $n_i$ points in the $i$-th colour class. Amongst other results, for infinitely many values of $k$, we construct $k$-blocked sets with $k^{1.79...}$ points

Exploration of Finite 2D Square Grid by a Metamorphic Robotic System

We consider exploration of finite 2D square grid by a metamorphic robotic system consisting of anonymous oblivious modules. The number of possible shapes of a metamorphic robotic system grows as the number of modules increases. The shape of the system serves as its memory and shows its functionality. We consider the effect of global compass on the minimum number of modules necessary to explore a finite 2D square grid. We show that if the modules agree on the directions (north, south, east, and west), three modules are necessary and sufficient for exploration from an arbitrary initial configuration, otherwise five modules are necessary and sufficient for restricted initial configurations

Nonverbal Communication in Politics: A Review of Research Developments, 2005-2015

This article reviews research contributions in political science and communication to the topic of nonverbal communication and politics from 2005 to 2015. The review opens with research on the content of nonverbal communication, then considers studies examining what moderates the impact of nonverbal aspects of political messages on attitudes and behavior and the mechanisms that underpin these effects. Over the period reviewed here, research shows that the nonverbal channel is rich in political information and is consequential for political decision making, particularly under certain circumstances, such as in low-information conditions. Visuals affect political decisions through cognitive and emotional routes. This review article also identifies several directions where further research is required, particularly with regard to social media, nonvisual aspects of nonverbal communication, the interplay of visual and verbal arguments, and the mechanisms behind the effects of nonverbal communication

Lower bounds on the dilation of plane spanners

(I) We exhibit a set of 23 points in the plane that has dilation at least $1.4308$, improving the previously best lower bound of $1.4161$ for the worst-case dilation of plane spanners. (II) For every integer $n\geq13$, there exists an $n$-element point set $S$ such that the degree 3 dilation of $S$ denoted by $\delta_0(S,3) \text{ equals } 1+\sqrt{3}=2.7321\ldots$ in the domain of plane geometric spanners. In the same domain, we show that for every integer $n\geq6$, there exists a an $n$-element point set $S$ such that the degree 4 dilation of $S$ denoted by $\delta_0(S,4) \text{ equals } 1 + \sqrt{(5-\sqrt{5})/2}=2.1755\ldots$ The previous best lower bound of $1.4161$ holds for any degree. (III) For every integer $n\geq6$, there exists an $n$-element point set $S$ such that the stretch factor of the greedy triangulation of $S$ is at least $2.0268$.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2 table

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition

A geometric graph is angle-monotone if every pair of vertices has a path between them that---after some rotation---is $x$- and $y$-monotone. Angle-monotone graphs are $\sqrt 2$-spanners and they are increasing-chord graphs. Dehkordi, Frati, and Gudmundsson introduced angle-monotone graphs in 2014 and proved that Gabriel triangulations are angle-monotone graphs. We give a polynomial time algorithm to recognize angle-monotone geometric graphs. We prove that every point set has a plane geometric graph that is generalized angle-monotone---specifically, we prove that the half-$\theta_6$-graph is generalized angle-monotone. We give a local routing algorithm for Gabriel triangulations that finds a path from any vertex $s$ to any vertex $t$ whose length is within $1 + \sqrt 2$ times the Euclidean distance from $s$ to $t$. Finally, we prove some lower bounds and limits on local routing algorithms on Gabriel triangulations.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons

We consider the following motion-planning problem: we are given $m$ unit discs in a simple polygon with $n$ vertices, each at their own start position, and we want to move the discs to a given set of $m$ target positions. Contrary to the standard (labeled) version of the problem, each disc is allowed to be moved to any target position, as long as in the end every target position is occupied. We show that this unlabeled version of the problem can be solved in $O(n\log n+mn+m^2)$ time, assuming that the start and target positions are at least some minimal distance from each other. This is in sharp contrast to the standard (labeled) and more general multi-robot motion-planning problem for discs moving in a simple polygon, which is known to be strongly NP-hard

Development of high-speed directly-modulated DFB and DBR lasers with surface gratings

The conventional distributed feedback and distributed Bragg reflector edge-emitting lasers employ buried gratings, which require two or more epitaxial growth steps. By using lateral corrugations of the ridge-waveguide as surface gratings the epitaxial overgrowth is avoided, reducing the fabrication complexity, increasing the yield and reducing the fabrication cost. The surface gratings are applicable to different materials, including Al-containing ones and can be easily integrated in complex device structures and photonic circuits. Single-contact and multiple contact edge-emitting lasers with laterally-corrugated ridge waveguide gratings have been developed both on GaAs and InP substrates with the aim to exploit the photon-photon resonance in order to extend their direct modulation bandwidth. The paper reports on the characteristics of such surface-grating-based lasers emitting both at 1.3 and 1.55 μm and presents the photon-photon resonance extended small-signal modulation bandwidth (> 20 GHz) achieved with a 1.6 mm long single-contact device under direct modulation. Similarly structured devices, with shorter cavity lengths are expected to exceed 40 GHz smallsignal modulation bandwidth under direct modulatio