An alternative to the conventional micro-canonical ensemble

Usual approach to the foundations of quantum statistical physics is based on conventional micro-canonical ensemble as a starting point for deriving Boltzmann-Gibbs (BG) equilibrium. It leaves, however, a number of conceptual and practical questions unanswered. Here we discuss these questions, thereby motivating the study of a natural alternative known as Quantum Micro-Canonical (QMC) ensemble. We present a detailed numerical study of the properties of the QMC ensemble for finite quantum systems revealing a good agreement with the existing analytical results for large quantum systems. We also propose the way to introduce analytical corrections accounting for finite-size effects. With the above corrections, the agreement between the analytical and the numerical results becomes very accurate. The QMC ensemble leads to an unconventional kind of equilibrium, which may be realizable after strong perturbations in small isolated quantum systems having large number of levels. We demonstrate that the variance of energy fluctuations can be used to discriminate the QMC equilibrium from the BG equilibrium. We further suggest that the reason, why BG equilibrium commonly occurs in nature rather than the QMC-type equilibrium, has something to do with the notion of quantum collapse.Comment: 25 pages, 6 figure

Phase separation in the vicinity of "quantum critical" doping concentration: implications for high temperature superconductors

A general quantitative measure of the tendency towards phase separation is introduced for systems exhibiting phase transitions or crossovers controlled by charge carrier concentration. This measure is devised for the situations when the quantitative knowledge of various contributions to free energy is incomplete, and is applied to evaluate the chances of electronic phase separation associated with the onset of antiferromagnetic correlations in high-temperature cuprate superconductors. The experimental phenomenology of lanthanum- and yittrium-based cuprates was used as input to this analysis. It is also pointed out that Coulomb repulsion between charge carriers separated by the distances of 1-3 lattice periods strengthens the tendency towards phase separation by accelerating the decay of antiferromagnetic correlations with doping. Overall, the present analysis indicates that cuprates are realistically close to the threshold of phase separation -- nanoscale limited or even macroscopic with charge density varying between adjacent crystal planes

Claypan Soils: One-step Improvement

These claypan areas are more than a mere nuisance. They are harder to work than normal soils, and they are not as productive. They need to be improved. The field phases of this work were primarily deep plowing, irrigation, and addition of certain soil amendments. The laboratory phases were measurements of those characteristics which were presumed to be affected by the field practices. An Aberdeen silty clay loam (glossic Udic Natriboroll) site was leased for the 8-year experiment. The genetic claypan exists from about the 9- to 21-inch depth, but varies in thick ness and intensity of development. Small areas of certain associated soils were found, on detailed mapping of the site. Those recognized were Exline (Leptic Natriboroll), Harmony ( Pachic Udic Natriboroll), and Tetonk a (Argiaquic Argialboroll). These areas were delineated during the original sampling operation. The site selected was in the S 1/2 of S 1/2 of NE 1/ 4 sec. 20 , Tl l 7N, R63W, in Spink County

Decidability of quantified propositional intuitionistic logic and S4 on trees

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a model structure which is upward closed. Kremer (1997) has shown that the quantified propositional intuitionistic logic H\pi+ based on the class of all partial orders is recursively isomorphic to full second-order logic. He raised the question of whether the logic resulting from restriction to trees is axiomatizable. It is shown that it is, in fact, decidable. The methods used can also be used to establish the decidability of modal S4 with propositional quantification on similar types of Kripke structures.Comment: v2, 9 pages, corrections and additions; v1 8 page

Assessing Human Error Against a Benchmark of Perfection

An increasing number of domains are providing us with detailed trace data on human decisions in settings where we can evaluate the quality of these decisions via an algorithm. Motivated by this development, an emerging line of work has begun to consider whether we can characterize and predict the kinds of decisions where people are likely to make errors. To investigate what a general framework for human error prediction might look like, we focus on a model system with a rich history in the behavioral sciences: the decisions made by chess players as they select moves in a game. We carry out our analysis at a large scale, employing datasets with several million recorded games, and using chess tablebases to acquire a form of ground truth for a subset of chess positions that have been completely solved by computers but remain challenging even for the best players in the world. We organize our analysis around three categories of features that we argue are present in most settings where the analysis of human error is applicable: the skill of the decision-maker, the time available to make the decision, and the inherent difficulty of the decision. We identify rich structure in all three of these categories of features, and find strong evidence that in our domain, features describing the inherent difficulty of an instance are significantly more powerful than features based on skill or time.Comment: KDD 2016; 10 page

Distributed utterances

I propose an apparatus for handling intrasentential change in context. The standard approach has problems with sentences with multiple occurrences of the same demonstrative or indexical. My proposal involves the idea that contexts can be complex. Complex contexts are built out of (“simple”) Kaplanian contexts by ordered n-tupling. With these we can revise the clauses of Kaplan’s Logic of Demonstratives so that each part of a sentence is taken in a different component of a complex context. I consider other applications of the framework: to agentially distributed utterances (ones made partly by one speaker and partly by another); to an account of scare-quoting; and to an account of a binding-like phenomenon that avoids what Kit Fine calls “the antinomy of the variable.

Longest Common Extensions in Sublinear Space

The longest common extension problem (LCE problem) is to construct a data structure for an input string $T$ of length $n$ that supports LCE$(i,j)$ queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions $i$ and $j$ in $T$. This classic problem has a well-known solution that uses $O(n)$ space and $O(1)$ query time. In this paper we show that for any trade-off parameter $1 \leq \tau \leq n$, the problem can be solved in $O(\frac{n}{\tau})$ space and $O(\tau)$ query time. This significantly improves the previously best known time-space trade-offs, and almost matches the best known time-space product lower bound.Comment: An extended abstract of this paper has been accepted to CPM 201

A note on bound entanglement and local realism

We show using a numerical approach that gives necessary and sufficient conditions for the existence of local realism, that the bound entangled state presented in Bennett et. al. Phys. Rev. Lett. 82, 5385 (1999) admits a local and realistic description. We also find the lowest possible amount of some appropriate entangled state that must be ad-mixed to the bound entangled state so that the resulting density operator has no local and realistic description and as such can be useful in quantum communication and quantum computation.Comment: 5 page

Numerical Simulation of Vortex Crystals and Merging in N-Point Vortex Systems with Circular Boundary

In two-dimensional (2D) inviscid incompressible flow, low background vorticity distribution accelerates intense vortices (clumps) to merge each other and to array in the symmetric pattern which is called ``vortex crystals''; they are observed in the experiments on pure electron plasma and the simulations of Euler fluid. Vortex merger is thought to be a result of negative ``temperature'' introduced by L. Onsager. Slight difference in the initial distribution from this leads to ``vortex crystals''. We study these phenomena by examining N-point vortex systems governed by the Hamilton equations of motion. First, we study a three-point vortex system without background distribution. It is known that a N-point vortex system with boundary exhibits chaotic behavior for N\geq 3. In order to investigate the properties of the phase space structure of this three-point vortex system with circular boundary, we examine the Poincar\'e plot of this system. Then we show that topology of the Poincar\'e plot of this system drastically changes when the parameters, which are concerned with the sign of ``temperature'', are varied. Next, we introduce a formula for energy spectrum of a N-point vortex system with circular boundary. Further, carrying out numerical computation, we reproduce a vortex crystal and a vortex merger in a few hundred point vortices system. We confirm that the energy of vortices is transferred from the clumps to the background in the course of vortex crystallization. In the vortex merging process, we numerically calculate the energy spectrum introduced above and confirm that it behaves as k^{-\alpha},(\alpha\approx 2.2-2.8) at the region 10^0<k<10^1 after the merging.Comment: 30 pages, 11 figures. to be published in Journal of Physical Society of Japan Vol.74 No.