Compact pseudo-Riemannian manifolds with parallel Weyl tensor

It is shown that in every dimension n = 3j + 2, j = 1, 2, 3, . . ., there exist compact pseudo-Riemannian manifolds with parallel Weyl tensor, which are Ricci-recurrent, but neither conformally flat nor locally symmetric, and represent all indefinite metric signatures. The manifolds in question are diffeomorphic to nontrivial torus bundles over the circle. They all arise from a construction that a priori yields bundles over the circle, having as the fibre either a torus, or a 2-step nilmanifold with a complete flat torsionfree connection; our argument only realizes the torus case.     

Elementary symmetric polynomials in Shamir's scheme

The concept of k-admissible tracks in Shamir's secret sharing scheme over a finite field was introduced by Schinzel et al. (2009) [10]. Using some estimates for the elementary symmetric polynomials, we show that the track (1,…,n) over Fp is practically always k-admissible; i.e., the scheme allows to place the secret as an arbitrary coefficient of its generic polynomial even for relatively small p. Here k is the threshold and n the number of shareholders.     

A constructive approach to examination timetabling based on adaptive decomposition and ordering

In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set in the construction process. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. Initially, the examinations are placed into the easy set. During the construction process, examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment in subsequent attempts. On the other hand, the examinations that can be scheduled remain in the easy set. Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. The proposed approach, which incorporates different ordering and shuffling strategies, is explored on the Carter benchmark problems. The empirical results show that the performance of our algorithm is broadly comparable to existing constructive approaches.     

On variable discounting in dynamic programming: applications to resource extraction and other economic models

This paper generalizes the classical discounted utility model introduced in Samuelson (Rev. Econ. Stud. 4:155–161, 1937) by replacing a constant discount rate with a function. The existence of recursive utilities and their constructions are based on Matkowski’s extension of the Banach Contraction Principle. The derived utilities go beyond the class of recursive utilities studied in the literature and enable a discussion on subtle issues concerning time preferences in the theory of finance, economics or psychology. Moreover, our main results are applied to the theory of optimal economic growth related with resource extraction models with unbounded utility function of consumption.     

On measurable multifunctions in countably separated spaces

We use an idea of countable separability of points and sets in topological spaces to prove results on intersection of measurable multifunctions and an implicit function theorem. We generalize or extend in part some well known Himmelberg's theorems.     

Every triangle-free planar graph has a planar upward drawing

A planar ordered set has a triangle-free, planar covering graph; on the other hand, there are nonplanar ordered sets whose covering graphs are planar. We show thatevery triangle-free planar graph has a planar upward drawing. This planar upward drawing can be constructed in time, polynomial in the number of vertices.Our results shed light on the apparently difficult problem, of long-standing, whether there is aneffective planarity-testing procedure for an ordered set.Supported in part by the Alexander von Humboldt Stiftung.Supported in part by the Deutsche Forschungsgemeinschaft.     

Towards Martins minimum

We show that it is consistent with MA + ?CH that the Forcing Axiom fails for all forcing notions in the class of ω^ω–bounding forcing notions with norms of [17]. Received: 28 April 1999 / Published online: 12 December 2001     

Good and viscosity solutions of fully nonlinear elliptic equations

We introduce the notion of a ``good" solution of a fully nonlinear uniformly elliptic equation. It is proven that ``good" solutions are equivalent to -viscosity solutions of such equations. The main contribution of the paper is an explicit construction of elliptic equations with strong solutions that approximate any given fully nonlinear uniformly elliptic equation and its -viscosity solution. The results also extend some results about ``good" solutions of linear equations.