Compositional uniformity, domain patterning and the mechanism underlying nano-chessboard arrays

We propose that systems exhibiting compositional patterning at the nanoscale, so far assumed to be due to some kind of ordered phase segregation, can be understood instead in terms of coherent, single phase ordering of minority motifs, caused by some constrained drive for uniformity. The essential features of this type of arrangements can be reproduced using a superspace construction typical of uniformity-driven orderings, which only requires the knowledge of the modulation vectors observed in the diffraction patterns. The idea is discussed in terms of a simple two dimensional lattice-gas model that simulates a binary system in which the dilution of the minority component is favored. This simple model already exhibits a hierarchy of arrangements similar to the experimentally observed nano-chessboard and nano-diamond patterns, which are described as occupational modulated structures with two independent modulation wave vectors and simple step-like occupation modulation functions.Comment: Preprint. 11 pages, 11 figure

New obstructions to symplectic embeddings

In this paper we establish new restrictions on symplectic embeddings of certain convex domains into symplectic vector spaces. These restrictions are stronger than those implied by the Ekeland-Hofer capacities. By refining an embedding technique due to Guth, we also show that they are sharp.Comment: 80 pages, 3 figures, v2: improved exposition and minor corrections, v3: Final version, expanded and improved exposition and minor corrections. The final publication is available at link.springer.co

An exact sequence for contact- and symplectic homology

A symplectic manifold $W$ with contact type boundary $M = \partial W$ induces a linearization of the contact homology of $M$ with corresponding linearized contact homology $HC(M)$. We establish a Gysin-type exact sequence in which the symplectic homology $SH(W)$ of $W$ maps to $HC(M)$, which in turn maps to $HC(M)$, by a map of degree -2, which then maps to $SH(W)$. Furthermore, we give a description of the degree -2 map in terms of rational holomorphic curves with constrained asymptotic markers, in the symplectization of $M$.Comment: Final version. Changes for v2: Proof of main theorem supplemented with detailed discussion of continuation maps. Description of degree -2 map rewritten with emphasis on asymptotic markers. Sec. 5.2 rewritten with emphasis on 0-dim. moduli spaces. Transversality discussion reorganized for clarity (now Remark 9). Various other minor modification

Parameterized Algorithms for Graph Partitioning Problems

We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at least) $p$, where $\alpha_1,\alpha_2\in\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-Sparsest Subgraph. Our main result is an $O^*(4^{k+o(k)}\Delta^k)$ algorithm for any problem in this class, where $\Delta \geq 1$ is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. [IPEC 2013]. We obtain faster algorithms for certain subclasses of FGPPs, parameterized by $p$, or by $(k+p)$. In particular, we give an $O^*(4^{p+o(p)})$ time algorithm for Max $(k,n-k)$-Cut, thus improving significantly the best known $O^*(p^p)$ time algorithm

Application of mixed formulations of quasi-reversibility to solve ill-posed problems for heat and wave equations: the 1d case

International audienceIn this paper we address some ill-posed problems involving the heat or the wave equation in one dimension, in particular the backward heat equation and the heat/wave equation with lateral Cauchy data. The main objective is to introduce some variational mixed formulations of quasi-reversibility which enable us to solve these ill-posed problems by using some classical La-grange finite elements. The inverse obstacle problems with initial condition and lateral Cauchy data for heat/wave equation are also considered, by using an elementary level set method combined with the quasi-reversibility method. Some numerical experiments are presented to illustrate the feasibility for our strategy in all those situations. 1. Introduction. The method of quasi-reversibility has now a quite long history since the pioneering book of Latt es and Lions in 1967 [1]. The original idea of these authors was, starting from an ill-posed problem which satisfies the uniqueness property, to introduce a perturbation of such problem involving a small positive parameter ε. This perturbation has essentially two effects. Firstly the perturbation transforms the initial ill-posed problem into a well-posed one for any ε, secondly the solution to such problem converges to the solution (if it exists) to the initial ill-posed problem when ε tends to 0. Generally, the ill-posedness in the initial problem is due to unsuitable boundary conditions. As typical examples of linear ill-posed problems one may think of the backward heat equation, that is the initial condition is replaced by a final condition, or the heat or wave equations with lateral Cauchy data, that is the usual Dirichlet or Neumann boundary condition on the boundary of the domain is replaced by a pair of Dirichlet and Neumann boundary conditions on the same subpart of the boundary, no data being prescribed on the complementary part of the boundary

Controlling the Frequency-Temperature Sensitivity of a Cryogenic Sapphire Maser Frequency Standard by Manipulating Fe3+ Spins in the Sapphire Lattice

To create a stable signal from a cryogenic sapphire maser frequency standard, the frequency-temperature dependence of the supporting Whispering Gallery mode must be annulled. We report the ability to control this dependence by manipulating the paramagnetic susceptibility of Fe3+ ions in the sapphire lattice. We show that the maser signal depends on other Whispering Gallery modes tuned to the pump signal near 31 GHz, and the annulment point can be controlled to exist between 5 to 10 K depending on the Fe3+ ion concentration and the frequency of the pump. This level of control has not been achieved previously, and will allow improvements in the stability of such devices.Comment: 17 pages, 10 figure

Creating traveling waves from standing waves from the gyrotropic paramagnetic properties of Fe3+^{3+} ions in a high-Q whispering gallery mode sapphire resonator

We report observations of the gyrotropic change in magnetic susceptibility of the Fe$^{3+}$ electron paramagnetic resonance at 12.037GHz (between spin states $|1/2>$ and $|3/2>$) in sapphire with respect to applied magnetic field. Measurements were made by observing the response of the high-Q Whispering Gallery doublet (WGH$_{\pm17,0,0}$) in a Hemex sapphire resonator cooled to 5 K. The doublets initially existed as standing waves at zero field and were transformed to traveling waves due to the gyrotropic response.Comment: Accepted for publication in Phys. Rev.

Weak and strong fillability of higher dimensional contact manifolds

For contact manifolds in dimension three, the notions of weak and strong symplectic fillability and tightness are all known to be inequivalent. We extend these facts to higher dimensions: in particular, we define a natural generalization of weak fillings and prove that it is indeed weaker (at least in dimension five),while also being obstructed by all known manifestations of "overtwistedness". We also find the first examples of contact manifolds in all dimensions that are not symplectically fillable but also cannot be called overtwisted in any reasonable sense. These depend on a higher-dimensional analogue of Giroux torsion, which we define via the existence in all dimensions of exact symplectic manifolds with disconnected contact boundary.Comment: 68 pages, 5 figures. v2: Some attributions clarified, and other minor edits. v3: exposition improved using referee's comments. Published by Invent. Mat

Blood histamine levels (BHL) in infants and children with respiratory and non-respiratory diseases.

BACKGROUND: Blood histamine levels are decreased after severe allergic reactions and in various chronic diseases. AIMS: To study blood histamine levels in infants and children with acute infectious and non-infectious, non-allergic, disease. METHODS: Blood histamine levels were investigated by a fluorometric method in infants and children admitted to hospital with bronchiolitis, non-wheezing bronchitis, acute infections of the urinary tract, skin and ear-nose-throat, gastroenteritis, or hyperthermia of unknown aetiology. Results of blood histamine levels and white blood cell counts were compared with those obtained for children recovering from benign non-infectious, non-allergic illnesses. RESULTS: As compared with control children, white blood cell numbers were significantly increased in children with acute infections of the urinary tract, skin and ear-nose-throat, and were significantly decreased in children with gastroenteritis. Blood histamine levels were significantly lower in children with gastroenteritis and hyperthermia than in children with other diseases and control children. It was not possible to correlate blood histamine levels and the number of blood basophils. CONCLUSIONS: BHL are significantly decreased in infants and children with acute gastroenteritis and hyperthermia of unknown aetiology. The mechanisms responsible for the decrease in blood histamine levels in children with gastroenteritis and hyperthermia are discussed

ITERATED QUASI-REVERSIBILITY METHOD APPLIED TO ELLIPTIC AND PARABOLIC DATA COMPLETION PROBLEMS

International audienceWe study the iterated quasi-reversibility method to regularize ill-posed elliptic and parabolic problems: data completion problems for Poisson's and heat equations. We define an abstract setting to treat both equations at once. We demonstrate the convergence of the regularized solution to the exact one, and propose a strategy to deal with noise on the data. We present numerical experiments for both problems: a two-dimensional corrosion detection problem and the one-dimensional heat equation with lateral data. In both cases, the method prove to be efficient even with highly corrupted data