Establishing Relations between Law and Other Forms of Thought and Language

The law does not, and could not, exist in an intellectual or linguistic vacuum. No one believes that the law is or should be impervious to other languages, other bodies of knowledge. In this sense the argument about the ‘autonomy’ of law is an empty one: law cannot be, should not be, perfectly autonomous, unconnected with any other system of thought and expression; yet it plainly has it own identity as a discourse, it own intellectual and linguistic habits, which it is our task as lawyers to understand and develop. It follows that an essential topic of legal thought is the proper relation between law and other forms of thought and expression – a topic that is important, difficult and full of interest

The (2+1)-dimensional Gross-Neveu model with a U(1) chiral symmetry at non-zero temperature

We present results from numerical simulations of the (2+1)-dimensional Gross-Neveu model with a U(1) chiral symmetry and N_f=4 fermion species at non-zero temperature. We provide evidence that there are two different chirally symmetric phases, one critical and one with finite correlation length, separated by a Berezinskii-Kosterlitz-Thouless transition. We have also identified a regime above the critical temperature in which the fermions acquire a screening mass even in the absence of chiral symmetry breaking, analogous to the pseudogap behaviour observed in cuprate superconductors.Comment: 12 pages, 6 figure

Second Harmonic Generation for a Dilute Suspension of Coated Particles

We derive an expression for the effective second-harmonic coefficient of a dilute suspension of coated spherical particles. It is assumed that the coating material, but not the core or the host, has a nonlinear susceptibility for second-harmonic generation (SHG). The resulting compact expression shows the various factors affecting the effective SHG coefficient. The effective SHG per unit volume of nonlinear coating material is found to be greatly enhanced at certain frequencies, corresponding to the surface plasmon resonance of the coated particles. Similar expression is also derived for a dilute suspension of coated discs. For coating materials with third-harmonic (THG) coefficient, results for the effective THG coefficients are given for the cases of coated particles and coated discs.Comment: 11 pages, 3 figures; accepted for publication in Phys. Rev.

On the trade-off between accuracy and spatial resolution when estimating species occupancy from geographically biased samples

Species occupancy is often defined as the proportion of areal units (sites) in a landscape that the focal species occupies, but it is usually estimated from the subset of sites that have been sampled. Assuming no measurement error, we show that three quantities–the degree of sampling bias (in terms of site selection), the proportion of sites that have been sampled and the variability of true occupancy across sites–determine the extent to which a sample-based estimate of occupancy differs from its true value across the wider landscape. That these are the only three quantities (measurement error notwithstanding) to affect the accuracy of estimates of species occupancy is the fundamental insight of the “Meng equation”, an algebraic re-expression of statistical error. We use simulations to show how each of the three quantities vary with the spatial resolution of the analysis and that absolute estimation error is lower at coarser resolutions. Absolute error scales similarly with resolution regardless of the size and clustering of the virtual species’ distribution. Finely resolved estimates of species occupancy have the potential to be more useful than coarse ones, but this potential is only realised if the estimates are at least reasonably accurate. Consequently, wherever there is the potential for sampling bias, there is a trade-off between spatial resolution and accuracy, and the Meng equation provides a theoretical framework in which analysts can consider the balance between the two. An obvious next step is to consider the implications of the Meng equation for estimating a time trend in species occupancy, where it is the confounding of error and true change that is of most interest

Numerical Portrait of a Relativistic BCS Gapped Superfluid

We present results of numerical simulations of the 3+1 dimensional Nambu - Jona-Lasinio (NJL) model with a non-zero baryon density enforced via the introduction of a chemical potential mu not equal to 0. The triviality of the model with a number of dimensions d>=4 is dealt with by fitting low energy constants, calculated analytically in the large number of colors (Hartree) limit, to phenomenological values. Non-perturbative measurements of local order parameters for superfluidity and their related susceptibilities show that, in contrast to the 2+1 dimensional model, the ground-state at high chemical potential and low temperature is that of a traditional BCS superfluid. This conclusion is supported by the direct observation of a gap in the dispersion relation for 0.5<=(mu a)<=0.85, which at (mu a)=0.8 is found to be roughly 15% the size of the vacuum fermion mass. We also present results of an initial investigation of the stability of the BCS phase against thermal fluctuations. Finally, we discuss the effect of splitting the Fermi surfaces of the pairing partners by the introduction of a non-zero isospin chemical potential.Comment: 41 pages, 19 figures, uses axodraw.sty, v2: minor typographical correction

A convex polynomial that is not sos-convex

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition for convexity of $p(x)$. Moreover, the problem of deciding sos-convexity of a polynomial can be cast as the feasibility of a semidefinite program, which can be solved efficiently. Motivated by this computational tractability, it has been recently speculated whether sos-convexity is also a necessary condition for convexity of polynomials. In this paper, we give a negative answer to this question by presenting an explicit example of a trivariate homogeneous polynomial of degree eight that is convex but not sos-convex. Interestingly, our example is found with software using sum of squares programming techniques and the duality theory of semidefinite optimization. As a byproduct of our numerical procedure, we obtain a simple method for searching over a restricted family of nonnegative polynomials that are not sums of squares.Comment: 15 page

Phase structure of lattice QCD for general number of flavors

We investigate the phase structure of lattice QCD for the general number of flavors in the parameter space of gauge coupling constant and quark mass, employing the one-plaquette gauge action and the standard Wilson quark action. Performing a series of simulations for the number of flavors $N_F=6$--360 with degenerate-mass quarks, we find that when $N_F \ge 7$ there is a line of a bulk first order phase transition between the confined phase and a deconfined phase at a finite current quark mass in the strong coupling region and the intermediate coupling region. The massless quark line exists only in the deconfined phase. Based on these numerical results in the strong coupling limit and in the intermediate coupling region, we propose the following phase structure, depending on the number of flavors whose masses are less than $\Lambda_d$ which is the physical scale characterizing the phase transition in the weak coupling region: When $N_F \ge 17$, there is only a trivial IR fixed point and therefore the theory in the continuum limit is free. On the other hand, when $16 \ge N_F \ge 7$, there is a non-trivial IR fixed point and therefore the theory is non-trivial with anomalous dimensions, however, without quark confinement. Theories which satisfy both quark confinement and spontaneous chiral symmetry breaking in the continuum limit exist only for $N_F \le 6$.Comment: RevTeX, 20 pages, 43 PS figure

Templates for Convex Cone Problems with Applications to Sparse Signal Recovery

This paper develops a general framework for solving a variety of convex cone problems that frequently arise in signal processing, machine learning, statistics, and other fields. The approach works as follows: first, determine a conic formulation of the problem; second, determine its dual; third, apply smoothing; and fourth, solve using an optimal first-order method. A merit of this approach is its flexibility: for example, all compressed sensing problems can be solved via this approach. These include models with objective functionals such as the total-variation norm, ||Wx||_1 where W is arbitrary, or a combination thereof. In addition, the paper also introduces a number of technical contributions such as a novel continuation scheme, a novel approach for controlling the step size, and some new results showing that the smooth and unsmoothed problems are sometimes formally equivalent. Combined with our framework, these lead to novel, stable and computationally efficient algorithms. For instance, our general implementation is competitive with state-of-the-art methods for solving intensively studied problems such as the LASSO. Further, numerical experiments show that one can solve the Dantzig selector problem, for which no efficient large-scale solvers exist, in a few hundred iterations. Finally, the paper is accompanied with a software release. This software is not a single, monolithic solver; rather, it is a suite of programs and routines designed to serve as building blocks for constructing complete algorithms.Comment: The TFOCS software is available at http://tfocs.stanford.edu This version has updated reference

NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems

We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials. We also prove that deciding strict convexity, strong convexity, quasiconvexity, and pseudoconvexity of polynomials of even degree four or higher is strongly NP-hard. By contrast, we show that quasiconvexity and pseudoconvexity of odd degree polynomials can be decided in polynomial time.Comment: 20 page