中文
相关论文

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

200 篇论文

In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…

计算几何 · 计算机科学 2022-03-22 Minati De , Abhiruk Lahiri

We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in this framework. We generalize A* search and heuristics derived…

人工智能 · 计算机科学 2011-10-12 P. F. Felzenszwalb , D. McAllester

We consider an embedded $n$-dimensional compact complex manifold in $n+d$ dimensional complex manifolds. We are interested in the holomorphic classification of neighborhoods as part of Grauert's formal principle program. We will give…

复变函数 · 数学 2020-07-13 Xianghong Gong , Laurent Stolovitch

The main purpose of this paper is to introduce and study two new operators $(\cdot)_R^{\diamond}$ and $cl_R^{\diamond}(\cdot)$ via primal which is a new notion. We also show that the operator $cl_R^{\diamond}(\cdot)$ is a Kuratowski closure…

一般拓扑 · 数学 2024-02-14 Murad Özkoç , Büşra Köstel

In the propositional setting, the marginal problem is to find a (maximum-entropy) distribution that has some given marginals. We study this problem in a relational setting and make the following contributions. First, we compare two…

人工智能 · 计算机科学 2018-04-26 Ondrej Kuzelka , Yuyi Wang , Jesse Davis , Steven Schockaert

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

We introduce a $2$-approximation algorithm for the minimum total covering number problem.

数据结构与算法 · 计算机科学 2010-08-20 Pooya Hatami

We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…

The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…

最优化与控制 · 数学 2021-08-31 Rui Chen , Sanjeeb Dash , Oktay Gunluk

Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or approximations for problem instances when given solutions to…

计算复杂性 · 计算机科学 2019-07-31 Hans-Joachim Böckenhauer , Elisabet Burjons , Martin Raszyk , Peter Rossmanith

In this thesis, we introduce the subject of D-spaces and some of its most important open problems which are related to well known covering properties. We then introduce a new approach for studying D-spaces and covering properties in…

一般拓扑 · 数学 2025-04-17 Talal Alrawajfeh , Hasan Z. Hdeib

The canonical tensor rank approximation problem (TAP) consists of approximating a real-valued tensor by one of low canonical rank, which is a challenging non-linear, non-convex, constrained optimization problem, where the constraint set…

数值分析 · 数学 2022-09-02 Paul Breiding , Nick Vannieuwenhoven

Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…

数学物理 · 物理学 2023-03-22 Thomas Guhr

This is a problem list in the theory of foliations and laminations of 3-manifolds. The focus is on the relationship of foliations and laminations with other aspects of 3-manifold topology, especially with the Thurston theory of geometric…

几何拓扑 · 数学 2007-05-23 Danny Calegari

Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…

数据结构与算法 · 计算机科学 2018-11-08 Kaveh Khoshkhah , Mehdi Khosravian Ghadikolaei , Jerome Monnot , Florian Sikora

A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…

计算物理 · 物理学 2021-06-23 Miloslav Capek , Lukas Jelinek , Michal Masek

We consider the problem of covering multiple submodular constraints. Given a finite ground set $N$, a cost function $c: N \rightarrow \mathbb{R}_+$, $r$ monotone submodular functions $f_1,f_2,\ldots,f_r$ over $N$ and requirements…

数据结构与算法 · 计算机科学 2025-09-04 Tanvi Bajpai , Chandra Chekuri , Pooja Kulkarni

Let $M$ be a closed manifold that admits a self-cover $p:M \to M$ of degree >1. We say p is strongly regular if all its iterates are regular covers. In this case, we establish an algebraic structure theorem for the fundamental group of $M$:…

几何拓扑 · 数学 2018-04-18 Wouter Van Limbeek

The Mar\'echal topology, also called the Effros-Mar\'echal topology, is a natural topology one can put on the space of all von Neumann subalgebras of a given von Neumann algebra. It is a result of Mar\'echal from 1973 that this topology is…

算子代数 · 数学 2024-07-09 Pierre Fima , François Le Maître , Kunal Mukherjee , Issan Patri

As we all known, there is still a long way for us to solve arbitrary multivariate Lagrange interpolation in theory. Nevertheless, it is well accepted that theories about Lagrange interpolation on special point sets should cast important…

交换代数 · 数学 2010-03-17 Tian Dong , Xiaoying Wang , Shugong Zhang , Peng Li