相关论文: A Euclidean comparison theory for the size of sets

The uncountability of $\mathbb{R}$ is one of its most basic properties, known far outside of mathematics. Cantor's 1874 proof of the uncountability of $\mathbb{R}$ even appears in the very first paper on set theory, i.e. a historical…

While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

We introduce axiomatically a Nonarchimedean field E, called the field of the Euclidean numbers, where a transfinite sum is defined that is indicized by ordinal numbers less than the first inaccessible {\Omega}. Thanks to this sum, E becomes…

In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

We study algebraic, combinatorial and topological properties of the set of preorders on a group, and the set of valuations on a field. We show strong analogies between these two kinds of sets and develop a dictionary for these ones. Among…

We propose the representation principle to study physical systems with a given symmetry. In the context of symmetry enriched topological orders, we give the appropriate representation category, the category of SET orders, which include SPT…

We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use decision rules. This paper focuses on decision sets, a type…

In this paper, we intend to generalize the classical set theory as much as possible. we will do this by freeing sets from the regular properties of classical sets; e.g., the law of excluded middle, the law of non-contradiction, the…

Comparing clusterings is central to evaluating unsupervised models, yet the many existing similarity measures can produce widely divergent, sometimes contradictory, evaluations. Clustering similarity measures are typically organized into…

The standard rational choice model describes individuals as making choices by selecting the best option from a menu. A wealth of evidence instead suggests that individuals often filter menus into smaller sets - consideration sets - from…

In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one implies the existence of interior points in the difference…

Probability theory is far from being the most general mathematical theory of uncertainty. A number of arguments point at its inability to describe second-order ('Knightian') uncertainty. In response, a wide array of theories of uncertainty…

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…

Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…