中文
相关论文

相关论文: Selection principles and the minimal tower problem

200 篇论文

Motivated by the minimal tower problem, an earlier work studied diagonalizations of covers where the covers are related to linear quasiorders (tau-covers). We deal with two types of combinatorial questions which arise from this study. 1.…

逻辑 · 数学 2010-11-02 Saharon Shelah , Boaz Tsaban

We solve four out of the six open problems concerning critical cardinalities of topological diagonalization properties involving tau-covers, show that the remaining two cardinals are equal, and give a consistency result concerning this…

一般拓扑 · 数学 2010-11-02 Heike Mildenberger , Saharon Shelah , Boaz Tsaban

In a previous work with Mildenberger and Shelah, we showed that the combinatorics of the selection hypotheses involving tau-covers is sensitive to the selection operator used. We introduce a natural generalization of Scheepers' selection…

一般拓扑 · 数学 2010-11-02 Boaz Tsaban

We give a selection of major open problems involving selective properties, diagonalizations, and covering properties for sets of real numbers. This is a revision of the version published as a chapter in the book \textbf{Open Problems in…

一般拓扑 · 数学 2011-10-19 Boaz Tsaban

We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.

一般拓扑 · 数学 2010-11-02 Boaz Tsaban

In this paper, using the classical covering theory, we introduce a generalization of covering maps of a space $X$ with respect to a topology $\tau$ on the fundamental group of $X$. We show that the famous notions, covering, semicovering,…

代数拓扑 · 数学 2026-02-24 Naghme Shahami , Behrooz Mashayekhy

The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…

组合数学 · 数学 2014-12-04 Alan J. Aw

We investigate small covers and quasitoric over the duals of neighborly simplicial polytopes with small number of vertices in dimensions $4$, $5$, $6$ and $7$. In the most of the considered cases we obtain the complete classification of…

代数拓扑 · 数学 2017-04-21 Djordje Baralic , Lazar Milenkovic

A high number of discrete optimization problems, including Vertex Cover, Set Cover or Feedback Vertex Set, can be unified into the class of covering problems. Several of them were shown to be inapproximable by deterministic algorithms. This…

数据结构与算法 · 计算机科学 2013-05-14 Etienne Birmelé

The main theme of this paper is to study $\tau$-tilting subcategories in an abelian category $\mathscr{A}$ with enough projective objects. We introduce the notion of $\tau$-cotorsion torsion triples and show a bijection between the…

表示论 · 数学 2022-07-04 Javad Asadollahi , Somayeh Sadeghi , Hipolito Treffinger

The purpose of this article is three-fold. First, we apply a general theorem from our earlier work to produce many new minimal doublings of the Clifford Torus in the round three-sphere. This construction generalizes and unifies prior…

微分几何 · 数学 2024-11-04 Nikolaos Kapouleas , Peter McGrath

The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).

数据结构与算法 · 计算机科学 2015-06-02 Samir Khuller , Uzi Vishkin , Neal Young

We study a class of convex-concave min-max problems in which the coupled component of the objective is linear in at least one of the two decision vectors. We identify such problem structure as interpolating between the bilinearly and…

最优化与控制 · 数学 2025-07-10 Ronak Mehta , Jelena Diakonikolas , Zaid Harchaoui

In this paper, we consider the optimization problem Submodular Cover (SCP), which is to find a minimum cardinality subset of a finite universe $U$ such that the value of a submodular function $f$ is above an input threshold $\tau$. In…

数据结构与算法 · 计算机科学 2023-09-27 Wenjing Chen , Victoria G. Crawford

We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case…

逻辑 · 数学 2010-09-28 Alessandro Berarducci , Ya'acov Peterzil , Anand Pillay

Recent research has examined algorithms to minimize robots' resource footprints. The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space…

离散数学 · 计算机科学 2022-02-01 Yulin Zhang , Dylan A. Shell

We study selection principles related to bornological covers in a topological space $X$ following the work of Aurichi et al., 2019, where selection principles have been investigated in the function space $C_\mathfrak{B}(X)$ endowed with the…

一般拓扑 · 数学 2025-11-07 Debraj Chandra , Subhankar Das , Nur Alam

In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove…

微分几何 · 数学 2009-04-10 Xin Zhou

In paper we study relationships between covering properties of a topological space $X$ and the space $(USC^*(X),\tau_{\mathcal{B}})$ of bounded upper semicontinuous functions on $X$ with the topology $\tau_{\mathcal{B}}$ defined by the…

一般拓扑 · 数学 2022-04-19 Lev Bukovský , Alexander V. Osipov

This work answers the question what coverings over a topological torus can be induced from a covering over a space of dimension $k$. The answer to this question is then applied in algebro-geometric context to present obstructions to…

代数几何 · 数学 2011-07-19 Yuri Burda
‹ 上一页 1 2 3 10 下一页 ›