Related papers: Complete sets
The first aim of this study is to define soft sequential compact metric spaces and to investigate some important theorems on soft sequential compact metric space. Second is to introduce net and totally bounded soft metric space and study…
We continue the study of how one can define means of infinite sets. We introduce many new properties, investigate their relations to each other and how they can typify a mean. We collect the properties in property groups e.g. for…
The main aspect of this paper is to introduce a new generalisation of nano open sets namely, nano h-open sets. These newly generalised sets serve as the foundation for the definition of nano h-continuous functions and some results involving…
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We begin the study of completeness of affine connections, especially those on statistical manifolds as well as on affine hypersurfaces. We collect basic facts, prove new theorems and provide examples with remarkable properties.
The purpose of this paper is to continue studying the properties of $\gamma$-regular open sets introduced and explored in [6]. The concept of $\gamma$-closed spaces have also been defined and discussed.
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.
In this paper, we study sequences of positive numbers preserving summability. In particular, the open set property for such a family of sequences is shown. Several classes of sequences preserving summability, including polynomials, sums of…
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…
We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.
Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…
We propose a multi-scale analysis method for studying arithmetic properties of integer sets, such as primality. Our approach organizes information through a hierarchy of nested sequences, where each level enables a hierarchical expression…