中文
相关论文

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

200 篇论文

A dichotomy discovered by Solecki says that a Baire class 1 function from a Souslin space into a Polish space either can be decomposed into countably many continuous functions, or else contains one particular function which cannot be so…

一般拓扑 · 数学 2009-08-12 Janusz Pawlikowski , Marcin Sabok

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

微分几何 · 数学 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

代数几何 · 数学 2022-01-24 Fabrizio Catanese

Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…

逻辑 · 数学 2022-08-17 Iosif Petrakis

In this paper, we study some properties of $*-$open and $*-$closed subsets of a space. The collection of all $*-$open subsets of a space $X$ form a topology on $X$ which is denoted by $^{*}O(X)$. We investigate the relations between…

一般拓扑 · 数学 2023-06-13 Aliakbar Alijani

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

组合数学 · 数学 2018-11-27 Thomas W. Mattman

Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are…

组合数学 · 数学 2025-03-11 Stephen Bartell , Paul Seymour

The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…

历史与综述 · 数学 2011-11-16 Rafi Shalom

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…

逻辑 · 数学 2025-07-25 Andrew DeLapo , David Gonzalez

The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…

组合数学 · 数学 2013-11-18 Ryan Schwartz , Jozsef Solymosi

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

组合数学 · 数学 2021-07-01 Imre Ruzsa , Jozsef Solymosi

It is shown that for a finite set $A$ of four or more complex numbers, the cardinality of the set $C[A]$ of all cross-ratios generated by quadruples of pair-wise distinct elements of $A$ is $|C[A]|\gg…

组合数学 · 数学 2017-05-05 Misha Rudnev

In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…

逻辑 · 数学 2024-11-25 Emmanuel Rauzy

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…

逻辑 · 数学 2007-05-23 Jaroslav Nešetřil , Saharon Shelah

The Buratti-Horak-Rosa Conjecture concerns the possible multisets of edge-labels of a Hamiltonian path in the complete graph with vertex labels $0, 1, \ldots, {v-1}$ under a particular induced edge-labeling. The conjecture has been shown to…

组合数学 · 数学 2022-02-17 Pranit Chand , M. A. Ollis

This paper discusses the question of how many non-empty subsets of the set $[n] = \{ 1, 2, ..., n\}$ we can choose so that no chosen subset is the union of some other chosen subsets. Let $M(n)$ be the maximum number of subsets we can…

组合数学 · 数学 2015-11-03 Andy Loo

A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points,…

度量几何 · 数学 2007-12-07 Konrad J. Swanepoel

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

最优化与控制 · 数学 2018-06-18 Evgeni Nurminski , Stan Uryasev

We study some variations of the product topology on families of clopen subsets of $2^{\mathbb{N}}\times\mathbb{N}$ in order to construct countable nodec regular spaces (i.e. in which every nowhere dense set is closed) with analytic topology…

一般拓扑 · 数学 2020-01-09 Javier Murgas , Carlos Uzcátegui

This paper considers a class of multi-objective optimization problems known as Minkowski sum problems. Minkowski sum problems have a decomposable structure, where the global nondominated (Pareto) set corresponds to the Minkowski sum of…

最优化与控制 · 数学 2025-02-03 Mark Lyngesen , Sune Lauth Gadegaard , Lars Relund Nielsen
‹ 上一页 1 8 9 10 下一页 ›