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

We describe a new approach based on tropical optimization techniques to solve the problem of rating alternatives from pairwise comparison data. The problem is formulated to approximate, in the log-Chebyshev sense, pairwise comparison…

We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We…

We propose some problems on the classification of toric manifolds from the viewpoint of topology and survey related results.

$\tau$-tilting theory can be thought of as a generalization of the classical tilting theory which allows mutations at any indecomposable summand of a support $\tau$-tilting pair. Indeed, for any algebra $\Lambda$ its tilting modules…

We aim to solve a topology optimization problem where the distribution of material in the design domain is represented by a density function. To obtain candidates for local minima, we want to solve the first order optimality system via…

Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…

We establish a comparison principle for viscosity subsolutions and supersolutions of a broad class of second-order quasilinear, maximally subelliptic PDEs on general manifolds. In fact, we prove the comparison theorem for a larger class of…

In this thesis we study toric degenerations of projective varieties. We compare different constructions to understand how and why they are related as s first step towards developing a global framework. In focus are toric degenerations…

We treat the $\tau$-tilting finiteness of those minimal representation-infinite (min-rep-infinite) algebras which are non-distributive. Building upon the new results of Bongartz, we fully determine which algebras in this family are…

In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edge is labeled positive or negative. The goal is to obtain a…

Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…

In these notes we solve a class of Riemann-Hilbert (inverse monodromy) problems with quasi-permutation monodromy groups which correspond to non-singular branched coverings of $\CP1$. The solution is given in terms of Szeg\"o kernel on the…

We extend the definition of topological pressure to locally compact Hausdorff spaces, and we demonstrate a "variational principle" comparing the topological and measure theoretic pressures. Given a continuous $\mathbb{Z}_+^N$-action $T$…

We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…

We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint…

This paper develops 'covariant tomography', a local framework for solving Inverse Boundary Value Problems (IBVP) for parallel transport equation on star-shaped domains. By integrating geometric decomposition with specific interior…

Given a Galois cover of curves $f$ over a field of characteristic $p$, the lifting problem asks whether there exists a Galois cover over a complete mixed characteristic discrete valuation ring whose reduction is $f$. In this paper, we…

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

In the solution discovery variant of a vertex (edge) subset problem $\Pi$ on graphs, we are given an initial configuration of tokens on the vertices (edges) of an input graph $G$ together with a budget $b$. The question is whether we can…

In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…