Regularization of some linear ill-posed problems with discretized random noisy data

For linear statistical ill-posed problems in Hilbert spaces we introduce an adaptive procedure to recover the unknown solution from indirect discrete and noisy data. This procedure is shown to be order optimal for a large class of problems. Smoothness of the solution is measured in terms of general source conditions. The concept of operator monotone functions turns out to be an important tool for the analysis.

     

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ɛ in time polynomial in the problem size and in 1/ɛ. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) production and backlogging cost functions. We omit concavity and convexity restrictions. Furthermore, we take advantage of a straightforward dynamic programming algorithm applied to a rounded problem.     

Schur rings over a Galois ring of odd characteristic

It is proved that any Schur ring over a Galois ring of odd characteristic is either normal, or of rank 2, or a non-trivial generalized wreath product. The normal Schur rings are characterized as a special subclass of the cyclotomic Schur rings.     

Tight contact structures on solid tori

In this paper we study properties of tight contact structures on solid tori. In particular we discuss ways of distinguishing two solid tori with tight contact structures. We also give examples of unusual tight contact structures on solid tori.

We prove the existence of a -valued and a -valued invariant of a closed solid torus. We call them the self-linking number and the rotation number respectively. We then extend these definitions to the case of an open solid torus. We show that these invariants exhibit certain monotonicity properties with respect to inclusion. We also prove a number of results which give sufficient conditions for two solid tori to be contactomorphic.

At the same time we discuss various ways of constructing a tight contact structure on a solid torus. We then produce examples of solid tori with tight contact structures and calculate self-linking and rotation numbers for these tori. These examples show that the invariants we defined do not give a complete classification of tight contact structure on open solid tori.

At the end, we construct a family of tight contact structure on a solid torus such that the induced contact structure on a finite-sheeted cover of that solid torus is no longer tight. This answers negatively a question asked by Eliashberg in 1990. We also give an example of tight contact structure on an open solid torus which cannot be contactly embedded into a sphere with the standard contact structure, another example of unexpected behavior.

     

Perturbed Markov Chains with Damping Component

The paper is devoted to studies of regularly and singularly perturbed Markov chains with damping component. In such models, a matrix of transition probabilities is regularised by adding a special damping matrix multiplied by a small damping (perturbation) parameter ε. We perform a detailed perturbation analysis for such Markov chains, particularly, give effective upper bounds for the rate of approximation for stationary distributions of unperturbed Markov chains by stationary distributions of perturbed Markov chains with regularised matrices of transition probabilities, asymptotic expansions for approximating stationary distributions with respect to damping parameter, explicit coupling type upper bounds for the rate of convergence in ergodic theorems for n-step transition probabilities, as well as ergodic theorems in triangular array mode.

     

Numerical differentiation from a viewpoint of regularization theory

In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.

     

Regularized collocation method for Fredholm integral equations of the first kind

In this paper we consider a collocation method for solving Fredholm integral equations of the first kind, which is known to be an ill-posed problem. An “unregularized” use of this method can give reliable results in the case when the rate at which smallest singular values of the collocation matrices decrease is known a priori. In this case the number of collocation points plays the role of a regularization parameter. If the a priori information mentioned above is not available, then a combination of collocation with Tikhonov regularization can be the method of choice. We analyze such regularized collocation in a rather general setting, when a solution smoothness is given as a source condition with an operator monotone index function. This setting covers all types of smoothness studied so far in the theory of Tikhonov regularization. One more issue discussed in this paper is an a posteriori choice of the regularization parameter, which allows us to reach an optimal order of accuracy for deterministic noise model without any knowledge of solution smoothness.     

The universal torsion-free image of a group

We show that the universal torsion free homomorphic image of any group given by a sufficiently ‘small’ presentation is locally indicable, and give an application to a conjecture of Levin about equations over torsion free groups. Supported by SERC Visiting Fellowship GR/F 97355.     

A New Look at the Burnside-Schur Theorem

The famous Burnside–Schur theorem states that every primitivefinite permutation group containing a regular cyclic subgroupis either 2-transitive or isomorphic to a subgroup of a 1-dimensionalaffine group of prime degree. It is known that this theoremcan be expressed as a statement on Schur rings over a finitecyclic group. Generalizing the latter, Schur rings are introducedover a finite commutative ring, and an analogue of this statementis proved for them. Also, the finite local commutative ringsare characterized in permutation group terms. 2000 MathematicsSubject Classification 20B10, 20B15, 05E99.     

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

n -vertex edge coloured graphs with multiplicity of Jordan blocks bounded by k can be done in time . Received: November 29, 1994