相关论文: Bounding and dominating number of families of func…

Some boundedness properties of function spaces (considered as topological groups) are studied.

We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…

We derive families of Newton-like inequalities involving the elementary symmetric functions of sets of self-conjugate complex numbers in the right half-plane. These are the first known inequalities of this type which are independent of the…

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…

What is a population? This review considers how a population may be defined in terms of understanding the structure of the underlying genetics of the individuals involved. The main approach is to consider statistically identifiable groups…

We present a general result giving us families of incomplete and boundedly complete families of discrete distributions. For such families, the classes of unbiased estimators of zero with finite variance and of parametric functions which…

Normal and composition series of groups enumerated by ordinal numbers are studied. The Jordan-Holder theorem for them is proved.

We study a generalized family of stochastic orders, semiparametrized by a distortion function H, namely H-distorted stochastic dominance, which may determine a continuum of dominance relations from the first- to the second-order stochastic…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Graph exploration is one of the fundamental tasks performed by a mobile agent in a graph. An $n$-node graph has unlabeled nodes, and all ports at any node of degree $d$ are arbitrarily numbered $0,\dots, d-1$. A mobile agent, initially…

We consider the restriction of twice differentiable functionals on a Hilbert space to families of subspaces that vary continuously with respect to the gap metric. We study bifurcation of branches of critical points along these families, and…

This paper is devoted to the specific class of pseudoconformal mappings of quaternion and octonion variables. Normal families of functions are defined and investigated. Four criteria of a family being normal are proven. Then groups of…

We investigate a family of one dimensional maps for which the bifurcation diagram looks differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising for this family of maps.

We develop the theory of set-indexed families of sets and subsets within the informal Bishop Set Theory BST, a reconstruction of Bishop's theory of sets.

The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…

This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…

For a general family of non-negative functions matching upper and lower bounds are established for their average over the values of any equidistributed sequence.

This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing…