L 2 existence theorems for the\bar \partial _b - Neumann problem on strongly pseudoconvex CR manifoldsproblem on strongly pseudoconvex CR manifolds

LetM be the boundary of a strongly pseudoconvex domain in \(\mathbb{C}^n \) ,n≥4 and ω be an open subset inM such that ?ω is the intersection ofM with a flat hypersurface. We establish theL ² existence theorems of the \(\bar \partial _b - Neumann\) problem on ω. In particular, we prove that the \(\bar \partial _b - Laplacian\) \(\square _b = \bar \partial _b \bar \partial _b^* + \bar \partial _b^* \bar \partial _b \) equipped with a pair of natural boundary conditions, the so-called \(\bar \partial _b - Neumann\) boundary conditions, has closed range when it acts on (0,q) forms, 1≤q≤n?3. Thus there exists a bounded inverse operator for \(\square _b \) , the \(\bar \partial _b - Neumann\) operatorN _b, and we have the following Hodge decomposition theorem on ω for \(\bar \partial _b \bar \partial _b^* N_b \alpha + \bar \partial _b^* \bar \partial _b N_b \alpha \) , for any (0,q) form α withL ²(ω) coefficients. The proof depends on theL ^p regularity of the tangential Cauchy-Riemann operators \(\bar \partial _b u = \alpha \) on ω?M under the compatibility condition \(\bar \partial _b \alpha = 0\) , where α is a (p, q) form on ω, where 1≤q≤n?2. The interior regularity ofN _b follows from the fact that \(\square _b \) is subelliptic in the interior of ω. The operatorN _b induces natural questions on the regularity up to the boundary ?ω. Near the characteristic point of the boundary, certain compatibility conditions will be present. In fact, one can show thatN _b is not a compact operator onL ²(ω).     

On the Relaxed Colouring Game and the Unilateral Colouring Game

In the paper we introduce the new game—the unilateral \({\mathcal{P}}\) -colouring game which can be used as a tool to study the r-colouring game and the (r, d)-relaxed colouring game. Let be given a graph G, an additive hereditary property \({\mathcal {P}}\) and a set C of r colours. In the unilateral \({\mathcal {P}}\) -colouring game similarly as in the r-colouring game, two players, Alice and Bob, colour the uncoloured vertices of the graph G, but in the unilateral \({\mathcal {P}}\) -colouring game Bob is more powerful than Alice. Alice starts the game, the players play alternately, but Bob can miss his move. Bob can colour the vertex with an arbitrary colour from C, while Alice must colour the vertex with a colour from C in such a way that she cannot create a monochromatic minimal forbidden subgraph for the property \({\mathcal {P}}\) . If after |V(G)| moves the graph G is coloured, then Alice wins the game, otherwise Bob wins. The \({\mathcal {P}}\) -unilateral game chromatic number, denoted by \({\chi_{ug}^\mathcal {P}(G)}\) , is the least number r for which Alice has a winning strategy for the unilateral \({\mathcal {P}}\) -colouring game with r colours on G. We prove that the \({\mathcal {P}}\) -unilateral game chromatic number is monotone and is the upper bound for the game chromatic number and the relaxed game chromatic number. We give the winning strategy for Alice to play the unilateral \({\mathcal {P}}\) -colouring game. Moreover, for k ≥  2 we define a class of graphs \({\mathcal {H}_k =\{G|{\rm every \;block \;of\;}G \; {\rm has \;at \;most}\; k \;{\rm vertices}\}}\) . The class \({\mathcal {H}_k }\) contains, e.g., forests, Husimi trees, line graphs of forests, cactus graphs. Let \({\mathcal {S}_d}\) be the class of graphs with maximum degree at most d. We find the upper bound for the \({\mathcal {S}_2}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_3}\) and we study the \({\mathcal {S}_d}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_4}\) for \({d \in \{2,3\}}\) . As the conclusion from these results we obtain the result for the d-relaxed game chromatic number: if \({G \in \mathcal {H}_k}\) , then \({\chi_g^{(d)}(G) \leq k + 2-d}\) , for \({k \in \{3, 4\}}\) and \({d \in \{0, \ldots, k-1\}}\) . This generalizes a known result for trees.     

A ℤ-Simplex Algorithm with partial updates

The Simplex primal and dual methods, for the solution of $$\max \left\{ {c^T x:Ax = b, x \geqslant 0} \right\},$$ were presented previously in terms of certain bases ? and \(\mathbb{Y}\) ofN(A) andR(A ^T ) respectively. In these implementations, called the ?-Simplex Algorithm and the \(\mathbb{Y}\) -Dual Method, the bases ? and \(\mathbb{Y}\) (giving the edges of the polyhedron in question at the given basic feasible solution) are updated at each iteration. In this paper we show that only partial updates of ? are needed in the ?-Simplex Algorithm, analogously to the partial updates in the Revised Simplex Algorithm. Similar results can be given for the \(\mathbb{Y}\) -Dual Method.     

A weak second-order split-step method for numerical simulations of stochastic differential equations

In an analogy from symmetric ordinary differential equation numerical integrators, we derive a three-stage, weak 2nd-order procedure for Monte-Carlo simulations of Itô stochastic differential equations. Our composite procedure splits each time step into three parts: an \(h/2\) -stage of trapezoidal rule, an \(h\) -stage martingale, followed by another \(h/2\) -stage of trapezoidal rule. In \(n\) time steps, an \(h/2\) -stage deterministic step follows another \(n-1\) times. Each of these adjacent pairs may be combined into a single \(h\) -stage, effectively producing a two-stage method with partial overlap between successive time steps.     

Bounded Degree, Triangle Avoidance Graph Games

We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game begins with two players and an empty graph on n vertices. The two players take turns choosing edges within K _n , building up a simple graph. The edges must be chosen according to a set of restrictions ${\mathcal{R}}$ . The winner is the last player to choose an edge that does not violate any of the restrictions in ${\mathcal{R}}$ . For fixed n and ${\mathcal{R}}$ , one of the players has a winning strategy. For various games where ${\mathcal{R}}$ includes bounded degree and triangle avoidance, we determine the winner for all values of n.     

On near optimal trajectories for a game associated with the ��-Laplacian

A two-player stochastic differential game representation has recently been obtained for solutions of the equation ???_?? u?=?h in a ${{\mathcal C}^2}$ domain with Dirichlet boundary condition, where h is continuous and takes values in ${{\mathbb R}{\setminus}\{0\}}$ . Under appropriate assumptions, including smoothness of u, we identify a family of diffusion processes that may arise as the vanishing ?? limit law of the state process, when both players play ??-optimally. We also identify the limit law of the state process under a sequence of near saddle points.     

The explicit solutions ofC_{p,q}^{k + \alpha } -form for the\bar \partial -equations on pseudoconvex open sets

In this paper, we study the integral solution operators for the $\bar \partial $ -equations on pseudoconvex domains. As a generalization of [1] for the $\bar \partial $ -equations on pseudoconvex domains with boundary of classC ^∞, we obtain the explicit integral operator solutions of $C_{p,q}^{k + \alpha } $ -form for the $\bar \partial $ -equations on pseudoconvex open sets with boundary ofC ^k (k≥0) and the sup-norm estimates of which solutions have similar as that [1] in form.     

Anderson’s Orthogonality Catastrophe for One-Dimensional Systems

The overlap, \({\mathcal{D}_N}\) , between the ground state of N free fermions and the ground state of N fermions in an external potential in one spatial dimension is given by a generalized Gram determinant. An upper bound is \({\mathcal{D}_N\leq\exp(-\mathcal{I}_N)}\) with the so-called Anderson integral \({\mathcal{I}_N}\) . We prove, provided the external potential satisfies some conditions, that in the thermodynamic limit \({\mathcal{I}_N = \gamma\ln N + O(1)}\) as \({N\to\infty}\) . The coefficient γ > 0 is given in terms of the transmission coefficient of the one-particle scattering matrix. We obtain a similar lower bound on \({\mathcal{D}_N}\) concluding that \({\tilde{C} N^{-\tilde{\gamma}} \leq \mathcal{D}_N \leq CN^{-\gamma}}\) with constants C, \({\tilde{C}}\) , and \({\tilde{\gamma}}\) . In particular, \({\mathcal{D}_N\to 0}\) as \({N\to\infty}\) which is known as Anderson’s orthogonality catastrophe.     

A Uniqueness Theorem for Bounded Analytic Functions on the Polydisc

Given n, N ≥ 1 we construct a set of points ${\lambda_1,{\ldots},\lambda_{N^n}\in{\mathbb D}^n}$ such that for each rational inner function f on ${{\mathbb D}^n}$ of degree less than N the Pick problem on ${{\mathbb D}^n}$ with data ${\lambda_1,{\ldots},\lambda_{N^n}}$ and ${f(\lambda_1),{\ldots},f(\lambda_{N^n})}$ has a unique solution. In particular, we construct a 1-dimensional inner variety V and show that the points ${\lambda_1,{\ldots},\lambda_{N^n}}$ may be chosen almost arbitrarily in ${V\cap{\mathbb D}^n}$ . Our results state that f is uniquely determined in the Schur class of ${{\mathbb D}^n}$ by its values on ${\lambda_1,{\ldots},\lambda_{N^n}}$ .     

More on the pressing down game

We investigate the pressing down game and its relation to the Banach Mazur game. In particular we show: consistently, there is a nowhere precipitous normal ideal I on ${\aleph_2}$ such that player nonempty wins the pressing down game of length ${\aleph_1}$ on I even if player empty starts.     

Mixed Invariant Subspaces over the Bidisk

It is known that the structure of invariant subspaces I of the Hardy space H ² over the bidisk is extremely complicated. One reason is that it is difficult to describe infinite dimensional wandering spaces ${I\ominus zI}$ completely. In this paper, we study the structure of nontrivial closed subspaces N of H ² with ${T_zN\subset N}$ and ${T^*_wN\subset N}$ , which are called mixed invariant subspaces under T _z and ${T^*_w}$ . We know that the dimension of ${N\ominus zN}$ ranges from 1 to ??. If ${T^*_w(N\ominus zN)\subset N\ominus zN}$ , we may describe N completely. If ${T^*_w(N\ominus zN)\not\subset N\ominus zN}$ , it seems difficult to describe N generally. So we study N under the condition ${dim\,(N\ominus zN)=1}$ . Write ${M=H^2\ominus N}$ . We describe ${M\ominus wM}$ precisely. We give a characterization of N for which there is a nonzero function ${\varphi}$ in ${M\ominus wM}$ satisfying ${z^k\varphi\in M\ominus wM}$ for every k ?? 0. We also see that the space ${M\ominus wM}$ has a deep connection with the de Branges?CRovnyak spaces studied by Sarason.     

Nilpotent Gelfand pairs and spherical transforms of Schwartz functions I: rank-one actions on the centre

The spectrum of a Gelfand pair of the form ${(K\ltimes N,K)}$ , where N is a nilpotent group, can be embedded in a Euclidean space ${{\mathbb R}^d}$ . The identification of the spherical transforms of K-invariant Schwartz functions on N with the restrictions to the spectrum of Schwartz functions on ${{\mathbb R}^d}$ has been proved already when N is a Heisenberg group and in the case where N?=?N _3,2 is the free two-step nilpotent Lie group with three generators, with K?=?SO₃ (Astengo et?al. in J Funct Anal 251:772–791, 2007; Astengo et?al. in J Funct Anal 256:1565–1587, 2009; Fischer and Ricci in Ann Inst Fourier Gren 59:2143–2168, 2009). We prove that the same identification holds for all pairs in which the K-orbits in the centre of N are spheres. In the appendix, we produce bases of K-invariant polynomials on the Lie algebra ${{\mathfrak n}}$ of N for all Gelfand pairs ${(K\ltimes N,K)}$ in Vinberg’s list (Vinberg in Trans Moscow Math Soc 64:47–80, 2003; Yakimova in Transform Groups 11:305–335, 2006).     

The Maximal Variation of Martingales of Probabilities and Repeated Games with Incomplete Information

The variation of a martingale $p_{0}^{k}=p_{0},\ldots,p_{k}$ of probabilities on a finite (or countable) set X is denoted $V(p_{0}^{k})$ and defined by $$ V\bigl(p_0^k\bigr)=E\Biggl(\sum_{t=1}^k\|p_t-p_{t-1}\|_1\Biggr). $$ It is shown that $V(p_{0}^{k})\leq\sqrt{2kH(p_{0})}$ , where H(p) is the entropy function H(p)=?∑ _x p(x)logp(x), and log stands for the natural logarithm. Therefore, if d is the number of elements of X, then $V(p_{0}^{k})\leq\sqrt{2k\log d}$ . It is shown that the order of magnitude of the bound $\sqrt{2k\log d}$ is tight for d≤2 ^k : there is C>0 such that for all k and d≤2 ^k , there is a martingale $p_{0}^{k}=p_{0},\ldots,p_{k}$ of probabilities on a set X with d elements, and with variation $V(p_{0}^{k})\geq C\sqrt{2k\log d}$ . An application of the first result to game theory is that the difference between v _k and lim _j v _j , where v _k is the value of the k-stage repeated game with incomplete information on one side with d states, is bounded by $\|G\|\sqrt{2k^{-1}\log d}$ (where ∥G∥ is the maximal absolute value of a stage payoff). Furthermore, it is shown that the order of magnitude of this game theory bound is tight.     

The quantum Gaudin system

In this paper, we explicitly construct the quantum $\mathfrak{g}\mathfrak{l}_n $ Gaudin model for general n and for a general number N of particles. To this end, we construct a commutative family in $U(\mathfrak{g}\mathfrak{l}_n )^{ \otimes N} $ . When passing to the classical limit (which is the projection onto the associated graded algebra), our family gives the entire family of classical Gaudin Hamiltonians. The construction is based on the special limit of the Bethe subalgebra in the Yangian $Y(\mathfrak{g}\mathfrak{l}_n )$ .     

Extreme instability of the horocycle flow

Let g be aC ³ negatively curved Riemannian metric on a compact connected orientable surfaceS. LetB be the collection of all metrics resulting from sufficiently small conformal changes of the metricg. (1) Then there is a constantA > 0 such that ifB then the \(\bar d\) distance between the horocycle flow? _t (Margulis parametrization) of (S, ?) and the rescaled horocycle flowh _ct of (S, g) is at leastA (?c > 0). No other dynamical system is known to have such extreme instability. (2) Fix ε > 0. Then there is anN > 0 so that if we are given samples {ξ} ₀ ^N {η} ₀ ^N which arose from the horocycle flows corresponding to two of the metrics?, g ∈B, then either the two samples are \(\bar d\) farther thanA/2 apart or the two surfaces are closer than ε. This holds even if these samples are slightly inaccurate.     

Limiting Behavior of High Order Correlations for Simple Random Sampling

For ${N = 1, 2,\ldots,}$ let S _N be a simple random sample of size n = n _N from a population A _N of size N, where ${0 \leq n \leq N}$ . Then with f _N =  n/N, the sampling fraction, and 1 _A the inclusion indicator that ${A \in S_N}$ , for any ${H \subset A_N}$ of size ${k \geq 0}$ , the high order correlations $${\rm Corr}(k) = E \big(\mathop{\Pi}\limits_{A \in H} ({\bf 1}_A - f_N )\big)$$ depend only on k, and if the sampling fraction ${f_N \rightarrow f}$ as ${N \rightarrow \infty}$ , then $$N^{k/2}{\rm Corr}(k) \rightarrow [f (f - 1)]^{k/2}EZ^{k}, k \,{\rm even}$$ and $$N^{(k+1)/2}{\rm Corr}(k) \rightarrow [f (f - 1)]^{(k-1)/2}(2f - 1)\frac{1}{3}(k - 1)EZ^{k+1}, k \,{\rm odd}$$ where Z is a standard normal random variable. This proves a conjecture given in [2].     

Complex random energy model: zeros and fluctuations

The partition function of the random energy model at inverse temperature $\beta $ is a sum of random exponentials $ \mathcal{Z }_N(\beta )=\sum _{k=1}^N \exp (\beta \sqrt{n} X_k)$ , where $X_1,X_2,\ldots $ are independent real standard normal random variables (=random energies), and $n=\log N$ . We study the large N limit of the partition function viewed as an analytic function of the complex variable $\beta $ . We identify the asymptotic structure of complex zeros of the partition function confirming and extending predictions made in the theoretical physics literature. We prove limit theorems for the random partition function at complex $\beta $ , both on the logarithmic scale and on the level of limiting distributions. Our results cover also the case of the sums of independent identically distributed random exponentials with any given correlations between the real and imaginary parts of the random exponent.     

A concentration inequality and a local law for the sum of two random matrices

Let ${H_{N}=A_{N}+U_{N}B_{N}U_{N}^{\ast}}$ where A _N and B _N are two N-by-N Hermitian matrices and U _N is a Haar-distributed random unitary matrix, and let ${\mu _{H_{N}},}$ ${\mu_{A_{N}}, \mu _{B_{N}}}$ be empirical measures of eigenvalues of matrices H _N , A _N , and B _N , respectively. Then, it is known (see Pastur and Vasilchuk in Commun Math Phys 214:249?C286, 2000) that for large N, the measure ${\mu _{H_{N}}}$ is close to the free convolution of measures ${\mu _{A_{N}}}$ and ${\mu _{B_{N}}}$ , where the free convolution is a non-linear operation on probability measures. The large deviations of the cumulative distribution function of ${\mu _{H_{N}}}$ from its expectation have been studied by Chatterjee (J Funct Anal 245:379?C389, 2007). In this paper we improve Chatterjee??s concentration inequality and show that it holds with the rate which is quadratic in N. In addition, we prove a local law for eigenvalues of ${H_{N_{N}},}$ by showing that the normalized number of eigenvalues in an interval approaches the density of the free convolution of??? _A and??? _B provided that the interval has width (log N)^?1/2.