Related papers: Selection principles and the minimal tower problem
We consider problems of rating alternatives based on their pairwise comparison under various assumptions, including constraints on the final scores of alternatives. The problems are formulated in the framework of tropical mathematics to…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…
In the context of a tower of (strongly Birkhoff) Galois structures in the sense of categorical Galois theory, we show that the concept of a higher covering admits a characterisation which is at the same time absolute (with respect to the…
In most recent substructuring methods, a fundamental role is played by the coarse space. For some of these methods (e.g. BDDC and FETI-DP), its definition relies on a 'minimal' set of coarse nodes (sometimes called corners) which assures…
Doubly periodic tangles (DP tangles) are configurations of curves embedded in the thickened plane, invariant under translations in two transversal directions. In this paper we extend the classical theory of DP tangles by introducing the…
This thesis delves into the geometry of abstract tropical curves, exploring their complete linear system and associated tropical submodules. We establish a lower bound on the dimension of tropical submodules in terms of the Baker-Norine…
Let $\mathscr{C}$ be an extriangulated category with enough projectives and injectives. We give a new definition of tilting subcategories of $\mathscr{C}$ and prove it coincides with the definition given in [19]. As applications, we…
This work considers a number of optimization problems and reductive relations between them. The two main problems we are interested in are the \emph{Optimal Decision Tree} and \emph{Set Cover}. We study these two fundamental tasks under…
In this paper we focus our efforts on studying how a preorder and topology can be made compatible. Thus we provide a characterization of those that are continuous-compatible. Such a characterization states that such topologies must be finer…
A challenge in computational topology is to deal with large filtered geometric complexes built from point cloud data such as Vietoris-Rips filtrations. This has led to the development of schemes for parallel computation and compression…
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Topology, one of the most important subjects in mathematics, provides mathematical tools and interesting topics in…
Topologies can be expanded with the help of ideals, using the local function, an operator resembling the closure of a set. The aim of this paper is to define the ideals which enable us to create this topology $\tau^{*}$ on $X$…
In this article we develop a duality principle and concerning computational method for a structural optimization problem in elasticity. We consider the problem of finding the optimal topology for an elastic solid which minimizes its…
We prove a theorem which gives a bijection between the support $\tau$-tilting modules over a given finite-dimensional algebra $A$ and the support $\tau$-tilting modules over $A/I$, where $I$ is the ideal generated by the intersection of the…
We consider the method of topological quantization for conservative systems with a finite number of degrees of freedom. Maupertuis' formalism for classical mechanics provides an appropriate scenario which permit us to adapt the method of…
This paper endeavors to explore certain distinguished modules and subcategories within mod$\Lambda$. Let $\mathrm{proj}\mbox{-}\Lambda$ denote the category of all finitely generated projective $\Lambda$-modules and define…
Systems displaying quantum topological order feature robust characteristics that are very attractive to quantum computing schemes. Topological quantum field theories have proven to be powerful in capturing the quintessential attributes of…
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method…
In this paper, we develop two new homological invariants called relative dominant dimension with respect to a module and relative codominant dimension with respect to a module. These are used to establish precise connections between Ringel…