Geometrical Ambiguity of Pair Statistics. I. Point Configurations

Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point configurations, among which the most extensively used is the pair distribution function $g_2$. An intriguing inverse problem of practical importance that has been receiving considerable attention is the degree to which a point configuration can be reconstructed from the pair distribution function of a target configuration. Although it is known that the pair-distance information contained in $g_2$ is in general insufficient to uniquely determine a point configuration, this concept does not seem to be widely appreciated and general claims of uniqueness of the reconstructions using pair information have been made based on numerical studies. In this paper, we introduce the idea of the distance space, called the $\mathbb{D}$ space. The pair distances of a specific point configuration are then represented by a single point in the $\mathbb{D}$ space. We derive the conditions on the pair distances that can be associated with a point configuration, which are equivalent to the realizability conditions of the pair distribution function $g_2$. Moreover, we derive the conditions on the pair distances that can be assembled into distinct configurations. These conditions define a bounded region in the $\mathbb{D}$ space. By explicitly constructing a variety of degenerate point configurations using the $\mathbb{D}$ space, we show that pair information is indeed insufficient to uniquely determine the configuration in general. We also discuss several important problems in statistical physics based on the $\mathbb{D}$ space.Comment: 28 pages, 8 figure

Faddeev-Volkov solution of the Yang-Baxter Equation and Discrete Conformal Symmetry

The Faddeev-Volkov solution of the star-triangle relation is connected with the modular double of the quantum group U_q(sl_2). It defines an Ising-type lattice model with positive Boltzmann weights where the spin variables take continuous values on the real line. The free energy of the model is exactly calculated in the thermodynamic limit. The model describes quantum fluctuations of circle patterns and the associated discrete conformal transformations connected with the Thurston's discrete analogue of the Riemann mappings theorem. In particular, in the quasi-classical limit the model precisely describe the geometry of integrable circle patterns with prescribed intersection angles.Comment: 26 pages, 18 color figures, minor correction

Relative Equilibria in the Four-Vortex Problem with Two Pairs of Equal Vorticities

We examine in detail the relative equilibria in the four-vortex problem where two pairs of vortices have equal strength, that is, \Gamma_1 = \Gamma_2 = 1 and \Gamma_3 = \Gamma_4 = m where m is a nonzero real parameter. One main result is that for m > 0, the convex configurations all contain a line of symmetry, forming a rhombus or an isosceles trapezoid. The rhombus solutions exist for all m but the isosceles trapezoid case exists only when m is positive. In fact, there exist asymmetric convex configurations when m < 0. In contrast to the Newtonian four-body problem with two equal pairs of masses, where the symmetry of all convex central configurations is unproven, the equations in the vortex case are easier to handle, allowing for a complete classification of all solutions. Precise counts on the number and type of solutions (equivalence classes) for different values of m, as well as a description of some of the bifurcations that occur, are provided. Our techniques involve a combination of analysis and modern and computational algebraic geometry

Recognizing and Drawing IC-planar Graphs

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$ vertices, we present an $O(n)$-time algorithm that computes a straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm that computes a straight-line drawing of $G$ with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the general case and in the case in which a rotation system is fixed for the input graph. Furthermore, we describe a polynomial-time algorithm to test whether a set of matching edges can be added to a triangulated planar graph such that the resulting graph is IC-planar