Related papers: Limits of interval orders and semiorders
Modeling a sequence of design steps, or a sequence of parameter settings, yields a sequence of dynamical systems. In many cases, such a sequence is intended to approximate a certain limit case. However, formally defining that limit turns…
Starting from pseudometrics and preorders on sets of integers, we extend the focus to sets of finite sequences of integers, in particular sequences of consecutive integers. We outline existing concepts for deriving centred pseudometrics and…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
In 2010, Bousquet-M\'elou et al. defined sequences of nonnegative integers called ascent sequences and showed that the ascent sequences of length $n$ are in one-to-one correspondence with the interval orders, i.e., the posets not containing…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
We propose a new approach to compute an interval over-approximation of the finite time reachable set for a large class of nonlinear systems. This approach relies on the notions of sensitivity matrices, which are the partial derivatives…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
Each family $\mathcal{M}$ of means has a natural, partial order (point-wise order), that is $M \le N$ iff $M(x) \le N(x)$ for all admissible $x$. In this setting we can introduce the notion of interval-type set (a subset $\mathcal{I}…
In this note we introduce the concept of a semi-bounded unitary representations of an infinite-dimensional Lie group $G$. Semi-boundedness is defined in terms of the corresponding momentum set in the dual $\g'$ of the Lie algebra $\g$ of…
A partial order on the set of metric measure spaces is defined; it generalizes the Lipschitz order of Gromov. We show that our partial order is closed when metric measure spaces are equipped with the Gromov-weak topology and give a new…
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
We provide the analytic forms of the distributions for the sum of ordered spacings. We do this both for the case where the boundaries are included in the calculation of the spacings and the case where they are excluded. Both the probability…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
This paper deals with (finite or infinite) sequences of arbitrary independent events in some probability space. We find sharp lower bounds for the probability of a union of such events when the sum of their probabilities is given. The…
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.