No abstract uploaded!

Define a “Liouville domain” to be a compact exact symplectic manifold with contact-type boundary. We use embedded contact homology to assign to each four-dimensional Liouville domain (or subset thereof) a sequence of real numbers, which we call “ECH capacities”. The ECH capacities of a Liouville domain are defined in terms of the “ECH spectrum” of its boundary, which measures the amount of symplectic action needed to represent certain classes in embedded contact homology. Using cobordism maps on embedded contact homology (defined in joint work with Taubes), we show that the ECH capacities are monotone with respect to symplectic embeddings. We compute the ECH capacities of ellipsoids, polydisks, certain subsets of the cotangent bundle of T 2, and disjoint unions of examples for which the ECH capacities are known. The resulting symplectic embedding obstructions are sharp in some interesting cases, for example for the problem of embedding an ellipsoid into a ball (as shown by McDuff-Schlenk) or embedding a disjoint union of balls into a ball. We also state and present evidence for a conjecture under which the asymptotics of the ECH capacities of a Liouville domain recover its symplectic volume.

The moment-entropy inequality shows that a contin- uous random variable with given second moment and maximal Shannon entropy must be Gaussian. Stam’s inequality shows that a continuous random variable with given Fisher information and minimal Shannon entropy must also be Gaussian. The Crame ́r- Rao inequality is a direct consequence of these two inequalities. In this paper the inequalities above are extended to Renyi entropy, p-th moment, and generalized Fisher information. Gen- eralized Gaussian random densities are introduced and shown to be the extremal densities for the new inequalities. An extension of the Crame ́r–Rao inequality is derived as a consequence of these moment and Fisher information inequalities.

No abstract uploaded!

This investigation studies nonemptiness problems of plane edge coloring with three colors. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of p colors are arranged side by side such that the touching edges of the adjacent tiles have the same colors. Given a basic set B of Wang tiles, the nonemptiness problem is to determine whether or not Σ(B) 6= ∅, where Σ(B) is the set of all global patterns on Z2 that can be constructed from the Wang tiles in B. Wang’s conjecture is that for any B of Wang tiles, Σ(B) 6= ∅ if and only if P(B) 6= ∅, where P(B) is the set of all periodic patterns on Z2 that can be generated by the tiles in B. When p ≥ 5, Wang’s conjecture is known to be wrong. When p = 2, theconjecture is true. This study proves that when p = 3, the conjecture is also true. If P(B) 6= ∅, then B has a subset B′ of minimal cycle generators such that P(B′) 6= ∅ and P(B′′) = ∅ for B′′ $ B′. This study demonstrates that the set C(3) of all minimal cycle generators contains 787, 605 members that can be classified into 2, 906 equivalence classes. N(3) is the set of all maximal non-cycle generators : if B ∈ N(3), then P(B) = ∅ and P(B ˜) 6= ∅ for B ˜ % B. Wang’s conjecture is shown to be true by proving that B ∈ N(3) implies Σ(B) = ∅.