Wind tunnel buffet load measuring technique

Indirect force measurement technique estimates unsteady forces acting on elastic model during wind tunnel tests. Measurement of forces is practically insensitive to errors in aeroelastic scaling between model and full-scale structure, simplifying design, fabrication and dynamic calibration

Bose-Einstein Condensation with Entangled Order Parameter

We propose a practically accessible non-mean-field ground state of Bose-Einstein condensation (BEC), which occurs in an interspecies two-particle entangled state, and is thus described by an entangled order parameter. A suitably defined entanglement entropy is used as the characterization of the non-mean-field nature, and is found to persist in a wide parameter regime. The interspecies entanglement leads to novel interference terms in the dynamical equations governing the single particle orbital wavefunctions. Experimental feasibility and several methods of probe are discussed. We urge the study of multi-channel scattering between different species of atoms.Comment: V1: 5 pages, 4 figures. Accepted by Phys. Rev. Lett.; V2: A couple of very minor typos corrected, publishe

Structure of the Partition Function and Transfer Matrices for the Potts Model in a Magnetic Field on Lattice Strips

We determine the general structure of the partition function of the $q$-state Potts model in an external magnetic field, $Z(G,q,v,w)$ for arbitrary $q$, temperature variable $v$, and magnetic field variable $w$, on cyclic, M\"obius, and free strip graphs $G$ of the square (sq), triangular (tri), and honeycomb (hc) lattices with width $L_y$ and arbitrarily great length $L_x$. For the cyclic case we prove that the partition function has the form $Z(\Lambda,L_y \times L_x,q,v,w)=\sum_{d=0}^{L_y} \tilde c^{(d)} Tr[(T_{Z,\Lambda,L_y,d})^m]$, where $\Lambda$ denotes the lattice type, $\tilde c^{(d)}$ are specified polynomials of degree $d$ in $q$, $T_{Z,\Lambda,L_y,d}$ is the corresponding transfer matrix, and $m=L_x$ ($L_x/2$) for $\Lambda=sq, tri (hc)$, respectively. An analogous formula is given for M\"obius strips, while only $T_{Z,\Lambda,L_y,d=0}$ appears for free strips. We exhibit a method for calculating $T_{Z,\Lambda,L_y,d}$ for arbitrary $L_y$ and give illustrative examples. Explicit results for arbitrary $L_y$ are presented for $T_{Z,\Lambda,L_y,d}$ with $d=L_y$ and $d=L_y-1$. We find very simple formulas for the determinant $det(T_{Z,\Lambda,L_y,d})$. We also give results for self-dual cyclic strips of the square lattice.Comment: Reference added to a relevant paper by F. Y. W

Unitary Fermi Gas in a Harmonic Trap

We present an {\it ab initio} calculation of small numbers of trapped, strongly interacting fermions using the Green's Function Monte Carlo method (GFMC). The ground state energy, density profile and pairing gap are calculated for particle numbers $N = 2 \sim 22$ using the parameter-free "unitary" interaction. Trial wave functions are taken of the form of correlated pairs in a harmonic oscillator basis. We find that the lowest energies are obtained with a minimum explicit pair correlation beyond that needed to exploit the degeneracy of oscillator states. We find that energies can be well fitted by the expression $a_{TF} E_{TF} + \Delta {\rm mod}(N,2)$ where $E_{TF}$ is the Thomas-Fermi energy of a noninteracting gas in the trap and $\Delta$ is a pairing gap. There is no evidence of a shell correction energy in the systematics, but the density distributions show pronounced shell effects. We find the value $\Delta= 0.7\pm 0.2\omega$ for the pairing gap. This is smaller than the value found for the uniform gas at a density corresponding to the central density of the trapped gas.Comment: 2 figures, 2 table

On the threshold-width of graphs

The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-parameter algorithms. We also show that for each k, graphs of TH-width at most k are characterized by a finite collection of forbidden induced subgraphs