Related papers: Sub-matrix summability of sequence of sets
In this paper we introduce and study the notion of I-convergence of sequences in a metric-like space, where I is an ideal of subsets of the set N of all natural numbers. Further introducing the notion of I*-convergence of sequences in a…
The present study introduces the notions of statistical convergence of order $\alpha$ and strong $p-$ Ces\`{a}ro summability of order $\alpha$ in partial metric spaces. Also, we examine the inclusion relations between these concepts. In…
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…
We describe a simple analytical method for effective summation of series, including divergent series. The method is based on self-similar approximation theory resulting in self-similar root approximants. The method is shown to be general…
We introduce the notion of ideally supported achievement sets for a series of real numbers. We analize their complexity and topological properties. We compare the notion of ideal achievement sets with the notion of ideally supported sum…
This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…
We extend Freiman's inequality on the cardinality of the sumset of a $d$ dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
Properties of universality have essential relevance for the theory of random matrices usually called the Wigner ensemble. The issue was analysed up to recent years with detailed and relevant results. We present a slightly different view and…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
In their 2022 lecture notes on condensed sets, Clausen and Scholze mentioned in a remark that the important subclass of quasiseparated condensed sets is equivalent to the category of so-called compactological spaces defined by Waelbroeck in…
We introduce a general notion of covering property, of which many classical definitions are particular instances. Notions of closure under various sorts of convergence, or, more generally, under taking kinds of accumulation points, are…
New lower bounds involving sum, difference, product, and ratio sets for $A\subset \C$ are given.
The aim of this paper is to provide a new class of series identities in the form of four general results. The results are established with the help of generalizatons of the classical Kummer's summation theorem obtained earlier by Rakha and…
One basic requirement of many studies is the necessity of classifying data. Clustering is a proposed method for summarizing networks. Clustering methods can be divided into two categories named model-based approaches and algorithmic…
The main goal of this paper is twofold. First, we extend some results known in the case of weak greedy algorithms with a scalar parameter to the case of weak greedy algorithms with a weakness sequence. Second, we formulate a new setting of…
We present a more general (parametric-) homological characterization of the Direct Summand Theorem. Specifically, we state two new conjectures: the Socle-Parameter conjecture (SPC) in its weak and strong forms. We give a proof for the week…
In a recent paper (Appl. Math. Comput. 215, 1622--1645, 2009), the authors proposed a method of summation of some slowly convergent series. The purpose of this note is to give more theoretical analysis for this transformation, including the…
We study the Subset Balancing problem: given $x \in \mathbb{Z}^n$ and a coefficient set $C \subseteq \mathbb{Z}$, find a nonzero vector $c \in C^n$ such that $c\cdot x = 0$. The standard meet-in-the-middle algorithm runs in time…