中文
相关论文

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

200 篇论文

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…

组合数学 · 数学 2024-06-07 Norbert Hegyvári , Máté Pálfy , Erfei Yue

We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…

范畴论 · 数学 2010-06-25 Misha Gavrilovich

We survey a new area of parameter-free similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extraction. Given a family of distances on a set of objects, a distance is universal up to a…

信息检索 · 计算机科学 2007-05-23 Paul Vitanyi

We define the lower and upper mutual dimensions $mdim(x:y)$ and $Mdim(x:y)$ between any two points $x$ and $y$ in Euclidean space. Intuitively these are the lower and upper densities of the algorithmic information shared by $x$ and $y$. We…

计算复杂性 · 计算机科学 2014-10-16 Adam Case , Jack H. Lutz

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

组合数学 · 数学 2023-06-02 Ada Stelzer , Alexander Yong

A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.

组合数学 · 数学 2019-03-27 Andrey Kupavskii , Nabil H. Mustafa , Konrad J. Swanepoel

This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…

综合数学 · 数学 2011-10-03 Konstantine Zelator

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size $n$ using pairwise comparisons if $k$ of the comparisons might be erroneous where $k$ is a fixed constant. We prove…

离散数学 · 计算机科学 2011-11-15 Dömötör Pálvölgyi

In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…

组合数学 · 数学 2026-01-27 Giovanni Gaiffi , Giovanni Interdonato

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

逻辑 · 数学 2008-08-08 J. P. Mayberry , Richard Pettigrew

The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…

计算复杂性 · 计算机科学 2021-02-16 Jack H. Lutz , Neil Lutz , Elvira Mayordomo

We present an intrinsic and concrete development of the subdivision of small categories, give some simple examples and derive its fundamental properties. As an application, we deduce an alternative way to compare the homotopy categories of…

代数拓扑 · 数学 2018-07-10 Matias Luis del Hoyo

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

范畴论 · 数学 2024-10-07 David Ellerman

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

逻辑 · 数学 2025-08-12 Mauro Avon

This article solves the Hume's problem of induction using a probabilistic approach. From the probabilistic perspective, the core task of induction is to estimate the probability of an event and judge the accuracy of the estimation.…

历史与综述 · 数学 2024-10-03 Xuezhi Yang

Lenstra's concept of Euclidean ideals generalizes the Euclidean algorithm; a domain with a Euclidean ideal has cyclic class group, while a domain with a Euclidean algorithm has trivial class group. This paper generalizes Harper's variation…

数论 · 数学 2010-08-17 Hester Graves

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

逻辑 · 数学 2007-05-23 Peter Koepke , Martin Koerwien

We resolve a few questions regarding the uniformity and size of microsets of subsets of Euclidean space. First, we construct a compact set $K\subset\mathbb{R}^d$ with Assouad dimension arbitrarily close to $d$ such that every microset of…

度量几何 · 数学 2025-10-22 Richárd Balka , Vilma Orgoványi , Alex Rutar

The pros and cons of various forms of atomism and holism that are applicable both in physical science and today's philosophy of nature are evaluated. To this end, Lewis' thesis of Humean supervenience is presented as an important case study…

物理学史与哲学 · 物理学 2009-05-06 Vassilios Karakostas

Complexity Theory is highly interdisciplinary, therefore any regularities must hold on all levels of organization, independent on the nature of the system. An open question in science is how complex systems self-organize to produce emergent…

太阳与恒星天体物理 · 物理学 2022-02-07 Travis Herman Butler , Georgi Yordanov Georgiev