中文
相关论文

相关论文: Variations on Kuratowski's 14-set theorem

200 篇论文

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

人工智能 · 计算机科学 2009-11-30 Matthias Horbach , Christoph Weidenbach

In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…

泛函分析 · 数学 2024-05-20 Ruigang Zheng , Xiaosheng Zhuang

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

数论 · 数学 2007-05-23 Iskander Aliev

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

组合数学 · 数学 2016-03-09 Bernardo González Merino , Matthias Henze

Though a convergence space is connected if and only if its topological modification is connected, connected subsets differ for the convergence and for its topological modification. We explore for what subsets connectedness for the…

一般拓扑 · 数学 2025-10-01 Bryan Castro Herrejón , Frédéric Mynard

Alt's problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial…

代数几何 · 数学 2020-04-07 Jonathan D. Hauenstein , Martin Helmer

Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…

组合数学 · 数学 2024-03-18 Kada Williams

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

度量几何 · 数学 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a…

We study, for the first time, the maximum modulus set of a quasiregular map. It is easy to see that these sets are necessarily closed, and contain at least one point of each modulus. Blumenthal showed that for entire maps these sets are…

复变函数 · 数学 2020-09-15 Alastair N. Fletcher , David J. Sixsmith

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

组合数学 · 数学 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

A topology on a set $X$ is the same as a projection (i.e. an idempotent linear operator) $cl:2^X\to 2^X$ satisfying $A\subset cl(A)$ for all $A\subset X$. That's a good way to summarize Kuratowski's closure operator. Basic geometry on a set…

度量几何 · 数学 2018-04-12 Jerzy Dydak

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

Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…

最优化与控制 · 数学 2021-08-26 David de Laat , Frank Vallentin

We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. Starting from ZFC, the exposition in this first part includes relation and order theory as well as a construction of…

历史与综述 · 数学 2013-06-26 Felix Nagel

In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…

群论 · 数学 2020-02-10 Tim Boykett

We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…

代数拓扑 · 数学 2014-12-09 Priyavrat Deshpande

We give an elementary proof of the Hurewicz theorem relating homotopy and homology groups of a cubical Kan complex. Our approach is based on the notion of a loop space of a cubical set, developed in a companion paper ``Homotopy groups of…

代数拓扑 · 数学 2024-09-09 Daniel Carranza , Chris Kapulkin , Andrew Tonks

C-cross topologies are introduced. Modifcations of the Kuratowski-Ulam Theorem are considered. Cardinal invariants add, cof, cov and non with respect to meager or nowhere dense subsets are compared. Remarks on invariants cof(nwdY) are…

一般拓扑 · 数学 2007-05-23 Andrzej Kucharski , Szymon Plewik

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

环与代数 · 数学 2011-06-02 Roberto Boldini