相关论文: A Euclidean comparison theory for the size of sets
Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…
A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…
In this paper we consider the relationship between the Assouad and box-counting dimension and how both behave under the operation of taking products. We introduce the notion of `equi-homogeneity' of a set, which requires a uniformity in the…
In this paper we will systematically study the preservation of the notion of largeness of sets, arises from the algebraic structure of Stone-Cech compactification, under homomorphism and difference group. Some of these results were studied…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
We are going to classify sets by a given mean in two ways. Firstly we study small and big sets regarding a given mean. Secondly we study sets that have the same weight according to a mean. We also generalize the notion of roundness and get…
Set theoretical paradoxes have a common root -- lack of understanding of why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such…
Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are…
We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…
A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…
Many types of categorical structure obey the following principle: the natural notion of equivalence is generated, as an equivalence relation, by identifying $A$ with $B$ when there exists a strictly structure-preserving map $A \to B$ that…
The study of the size of subsets in a semigroup have shown that many of these subsets have strong combinatorial properties and contribute richly to the algebraic structure of the Stone-Cech compactification of a discrete semigroup. N.…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them by a majority of voters. This idea extends to…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
A computational theory for clustering and a semi-supervised clustering algorithm is presented. Clustering is defined to be the obtainment of groupings of data such that each group contains no anomalies with respect to a chosen grouping…
We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…