Related papers: Nests, and their Role in the Orderability Problem
By considering nests on a given space, we explore order-theoretical and topological properties that are closely related to the structure of a nest. In particular, we see how subbases given by two dual nests can be an indicator of how close…
The class of LOTS (linearly ordered topological spaces, i.e. spaces equipped with a topology generated by a linear order) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such…
This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…
The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…
This thesis details a class of partial orders on the space of probability distributions and the space of density operators which capture the idea of information content. Some links to domain theory and computational linguistics are also…
The following work is an exploration into certain topics in the broad world of integrable models, both classical and quantum, and consists of two main parts of roughly equal length. The first part, consisting of chapters 1-3, concerns…
We establish a general result about extending a right invertible row over a Banach algebra to an invertible matrix. This is applied to the computation of right topological stable rank of a split exact sequence. We also introduce a…
The paper contains a discussion on a number of open problems in queueing theory. Some of them are known for decades, some are more recent. They relate to stability and to rare events. There is an idea to prepare a special issue of QUESTA on…
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…
The report suggests the concept of risk, outlining two mathematical structures necessary for risk genesis: the set of outcomes and, in a general case, partial order of preference on it. It is shown that this minimum partial order should…
We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…
We explore the fundamental problem of sorting through the lens of learning-augmented algorithms, where algorithms can leverage possibly erroneous predictions to improve their efficiency. We consider two different settings: In the first…
This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focus on properties of the front end of networks and on how to…
In many situations, the decision maker observes items in sequence and needs to determine whether or not to retain a particular item immediately after it is observed. Any decision rule creates a set of items that are selected. We consider…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
In this paper, we introduce a new type of relation between knots called the descendant relation. One knot $H$ is a descendant of another knot $K$ if $H$ can be obtained from a minimal crossing diagram of $K$ by some number of crossing…
The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes is reviewed. New conjectures concerning nest distribution functions are presented as well as a bijection between certain…
The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.