Kinetic Models for Chemotaxis and their Drift-Diffusion Limits

Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal     

Bounded Positive Solutions of Schrödinger Equations in Two-Dimensional Exterior Domains

We prove under quite general assumptions the existence of a bounded positive solution to the semilinear Schrödinger equation in a two-dimensional exterior domain.     

On a Definitizable Analog of the Trigonometric Moment Problem Generating an Indefinite Toeplitz Form

We prove the existence of an integro-polynomial representation for a sequence of numbers such that there exists a difference operator mapping this sequence to a sequence that generates the solvable trigonometric moment problem. A similar result related to the power moment problem was given in [12].     

Pseudorandom properties of prime factors

In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

Pure Skew Lattices in Rings

Given a ring $R$, let $S\subseteq R$ be a pure multiplicative band that is closed under the cubic join operation $x\nabla y = x+y+yx-xyx-yxy.$ We show that $\left( S,\cdot,\nabla\right) $ forms a pure skew lattice if and only if $S$ satisfies the polynomial identity $\left(xy-yx\right)^{2}z = z\left(xy-yx\right)^{2}$. We also examine properties of pure skew lattices in rings.     

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.