Descriptive properties of families of autohomeomorphisms of the unit interval

Let H⊂C[0,1] stand for the Polish space of all increasing autohomeomorphisms of [0,1]. We show that the family of all strictly singular autohomeomorphisms is -complete. This confirms a suggestion of Graf, Mauldin and Williams. Some related results are also included.     

Descriptive set-theoretical properties of an abstract density operator

Let $ \mathcal{K} $ \mathcal{K} (ℝ) stand for the hyperspace of all nonempty compact sets on the real line and let d ^±(x;E) denote the (right- or left-hand) Lebesgue density of a measurable set E ⊂ ℝ at a point x∈ ℝ. In [3] it was proved that

Trapezoidal and triangular approximations preserving the expected interval

In this paper, an improvement of the nearest trapezoidal approximation operator preserving the expected interval is studied, which is proposed by Grzegorzewski and Mrówka. A formula for computing the improved approximation is presented. Moreover, the nearest triangular approximation operator preserving the expected interval is also investigated.     

Lototsky-Schabl operators on the unit interval

In questo lavoro si studiano versioni uni-dimensionali degli operatori di Lototsky-Schnabl associati a proiezioni di Altomare. Si discutono la conservazione della monotonia, la convessità, le classi di Lipschitz ed il primo modulo di continuità. Si dimostra pure che, in condizioni molto generali, questi operatori convergono, in un senso opportuno, all'operatore classico di Szász, e si danno allo stesso tempo stime dell'ordine di approssimazione. Alcune delle proprietà si dimostrano utilizzando rappresentazioni probabilistiche degli operatori in termini di opportuni processi stocastici.     

On products with the unit interval

We investigate the question which compact convex sets are homeomorphic to their product with the unit interval. We prove it in particular for the space of probability measures on any infinite scattered compact space and for the half-ball of a non-separable Hilbert space equipped with the weak topology. We also show examples of compact spaces for which it is not the case.     

Mixed unit interval graphs

The class of intersection graphs of unit intervals of the real line whose ends may be open or closed is a strict superclass of the well-known class of unit interval graphs. We pose a conjecture concerning characterizations of such mixed unit interval graphs, verify parts of it in general, and prove it completely for diamond-free graphs. In particular, we characterize diamond-free mixed unit interval graphs by means of an infinite family of forbidden induced subgraphs, and we show that a diamond-free graph is mixed unit interval if and only if it has intersection representations using unit intervals such that all ends of the intervals are integral.     

Generalizing the L-fuzzy unit interval

Given an arbitrary connected topological space, an L-fuzzy space is constructed. When the original space is the real line (unit interval) the constructed space is the L-fuzzy real line (L-fuzzy unit interval). For some spaces, including Rⁿ for all n, the original space is embedded as a subspace of the constructed space. Lastly, the construction yields a non-trivial fuzzy topology on certain classically important spaces of monotone mappings.     

Integral mixed unit interval graphs

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a linear-time algorithm that decides if a given interval graph admits such an intersection representation.     

Completion of the mixed unit interval graphs hierarchy

We describe the missing class of the hierarchy of mixed unit interval graphs. This class is generated by the intersection graphs of families of unit intervals that are allowed to be closed, open, and left‐closed‐right‐open. (By symmetry, considering closed, open, and right‐closed‐left‐open unit intervals generates the same class.) We show that this class lies strictly between unit interval graphs and mixed unit interval graphs. We give a complete characterization of this new class, as well as quadratic‐time algorithms that recognize graphs from this class and produce a corresponding interval representation if one exists. We also show that the algorithm from Shuchat et al. [8] directly extends to provide a quadratic‐time algorithm to recognize the class of mixed unit interval graphs.     

OPTIMAL LABELLING OF UNIT INTERVAL GRAPHS

This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement).     

Approximation of fuzzy numbers by trapezoidal fuzzy numbers preserving the expected interval

The problem to find the nearest trapezoidal approximation of a fuzzy number with respect to a well-known metric, which preserves the expected interval of the fuzzy number, is completely solved. The previously proposed approximation operators are improved so as to always obtain a trapezoidal fuzzy number. Properties of this new trapezoidal approximation operator are studied.     

Probe interval and probe unit interval graphs on superclasses of cographs

Probe (unit) interval graphs form a superclass of (unit) interval graphs. A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe interval graphs were introduced by Zhang for an application concerning with the physical mapping of DNA in the human genome project. In this work, we present characterizations by minimal forbidden induced subgraphs of probe interval and probe unit interval graphs within two superclasses of cographs: P₄-tidy graphs and tree-cographs.     

Thin plate spline interpolation on the unit interval

It is known that the unique thin plate spline interpolant to a function f ∈ C ³ IR sampled at the scaled integers h Z converges at an optimal rate of h ³. In this paper we present results from a recent numerical investigation of the case where the function is sampled at equally spaced points on the unit interval. In this setting the known theoretical error bounds predict a drop in the convergence rate from h ³ to h. However, numerical experiments show that the usual rate of convergence is h ^3/2 and that the deterioration occurs near the end points of the interval. We will examine the effect of the boundary on the accuracy of the interpolant and also the effect of the smoothness of the target function. We will show that there exists functions which enjoy an even faster order of convergence of h ^5/2.