Related papers: Summability
The main purpose of this paper is to introduce the concepts of Wijsman $C_{\lambda}$ statistical convergence, Wijsman $C_{\lambda}$ summability and Wijsman $\mathcal{I}$-$C_{\lambda}$ summability for sequence of sets by using submethod.…
We obtain a set of necessary and sufficient conditions for $| \bar{N}, p_{n} |_{k} $ to imply $|\bar{N}, q_{n} |_{s}$ for $1 < k \leq s < \infty$. Using this result we establish several inclusion theorems as well as conditions for the…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…
We investigate properties of an ordinal sum of uninorms introduced in [8] in the case that the summands are proper representable uninorms. We show sufficient and necessary conditions for a uninorm to be an ordinal sum of representable…
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a series of positive rational terms is a transcendental number.…
Given a finite abelian group $G$ and cyclic subgroups $A$, $B$, $C$ of $G$ of the same order, we find necessary and sufficient conditions for $A$, $B$, $C$ to admit a common transversal for the cosets they afford. For an arbitrary number of…
Under a mild technical assumption, we prove a necessary and sufficient condition for a totally real compacdt set in $\mathbb{C}^n$ to be rationally convex. This generalizes a classical result of Duval-Sibony
In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
A necessary and sufficient condition for an element of an algebra (in the sense of Universal Algebra) to be in the dominion of a subalgebra is given, in terms of transferable sets. This criterion is then used to formulate a more wieldy…
The concept of efficiency plays a prominent role in the formal solution of decision problems that involve incomparable alternatives. This paper develops necessary and sufficient conditions for the efficient points in a sum of sets of…
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…
Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…
In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals
A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…
In this paper, we present the foundations of Summability Calculus, which places various established results in number theory, infinitesimal calculus, summability theory, asymptotic analysis, information theory, and the calculus of finite…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.
There is proved the sufficiency of several conditions for the removability of singularities of complex-analytic sets in domains of $\mathbb C^n$.
Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…