Two Ergodic Sample-Path Properties of the Poisson Process

For increasing sequences of real numbers we consider two types of asymptotic behavior that remind of the defining property of a (homogeneous) Poisson process according to which the numbers of points in disjoint intervals are independent and follow Poisson distributions with specified parameters. We prove that almost all paths of a Poisson process show this asymptotic behavior, and characterize the Poisson process by these properties. Further we discuss the connection to equidistribution notions.     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

Chen’ s theorem in arithmetical progressions

LetN be a sufficiently large even integer and

A generalized sandwich theorem

It is proved for an arbitrary commutative ring A with identity and any integer n3 that if H is a subgroup of GL_n(A) normalized by E _n(A,q), then there is an ideal of A such that E _n(A,) H GL _n (A, (:q⁴⁰).Furthermore, is uniquely determined up to a certain equivalence relation on the set of ideals of A. The result extends a theorem of Bak, by removing a stability condition he uses on A.     

Consistency of a linear system of inequalities

We show that a consistency check of a linear system of inequalitiesAxb reduces to check whetherQb0 for a certain matrixQ. It is a direct consequence of the Farkas-Minkowski theorem. Thus, when one has to check consistency for different values ofb, one need not run a numerical algorithm for eachb.On leave at the Electronics Research Laboratory of the University of California at Berkeley in a CNRS/NSF Exchange Program.     

The Hellmann-Feynman theorem applied to long-range forces

The relations between the Hellmann-Feynman forces in laboratory fixed (L-) and relative (R-) coordinate systems are clarified. In the usualL-coordinate system, the force is interpreted as force on nucleus, while in theR-coordinate system, it means force on whole particles consisting of the electrons and nuclei of each interacting subsystem. From a perturbation theoretical viewpoint, the concept of the force on whole particles correctly corresponds to the perturbation energy and is superior to the force on the nucleus.     

Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence

We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.     

Tensor products of coherent configurations

A Cartesian decomposition of a coherent configuration ✗ is defined as a special set of its parabolics that form a Cartesian decomposition of the underlying set. It turns out that every tensor decomposition of ✗ comes from a certain Cartesian decomposition. It is proved that if the coherent configuration ✗ is thick, then there is a unique maximal Cartesian decomposition of ✗; i.e., there is exactly one internal tensor decomposition of ✗ into indecomposable components. In particular, this implies an analog of the Krull–Schmidt theorem for the thick coherent configurations. A polynomial-time algorithm for finding the maximal Cartesian decomposition of a thick coherent configuration is constructed.     

A Review of Results on Axially Symmetric Navier-Stokes Equations,with Addendum by X. Pan and Q. Zhang

In this paper, we give a brief survey of recent results on axially symmetric Navier-Stokes equations (ASNS) in the following categories: regularity criterion, Liouville property for ancient solutions, decay and vanishing of stationary solutions. Some discussions also touch on the full 3 dimensional equations. Two results, closing of the scaling gap for ASNS and vanishing of homogeneous D solutions in 3 dimensional slabs will be described in more detail.In the addendum, two new results in the 3rd category will also be presented, which are generalizations of recently published results by the author and coauthors.     

Monge-Ampère Equation with Bounded Periodic Data

We consider the Monge-Ampère equation det $(D^2u) = f$ in $\mathbb{R}^n,$ where $f$ is a positive bounded periodic function. We prove that $u$ must be the sum of a quadratic polynomial and a periodic function. For $f ≡ 1,$ this is the classic result by Jörgens, Calabi and Pogorelov. For $f ∈ C^α,$ this was proved by Caffarelli and the first named author.