Search

We study the structure and rigidity properties of von Neumann algebras. We provide several applications of Shlyakhtenko's operator-valued semicircular construction, including some characterization of property (T) and Haagerup’s approximation property, and the structure of bimodules of existentially closed II$_1$ factors. We also discuss existentially closed inclusions for non-Gamma II$_1$ factors.

Coupling Weyl quasiparticles and charge density waves (CDWs) can lead to fascinating band renormalization and many-body effects beyond band folding and Peierls gaps. For the quasi-one-dimensional chiral compound (TaSe4)2I with an incommensurate CDW transition at TC = 263 K, photoemission mappings thus far are intriguing due to suppressed emission near the Fermi level. Models for this unconventional behavior include axion insulator phases, correlation pseudogaps, polaron subbands, bipolaron bound states, etc. Our photoemission measurements show sharp quasiparticle bands crossing the Fermi level at T > TC, but for T < TC, these bands retain their dispersions with no Peierls or axion gaps at the Weyl points. Instead, occupied band edges recede from the Fermi level, opening a spectral gap. Our results confirm localization of quasiparticles (holes created by photoemission) is the key physics, which suppresses spectral weights over an energy window governed by incommensurate modulation and inherent phase defects of CDW.

We establish a tunneling formula for a Schrödinger operator with symmetric double-well potential and homogeneous magnetic field, in dimension two. Each well is assumed to be radially symmetric and compactly supported. We obtain an asymptotic formula for the difference between the two first eigenvalues of this operator, that is exponentially small in the semiclassical limit.

We establish a tunneling formula for a Schrödinger operator with symmetric double-well potential and homogeneous magnetic field, in dimension two. Each well is assumed to be radially symmetric and compactly supported. We obtain an asymptotic formula for the difference between the two first eigenvalues of this operator, that is exponentially small in the semiclassical limit.

We calculated the one- (OPA) and two-photon absorption (TPA) spectra of two large water-soluble stilbene derivatives presenting TPA cross sections of about 400 GM. However, the reported experimental TPA spectra present a spectral gap region, and a theoretical study of these promising molecules seems now timely and relevant. These molecules are composed of 200 or more atoms, becoming a challenge to obtain the TPA spectra even using density functional theory at the time-dependent quadratic response formalism. Thus, both OPA and TPA were also calculated using the INDO-S semi-empirical method. We used explicit solvent molecules using the sequential-quantum mechanics/molecular mechanics to include the solvent effects. Our results show that different transitions are participating in the OPA and TPA processes and that exchange-correlation functionals, including larger Hartree-Fock contributions, provide a better description of the OPA spectra; however, the opposite trend is observed on the TPA spectra. Alternatively, INDO-S/CISD, including contributions from single and double excitations, systematically describes both OPA and TPA bands with similar shifts and better reproduces the relative intensities of the two TPA bands compared to the experimental ones. The OPA spectra are characterized by a Highest Occupied Molecular Orbital-Lowest Unoccupied Molecular Orbital (HOMO-LUMO) excitation, while the low-energy TPA band is ascribed to a single transition encompassing the (HOMO-1)-LUMO and HOMO-(LUMO+1) excitations and the high-energy one is a combination of several transitions. Thus, although more studies are required to better assess the capability of the INDO-S/CISD method in describing the TPA spectra of large molecules, our results corroborate that it is a promising alternative.

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its vertex-Cheeger constant. We also prove an analogous result for a large class of irregular graphs, obtained as spanning subgraphs of vertex-transitive graphs. Using a result of Babai, we obtain a lower bound for the smallest eigenvalue of the normalised adjacency operator of a vertex-transitive graph in terms of its diameter and its degree.

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its vertex-Cheeger constant. We also prove an analogous result for a large class of irregular graphs, obtained as spanning subgraphs of vertex-transitive graphs. Using a result of Babai, we obtain a lower bound for the smallest eigenvalue of the normalised adjacency operator of a vertex-transitive graph in terms of its diameter and its degree.

Discrete lattice models are a cornerstone of quantum many-body physics. They arise as effective descriptions of condensed-matter systems and lattice-regularized quantum field theories. Lieb-Robinson bounds imply that if the degrees of freedom at each lattice site only interact locally with each other, correlations can only propagate with a finite group velocity through the lattice, similarly to a light cone in relativistic systems. Here we show that Lieb-Robinson bounds are equivalent to the locality of the interactions: a system with k-body interactions fulfills Lieb-Robinson bounds in exponential form if and only if the underlying interactions decay exponentially in space. In particular, our result already follows from the behavior of two-point correlation functions for single-site observables and generalizes to different decay behaviors as well as fermionic lattice models. As a side result, we thus find that Lieb-Robinson bounds for single-site observables imply Lieb-Robinson bounds for bounded observables with arbitrary support.

Discrete lattice models are a cornerstone of quantum many-body physics. They arise as effective descriptions of condensed-matter systems and lattice-regularized quantum field theories. Lieb-Robinson bounds imply that if the degrees of freedom at each lattice site only interact locally with each other, correlations can only propagate with a finite group velocity through the lattice, similarly to a light cone in relativistic systems. Here we show that Lieb-Robinson bounds are equivalent to the locality of the interactions: a system with k-body interactions fulfills Lieb-Robinson bounds in exponential form if and only if the underlying interactions decay exponentially in space. In particular, our result already follows from the behavior of two-point correlation functions for single-site observables and generalizes to different decay behaviors as well as fermionic lattice models. As a side result, we thus find that Lieb-Robinson bounds for single-site observables imply Lieb-Robinson bounds for bounded observables with arbitrary support.

In this thesis, we analyse the spectrum of the generator of the one-dimensional Zig-Zag process defined on the torus $\mathbb{T}$. This is a piecewise deterministic Markov process (PDMP) used in Monte Carlo Markov chain methods (MCMC) for sampling from a probability distribution and calculating integrals \cite{Rejectionfree}, \cite{ZigZag}, \cite{Bouncy}. We show for Lipschitz potentials $U$ and bounded refreshment rates $\lambda_0 \in L^{\infty}(\mathbb{T})$ that the spectral gap $\kappa = \sup\{\operatorname{Re} \lambda : \lambda \in \sigma(\mathcal{L})\} \setminus \{0 \}$ of the associated $J$-self-adjoint generator $\mathcal{L}$ on $L^2(\mathbb{T} ,\nu)$ and $C(\mathbb{T} \times \{+1,-1\})$ is positive. Moreover, we give two lower bounds for $\kappa$ by making use of one of the Schur complements associated with a block operator that is unitarily equivalent to $\mathcal{L}$. In addition we show that the spectrum of $L^2(\mathbb{T} ,\nu)$ and $C(\mathbb{T} \times \{+1,-1\})$ are the same and that the generator defined on both spaces generates a contraction semigroup. Under the assumption of unimodality of the potential $U$ and a zero refreshment rate, we show that a vertical "asymptotic line" exists to which all of the eigenvalues converge. Furthermore, we show that a spectral mapping theorem exists where, due to the spectral line, the spectrum of the semigroup can become uncountable or countable depending on the time parameter of the semigroup $P(t)$ generated by $\mathcal{L}$. Lastly, we show that a discretisation of the spectrum generates a semigroup that converges uniformly on each bounded time interval to the semigroup of the Zig-Zag process and we use these discretisations to numerically analyse the behaviour of general potentials and refreshment rates., Applied Mathematics

In this thesis, we analyse the spectrum of the generator of the one-dimensional Zig-Zag process defined on the torus $\mathbb{T}$. This is a piecewise deterministic Markov process (PDMP) used in Monte Carlo Markov chain methods (MCMC) for sampling from a probability distribution and calculating integrals \cite{Rejectionfree}, \cite{ZigZag}, \cite{Bouncy}. We show for Lipschitz potentials $U$ and bounded refreshment rates $\lambda_0 \in L^{\infty}(\mathbb{T})$ that the spectral gap $\kappa = \sup\{\operatorname{Re} \lambda : \lambda \in \sigma(\mathcal{L})\} \setminus \{0 \}$ of the associated $J$-self-adjoint generator $\mathcal{L}$ on $L^2(\mathbb{T} ,\nu)$ and $C(\mathbb{T} \times \{+1,-1\})$ is positive. Moreover, we give two lower bounds for $\kappa$ by making use of one of the Schur complements associated with a block operator that is unitarily equivalent to $\mathcal{L}$. In addition we show that the spectrum of $L^2(\mathbb{T} ,\nu)$ and $C(\mathbb{T} \times \{+1,-1\})$ are the same and that the generator defined on both spaces generates a contraction semigroup. Under the assumption of unimodality of the potential $U$ and a zero refreshment rate, we show that a vertical "asymptotic line" exists to which all of the eigenvalues converge. Furthermore, we show that a spectral mapping theorem exists where, due to the spectral line, the spectrum of the semigroup can become uncountable or countable depending on the time parameter of the semigroup $P(t)$ generated by $\mathcal{L}$. Lastly, we show that a discretisation of the spectrum generates a semigroup that converges uniformly on each bounded time interval to the semigroup of the Zig-Zag process and we use these discretisations to numerically analyse the behaviour of general potentials and refreshment rates., Applied Mathematics

Assume that two metric graphs are joined by gluing a few vertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our results by considering explicit examples.

Relativistic models in quantum mechanics have attracted a lot of attention in recent years, for instance, because of their applications to the study of graphene. In this work, we review the main tools to formulate confining models in a rigorous mathematical way and investigate their spectral properties. In particular, we study the spectral gap of the 2D and 3D massless Dirac operators with certain boundary conditions defined in bounded domains. In the two-dimensional case, we give a new proof for a known lower bound of the spectral gap which only depends on the area of the domain. Also, as a new contribution, we find bounds for the massive case. For the three-dimensional case, we show that for convex bounded domains 0 is not in the spectrum of the operator and give a lower bound of the spectral gap in terms of the lowest eigenvalue of a much simpler PDE.

We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logconcave density proportional to e^{-f} where f:R^d -> R is mu-strongly convex and L-smooth (the condition number is kappa = L/mu). We show that the relaxation time (inverse of the spectral gap) of ideal HMC is O(kappa), improving on the previous best bound of O(kappa^{1.5}); we complement this with an example where the relaxation time is Omega(kappa). When implemented using a nearly optimal ODE solver, HMC returns an epsilon-approximate point in 2-Wasserstein distance using O~((kappa d)^{0.5} epsilon^{-1}) gradient evaluations per step and O~((kappa d)^{1.5}epsilon^{-1}) total time.

In this article, we continue the discussion of Fang–Wu (2015) to estimate the spectral gap of the Ornstein–Uhlenbeck operator on path space over a Riemannian manifold of pinched Ricci curvature. Along with explicit estimates we study the short-time asymptotics of the spectral gap. The results are then extended to the path space of Riemannian manifolds evolving under a geometric flow. Our paper is strongly motivated by Naber’s recent work (2015) on characterizing bounded Ricci curvature through stochastic analysis on path space.

In this article, we continue the discussion of Fang–Wu (2015) to estimate the spectral gap of the Ornstein–Uhlenbeck operator on path space over a Riemannian manifold of pinched Ricci curvature. Along with explicit estimates we study the short-time asymptotics of the spectral gap. The results are then extended to the path space of Riemannian manifolds evolving under a geometric flow. Our paper is strongly motivated by Naber’s recent work (2015) on characterizing bounded Ricci curvature through stochastic analysis on path space.

An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a "query validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.

This study revisits the height dependence of the wind speed power spectrum from the synoptic scale to the spectral gap. Measurements from cup anemometers and sonics at heights of 15 m to 244 m are used. The measurements are from one land site, one coastal land‐based site and three offshore sites in the mid‐latitudes. There are two new findings. The first finding addresses the diurnal peak in the power spectrum. Our analysis suggests that there are two sources that contribute to the diurnal peak. One is related to surface‐driven processes and another one is related to pressure perturbation from the atmospheric tide. The second finding regards the height dependence of the general spectrum. We describe the dependence through a so‐called effective roughness, which is calculated from wind spectra and represents the energy removal at different frequencies, and thus surface conditions in the footprint areas. The generalizable spectral properties of winds presented herein may prove useful for validating numerical models.

We establish new analytic results for a general class of rational spectral problems. They arise e.g. in modelling photonic crystals whose capability to control the flow of light depends on specific features of the eigenvalues. Our results comprise a complete spectral analysis including variational principles and two-sided bounds for all eigenvalues, as well as numerical implementations. They apply to the eigenvalues between the poles where classical variational principles fail completely. In the application to multi-pole Lorentz models of permittivity functions we show, in particular, that our abstract two-sided eigenvalue estimates are optimal and we derive explicit bounds on the band gap above a Lorentz pole. A high order finite element method (FEM) is used to compute the two-sided bounds for a selection of eigenvalues for several concrete Lorentz models, e.g. polaritonic materials and multi-pole models.

VR 621-2013-4973

In this paper, we propose a new Markov chain which generalizes random-to-random shuffling on permutations to random-to-random shuffling on linear extensions of a finite poset of size $n$. We conjecture that the second largest eigenvalue of the transition matrix is bounded above by $(1+1/n)(1-2/n)$ with equality when the poset is disconnected. This Markov chain provides a way to sample the linear extensions of the poset with a relaxation time bounded above by $n^2/(n+2)$ and a mixing time of $O(n^2 \log n)$. We conjecture that the mixing time is in fact $O(n \log n)$ as for the usual random-to-random shuffling.

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of Laplacians on combinatorial and quantum graph in terms of the edge connectivity, i.e. the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds corresponds to a well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Levy. All proofs are general enough to yield corresponding estimates for the p-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are 'asymptotically correct', i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

We establish new analytic results for a general class of rational spectral problems. They arise e.g. in modelling photonic crystals whose capability to control the flow of light depends on specific features of the eigenvalues. Our results comprise a complete spectral analysis including variational principles and two-sided bounds for all eigenvalues, as well as numerical implementations. They apply to the eigenvalues between the poles where classical variational principles fail completely. In the application to multi-pole Lorentz models of permittivity functions we show, in particular, that our abstract two-sided eigenvalue estimates are optimal and we derive explicit bounds on the band gap above a Lorentz pole. A high order finite element method (FEM) is used to compute the two-sided bounds for a selection of eigenvalues for several concrete Lorentz models, e.g. polaritonic materials and multi-pole models.

Assume that two metric graphs are joined together by gluing fewv ertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our findings by considering explicit examples, VR 621-2013-4973

Assume that two metric graphs are joined together by gluing fewv ertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our findings by considering explicit examples, VR 621-2013-4973

In this paper, we propose a new Markov chain which generalizes random-to-random shuffling on permutations to random-to-random shuffling on linear extensions of a finite poset of size $n$. We conjecture that the second largest eigenvalue of the transition matrix is bounded above by $(1+1/n)(1-2/n)$ with equality when the poset is disconnected. This Markov chain provides a way to sample the linear extensions of the poset with a relaxation time bounded above by $n^2/(n+2)$ and a mixing time of $O(n^2 \log n)$. We conjecture that the mixing time is in fact $O(n \log n)$ as for the usual random-to-random shuffling.

Assume that two metric graphs are joined together by gluing fewv ertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our findings by considering explicit examples, VR 621-2013-4973

Assume that two metric graphs are joined together by gluing fewv ertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our findings by considering explicit examples, VR 621-2013-4973

Assume that two metric graphs are joined together by gluing fewv ertices. We investigate the behaviour of the spectral gap for the corresponding standard Laplacians. It appears that a precise answer can be given in terms of the corresponding Titchmarsh-Weyl (matrix) functions of the two subgraphs, more precisely in terms of their negative spectral subspaces. We illustrate our findings by considering explicit examples, VR 621-2013-4973

We establish new analytic results for a general class of rational spectral problems. They arise e.g. in modelling photonic crystals whose capability to control the flow of light depends on specific features of the eigenvalues. Our results comprise a complete spectral analysis including variational principles and two-sided bounds for all eigenvalues, as well as numerical implementations. They apply to the eigenvalues between the poles where classical variational principles fail completely. In the application to multi-pole Lorentz models of permittivity functions we show, in particular, that our abstract two-sided eigenvalue estimates are optimal and we derive explicit bounds on the band gap above a Lorentz pole. A high order finite element method (FEM) is used to compute the two-sided bounds for a selection of eigenvalues for several concrete Lorentz models, e.g. polaritonic materials and multi-pole models.

We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2^{-s}, (a+1)2^{-s}] x [b2^{-t}, (b+1)2^{-t}] for a,b,s,t nonnegative integers. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n^{4.09}), which implies that the mixing time is at most O(n^{5.09}). We complement this by showing that the relaxation time is at least Omega(n^{1.38}), improving upon the previously best lower bound of Omega(n*log n) coming from the diameter of the chain.

Pathways of diffusion observed in real-world systems often require stochastic processes going beyond first-order Markov models, as implicitly assumed in network theory. In this work, we focus on second-order Markov models, and derive an analytical expression for the effect of memory on the spectral gap and thus, equivalently, on the characteristic time needed for the stochastic process to asymptotically reach equilibrium. Perturbation analysis shows that standard first-order Markov models can either overestimate or underestimate the diffusion rate of flows across the modular structure of a system captured by a second-order Markov network. We test the theoretical predictions on a toy example and on numerical data, and discuss their implications for network theory, in particular in the case of temporal or multiplex networks.

The conditions for synchronization (equivalently, consensus) in linear and nonlinear switching dynamical systems have been extensively studied. In a previous study, we examined the speed of convergence of linear dynamical systems on switching networks in which each snapshot network defining interaction between dynamical elements is a network Laplacian. We showed that temporal dynamics (i.e., switching) of networks slowed down synchronization processes as compared to the case of aggregate dynamics, i.e., synchronization dynamics occurring on the corresponding static network obtained by the aggregation of the temporal network over time. Here we theoretically extend the results in two ways. First, we derive the conditions imposed on the interaction matrices under which the analytical slowing-down results hold true. The condition turns out to be essentially the same as that for the optimal network, which is known as the condition for the fastest local convergence of nonlinear dynamics on networks. Second, we examine the effect of correlation between different snapshots; in actual temporal networks, the same contact tends to be used consecutively in time. We argue that such temporal correlation further slows down temporal dynamics.

The paper gives the following improvement of the Trudinger-Moser inequality: [GRAPHICS] related to the Hardy-Sobolev-Mazya inequality in higher dimensions. We show (0.1) with psi(u) = integral(Omega) V(x)u(2) dx for a class of V > 0 that includes [GRAPHICS] which refines two previously known cases of (0.1) proved by Adimurthi and Druet [2] and by Wang and Ye [23]. In addition, we verify (0.1) for psi(u) = lambda parallel to u parallel to(2)(P), as well as give an analogous improvement for the Onofri-Beckner inequality for the unit disk (Beckner [6]).

The paper gives the following improvement of the Trudinger-Moser inequality: [GRAPHICS] related to the Hardy-Sobolev-Mazya inequality in higher dimensions. We show (0.1) with psi(u) = integral(Omega) V(x)u(2) dx for a class of V > 0 that includes [GRAPHICS] which refines two previously known cases of (0.1) proved by Adimurthi and Druet [2] and by Wang and Ye [23]. In addition, we verify (0.1) for psi(u) = lambda parallel to u parallel to(2)(P), as well as give an analogous improvement for the Onofri-Beckner inequality for the unit disk (Beckner [6]).

The paper gives the following improvement of the Trudinger-Moser inequality: [GRAPHICS] related to the Hardy-Sobolev-Mazya inequality in higher dimensions. We show (0.1) with psi(u) = integral(Omega) V(x)u(2) dx for a class of V > 0 that includes [GRAPHICS] which refines two previously known cases of (0.1) proved by Adimurthi and Druet [2] and by Wang and Ye [23]. In addition, we verify (0.1) for psi(u) = lambda parallel to u parallel to(2)(P), as well as give an analogous improvement for the Onofri-Beckner inequality for the unit disk (Beckner [6]).

We study the spectral gap, i.e. the distance between the two lowest eigenvalues for Laplace operators on metric graphs. A universal lower estimate for the spectral gap is proven and it is shown that it is attained if the graph is formed by just one interval. Uniqueness of the minimizer allows to prove a geometric version of the Ambartsumian theorem derived originally for Schrodinger operators., AuthorCount:2

The paper gives the following improvement of the Trudinger-Moser inequality: [GRAPHICS] related to the Hardy-Sobolev-Mazya inequality in higher dimensions. We show (0.1) with psi(u) = integral(Omega) V(x)u(2) dx for a class of V > 0 that includes [GRAPHICS] which refines two previously known cases of (0.1) proved by Adimurthi and Druet [2] and by Wang and Ye [23]. In addition, we verify (0.1) for psi(u) = lambda parallel to u parallel to(2)(P), as well as give an analogous improvement for the Onofri-Beckner inequality for the unit disk (Beckner [6]).

The paper gives the following improvement of the Trudinger-Moser inequality: [GRAPHICS] related to the Hardy-Sobolev-Mazya inequality in higher dimensions. We show (0.1) with psi(u) = integral(Omega) V(x)u(2) dx for a class of V > 0 that includes [GRAPHICS] which refines two previously known cases of (0.1) proved by Adimurthi and Druet [2] and by Wang and Ye [23]. In addition, we verify (0.1) for psi(u) = lambda parallel to u parallel to(2)(P), as well as give an analogous improvement for the Onofri-Beckner inequality for the unit disk (Beckner [6]).

We prove that singular Schrodinger equations with external magnetic field admit a representation with a positive Lagrangian density whenever their "nonmagnetic" counterpart is nonnegative. In this case the operator has a weighted spectral gap as long as the strength of the magnetic field is not identically zero. We provide estimates of the weight in the spectral gap, including the versions with L (p) -norm and with a magnetic gradient term, and applications to an increase of the best Hardy constant due to the presence of a magnetic field. The paper also shows existence of the ground state for the nonlinear magnetic Schrodinger equation with the periodic magnetic field.

Using Monte Carlo simulations and a domain-wall theory, we discuss the effect of coupling several totally asymmetric simple exclusion processes (TASEPs) to a finite reservoir of particles. This simple model mimics directed biological transport processes in the presence of finite resources such as protein synthesis limited by a finite pool of ribosomes. If all TASEPs have equal length, we find behavior which is analogous to a single TASEP coupled to a finite pool. For the more generic case of chains with different lengths, several unanticipated regimes emerge. A generalized domain-wall theory captures our findings in good agreement with simulation results.

We provide a complete description of the critical threshold phenomenon for the twodimensional localized Euler–Poisson equations, introduced by the authors in [Comm. Math. Phys., 228 (2002), pp. 435–466]. Here, the questions of global regularity vs. finite-time breakdown for the two-dimensional (2D) restricted Euler–Poisson solutions are classified in terms of precise explicit formulae, describing a remarkable variety of critical threshold surfaces of initial configurations. In particular, it is shown that the 2D critical thresholds depend on the relative sizes of three quantities: the initial density, the initial divergence, and the initial spectral gap, that is, the difference between the two eigenvalues of the 2 × 2 initial velocity gradient.