Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.     

CERES in higher-order logic

We define a generalization of the first-order cut-elimination method CERES to higher-order logic. At the core of lies the computation of an (unsatisfiable) set of sequents (the characteristic sequent set) from a proof π of a sequent S. A refutation of in a higher-order resolution calculus can be used to transform cut-free parts of π (the proof projections) into a cut-free proof of S. An example illustrates the method and shows that can produce meaningful cut-free proofs in mathematics that traditional cut-elimination methods cannot reach.     

Coding and Counting Arrangements of Pseudolines

Arrangements of lines and pseudolines are important and appealing objects for research in discrete and computational geometry. We show that there are at most 2^{0.657> n2}2^{0.657\> n^{2}} simple arrangements of n pseudolines in the plane. This improves on previous work by Knuth who proved an upper bound of 3^\binomn2 @ 2^{0.792> n2}3^{\binom{n}{2}} \cong 2^{0.792\> n^{2}} in 1992 and the first author, who obtained 2^{0.697> n2}2^{0.697\> n^{2}} in 1997. The argument uses surprisingly little geometry. The main ingredient is a lemma that was already central to the argument given by Knuth.     

Commutability of homogenization and linearization at identity in finite elasticity and applications

We prove under some general assumptions on elastic energy densities (namely, frame indifference, minimality at identity, non-degeneracy and existence of a quadratic expansion at identity) that homogenization and linearization commute at identity. This generalizes a recent result by S. Müller and the second author by dropping their assumption of periodicity. As a first application, we extend their Γ-convergence commutation diagram for linearization and homogenization to the stochastic setting under standard growth conditions. As a second application, we prove that the Γ-closure is local at identity for this class of energy densities.     

Determination of open boundary conditions for computational fluid dynamics (CFD) from interior observations

An optimization approach for the determination of open boundary conditions for Computational Fluid Dynamics is introduced, whereas the error between the solution σ and interior observations ω is minimized. The numerical weather prediction (NWP) model ALADIN–Austria provides data of wind speed and wind direction at virtual weather stations within the area of interest. Also, data from real weather stations and other sources can be incorporated into the model, respectively. In this work, the optimization method is applied to the constant density Navier–Stokes Equations. Thereby, for stabilizing the ill-posed pseudo inverse problem several regularization methods are reviewed. Further, numerical studies are carried out to identify the supreme regularization method for the presented application. Finally, the algorithm is applied to the micro- and meso-scale flow over the Grimming mountain, Austria. The results are compared with real weather station data and show suitable correlation with the measurements.     

A relation-algebraic approach to simple games

Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them. In particular, we test certain fundamental properties of simple games and compute specific players and coalitions. We also apply relation algebra to determine power indices. This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool Rel View after a simple translation into the tool’s programming language. In order to demonstrate the visualization facilities of Rel View we consider an example of the Catalonian Parliament after the 2003 election.     

Pseudodifferential Operators Approach to Singular Integral Operators in Weighted Variable Exponent Lebesgue Spaces on Carleson Curves

The main results of the paper are: (1) The boundedness of singular integral operators in the variable exponent Lebesgue spaces L ^p(·)(Γ, w) on a class of composed Carleson curves Γ where the weights w have a finite set of oscillating singularities. The proof of this result is based on the boundedness of Mellin pseudodifferential operators on the spaces L^p(·)(\mathbbR ₊,dm){L^{p(\cdot )}(\mathbb{R} _{+},d\mu)} where dμ is an invariant measure on multiplicative group ${\mathbb{R}_{+}=\left\{r\in \mathbb{R}:r >0 \right\}}${\mathbb{R}_{+}=\left\{r\in \mathbb{R}:r >0 \right\}}. (2) Criterion of local invertibility of singular integral operators with piecewise slowly oscillating coefficients acting on L ^p(·)(Γ, w) spaces. We obtain this criterion from the corresponding criteria of local invertibility at the point 0 of Mellin pseudodifferential operators on \mathbbR₊{\mathbb{R}_{+}} and local invertibility of singular integral operators on \mathbbR{\mathbb{R}}. (3) Criterion of Fredholmness of singular integral operators in the variable exponent Lebesgue spaces L ^p(·)(Γ, w) where Γ belongs to a class of composed Carleson curves slowly oscillating at the nodes, and the weight w has a finite set of slowly oscillating singularities.     

Continuous Blooming of Convex Polyhedra

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.     

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficiently large set of points in the plane contains ℓ collinear points or an empty pentagon. As an application, we settle the next open case of the “big line or big clique” conjecture of Kára, Pór, and Wood [Discrete Comput. Geom. 34(3):497–506, 2005].