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

We pose some open problems related to boundedness of real-valued functions on balleans and coarse spaces. Also we prove that the Bergman property of groups is a coarse invariant. A special attention is payed to balleans on groups.

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

Few explicit families of 3-folds are known for which the computation of the canonical ring is accessible and the birational geometry non-trivial. In this note we investigate a family of determinantal 3-folds in $\mathbb P^2 \times \mathbb…

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

This paper is devoted to the uniqueness problem of the power of a meromorphic function with its differential polynomial sharing a set. Our result will extend a number of results obtained in the theory of normal families. Some questions are…

In a first part, we give a method for solving a family of fuchsian systems of operators of pseudo-derivations associated to a family of homographies with two parameters which unify and generalize the differential, the difference and the…

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…

In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…

In this paper we study the large linear and algebraic size of the family of unbounded continuous and integrable functions in $[0,+\infty)$ and of the family of sequences of these functions converging to zero uniformly on compacta and in…

In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

The family Blow Up formula is recalled. Certain combinatoric graphs are introduced for the discussion of the counting of nodal curves on an Kahler surface.

We consider the notion of multiple gap as a finite set of ideals that cannot be separated. We study the different types of such objects that can be found in the Boolean algebra of subsets of the natural numbers modulo finite sets.

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…