Lexicographic generation of projective spaces

Lexicographic or first choice constructions of geometric objects sometimes lead to amazingly good results. Usually it is difficult to determine the precise identity of the resulting geometries. Here we find infinitely many cases where the identification actually can be accomplished.     

Memoryless near-collisions via coding theory

We investigate generic methods to find near-collisions in cryptographic hash functions. We introduce a new generic approach based on methods to find cycles in the space of codewords of a code with low covering radius. We give an analysis of our approach and demonstrate it on the SHA-3 candidate TIB3.     

Flight gate scheduling with respect to a reference schedule

This paper considers the problem of assigning flights to airport gates. We examine the general case in which an aircraft serving a flight may be assigned to different gates for arrival and departure processing and for optional intermediate parking. Restrictions to this assignment include gate closures and shadow restrictions, i.e., the situation where certain gate assignments may cause blocking of neighboring gates. The objectives include maximization of the total assignment preference score, a minimal number of unassigned flights during overload periods, minimization of the number of tows, maximization of a robustness measure as well as a minimal deviation from a given reference schedule. We show that in case of a one period time horizon this objective can easily be integrated into our existing model based on the Clique Partitioning Problem. Furthermore we present a heuristic algorithm to solve the problem for multiple periods.     

On a conjecture of Erdos and Stewart

For any , let be the th prime number. In this paper, we confirm a conjecture of Erdos and Stewart concerning all the solutions of the diophantine equation , when .

     

Geometrical methods for analyzing the optimal management of tipping point dynamics

Natural resources are not infinitely resilient and should not be modeled as being such. Finitely resilient resources feature tipping points and history dependence. This paper provides a didactical discussion of mathematical methods that are needed to understand the optimal management of such resources: viscosity solutions of Hamilton–Jacobi–Bellman equations, the costate equation and the associated canonical equations, exact root counting, and geometrical methods to analyze the geometry of the invariant manifolds of the canonical equations. Recommendations for Resource Managers

• Management of natural resources has to take into account the possible breakdown of resilience and induced regime shifts.
• Depending on the characteristics of the resource and on its present and future economic importance, either for all initial states the same kind of management policy is optimal, or the type of the optimal management policy depends on the initial state.
• Modeling should reflect the finiteness of the data.

     

On cyclic compositions of positive integers

Say that two compositions of n into k parts are related if they differ only by a cyclic shift. This defines an equivalence relation on the set of such compositions. Let ${\left\langle \begin{array}{c}n \\ k\end{array} \right\rangle}$ denote the number of distinct corresponding equivalence classes, that is, the number of cyclic compositions of n into k parts. We show that the sequence ${\left\langle\begin{array}{c}n \\ k\end{array}\right\rangle}$ is log-concave and prove some results concerning ${\left\langle \begin{array}{c}n \\ k \end{array} \right\rangle}$ modulo two.     

A class of quasi-variational inequalities for adaptive image denoising and decomposition

We introduce a class of adaptive non-smooth convex variational problems for image denoising in terms of a common data fitting term and a support functional as regularizer. Adaptivity is modeled by a set-valued mapping with closed, compact and convex values, that defines and steers the regularizer depending on the variational solution. This extension gives rise to a class of quasi-variational inequalities. We provide sufficient conditions for the existence of fixed points as solutions, and an algorithm based on solving a sequence of variational problems. Denoising experiments with spatial and spatio-temporal image data and an adaptive total variation regularizer illustrate our approach.     

A Discrete Element Approach for Wave Propagation in Thin Rods

Wave propagation and evoked side effects, such as material failure, are important parts of analysis of dynamically exposed structures like buildings or machinery. One of the numerical analysis tools for wave propagation is the well-known Finite Element Method (FEM) with its impressive performance but also with the drawback of not being able to model easily material failure, discontinuities and contacts. In contrast, the Discrete Element Method (DEM) is capable to describe these effects on a meso-scale more easily. The here selected concept is based on a DEM particle which is considered as deformable, and can establish and remove lasting bonds with other particles. The simulation example used is a thin rod that has been an extensive numerical and experimental research subject since the last century. A longitudinal wave is excited within the thin rod by simulating an impact on one end of the rod in a free-free configuration. It is found, that the simulation data, the velocity profile and the resulting displacement at the end of the rod, are in good agreement with experimental obtained data. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)