Related papers: Transfinite Sequences of Continuous and Baire Clas…
Powerspaces of directed spaces play an important role in modeling the semantics of nondeterministic functional programming languages. The notions of upper,lower and convex powerspace of a directed space are defined by the way of free…
The purpose of this paper is to define for every Polish space $X$ a class of sets, the $EBP(X)$-sets or the extended Baire property sets, to work out many properties of the $EBP(X)$-sets and to show their usefulness in analysis. For…
It is well known that upward conditioned Brownian motion is a three-dimensional Bessel process, and that a downward conditioned Bessel process is a Brownian motion. We give a simple proof for this result, which generalizes to any continuous…
Given a one-dimensional shift $X$, let $|F_X(\ell)|$ be the number of follower sets of words of length $\ell$ in $X$. We call the sequence $\{|F_X(\ell)|\}_{\ell \in \mathbb{N}}$ the follower set sequence of the shift $X$. Extender sets are…
Given a coarse space $(X, \mathcal{E})$, we consider linear orders on $X$ compatible with the coarse structure $\mathcal E$ and explore interplays between these orders and macro-uniform selectors of $(X, \mathcal{E})$.
Denote by {$\times$} the fractional part. We establish several new metrical results on the distribution properties of the sequence ({x n }) n$\ge$1. Many of them are presented in a more general framework, in which the sequence of functions…
We characterize order preserving continuous surjections between compact linearly ordered spaces which admit an averaging operator, together with estimates of the norm of such an operator. This result is used to the study of strengthenings…
We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
We generalize the classical Bernstein theorem concerning the constructive description of classes of functions uniformly continuous on the real line. The approximation of continuous bounded functions by entire functions of exponential type…
In the setting of a metric space equipped with a doubling measure supporting a Poincar\'e inequality, we show that BV functions are, in the sense of multiple limits, continuous with respect to a 1-fine topology, at almost every point with…
In this paper we give a description of separating or disjointness preserving linear bijections on spaces of vector-valued absolutely continuous functions defined on compact subsets of the real line. We obtain that they are continuous and…
In this paper, we define and study the space of all the functions of bounded variation $f:[x,y]\to \mathbb{Y}$ denoted by $\mathcal{BV}[x,y],$ where $[x,y]$ is an ordered interval and $\mathbb{Y}$ is an absolute order unit space having…
We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However,…
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
First-order learning involves finding a clause-form definition of a relation from examples of the relation and relevant background information. In this paper, a particular first-order learning system is modified to customize it for finding…