A large deviation principle for 2D stochastic Navier–Stokes equation

In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.     

A non-isothermal Ginzburg–Landau model in superconductivity: Existence,uniqueness and asymptotic behaviour

In this paper we study a Ginzburg–Landau model which describes the behaviour of a superconducting material including thermal effects. We extend the traditional formulation of the problem, by introducing the temperature as an additional state variable. Accordingly, together with the Gor’kov–Eliashberg system, we introduce an evolution equation for the absolute temperature. We examine in detail the case which allows only variations of the concentration of superconducting electrons and of the temperature, neglecting the electromagnetic field. For this problem existence and uniqueness of the solution are shown. Finally we analyze the asymptotic behaviour of the solutions, proving that the system possesses a global attractor.     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.     

Second order evolution equations with time-dependent subdifferentials

We study an abstract second order nonlinear evolution equation in a real Hilbert space. We consider time-dependent convex functions and their subdifferentials operating on the first derivative of the unknown function. Introducing appropriate assumptions on the convex functions and other data, we prove the existence and uniqueness of a strong solution, and give some applications of the abstract theorem to hyperbolic variational inequalities with time-dependent constraints.      

Global existence and asymptotic behavior of classical solutions of quasilinear hyperbolic systems with linearly degenerate characteristic fields

In this paper, we study the global existence and the asymptotic behavior of classical solution of the Cauchy problem for quasilinear hyperbolic system with constant multiple and linearly degenerate characteristic fields. We prove that the global C¹ solution exists uniquely if the BV norm of the initial data is sufficiently small. Based on the existence result on the global classical solution, we show that, when the time t tends to the infinity, the solution approaches a combination of C¹ traveling wave solutions. Finally, we give an application to the equation for time-like extremal surfaces in the Minkowski space-time R1+n.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.     

An explosion point space without the fixed point property

In 1988 A. Gutek proved that there exist one-point connectifications of hereditarily disconnected spaces that do not have the fixed point property. We improve on this result by constructing a one-point connectification of a totally disconnected space without the fixed point property.     

单谐振腔外部Q值的计算方法

 通过对带有耦合器的单驻波腔进行等效电路分析，推导出可计算带有耦合波导的单谐振腔外部Q值的反射相位法，该方法通过计算不同频率的反射相位来确定谐振频率和外部Q值。详细叙述了在CST Microwave Studio中用谐振模式求解法、直接时域跟踪法和反射相位法进行计算的步骤；用这3种方法分别计算了二次发射微波电子枪的外部Q值并和实验测量结果做了比较。结果显示3种计算方法都有很高的精度,但反射相位法的速度最快，耗时1 071 s。计算发现外部Q值与耦合口长度的4.1次方成反比。     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Markov processes associated with L p -resolvents and applications to stochastic differential equations on Hilbert space

We give general conditions on a generator of a C₀-semigroup (resp. of a C₀-resolvent) on L^p(E,μ), p ≥ 1, where E is an arbitrary (Lusin) topological space and μ a σ-finite measure on its Borel σ-algebra, so that it generates a sufficiently regular Markov process on E. We present a general method how these conditions can be checked in many situations. Applications to solve stochastic differential equations on Hilbert space in the sense of a martingale problem are given. Dedicated to Giuseppe Da Prato on the occasion of his 70th birthday