Nonlinear Free Boundary Problems with Singular Source Terms

We prove the existence of solutions to nonlinear free boundary problem with singularities at given points.     

On the Long-Time Behavior of the Quantum Fokker-Planck Equation

We analyze the long-time behavior of transport equations for a class of dissipative quantum systems with Fokker-planck type diffusion operator, subject to confining potentials of harmonic oscillator type. We establish the existence and uniqueness of a non-equilibrium steady state for the corresponding dynamics. Further, using a (classical) convex Sobolev inequality, we prove an optimal exponential rate of decay towards this state and additionally give precise dispersion estimates in those cases, where no stationary state exists.     

On the Exceptional Set of Goldbach’s Problem in Short Intervals

Denote by E[X,X+H] the set of even integers in [X,X+H] that are not a sum of two primes (i.e. that are not Goldbach numbers). Here we prove that there exists a (small) positive constant H 3 X ^[7/24]+7dH\ge X^{\,{7\over24}+7\delta} we have |E(X,H) | << H^1-d/600\vert E(X,H) \vert \ll H^{1-\delta/600} .     

Carousels,Zindler curves and the floating body problem

A carousel is a dynamical system that describes the movement of an equilateral linkage in which the midpoint of each rod travels parallel to it. They are closely related to the floating body problem. We prove, using the work of Auerbach, that any figure that floats in equilibrium in every position is drawn by a carousel. Of special interest are such figures with rational perimetral density of the floating chords, which are then drawn by carousels. In particular, we prove that for some perimetral densities the only such figure is the circle, as the problem suggests.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

Constructions of economic functions and calculations of marginal rates in DEA using parametric optimization methods

The aim of the paper is to present and substantiate a technique to visualize DEA modelling results without any loss of mathematical rigour. The proposed family of parametric optimization methods allows one to construct an intersection of the multidimensional frontier with a two-dimensional plane determined by any pair of given directions. This approach reduces the efficiency analysis of production units to the investigation of well-known functions in economics. We also propose constructive methods to calculate marginal rates of substitution, marginal rates of transformation and so on.