Related papers: From well-quasi-ordered sets to better-quasi-order…
The Pauli exclusion principle gives an upper bound of 1 on the natural occupation numbers. Recently there has been an intriguing amount of theoretical evidence that there is a plethora of additional generalized Pauli restrictions or…
Let $T$ be a local (Noetherian) ring and let $Q_1$ and $Q_2$ be prime ideals of $T$. We find sufficient conditions for there to exist a quasi-excellent local subring $B$ of $T$ satisfying the following conditions: (1) the completion of $B$…
Let $P$ be a finite partially ordered set with unique minimal element $\hat{0}$. We study the Betti poset of $P$, created by deleting elements $q\in P$ for which the open interval $(\hat{0}, q)$ is acyclic. Using basic simplicial topology,…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
For two posets $P$ and $Q$, we say $Q$ is $P$-free if there does not exist any order-preserving injection from $P$ to $Q$. The speical case for $Q$ being the Boolean lattice $B_n$ is well-studied, and the optiamal value is denoted as…
A subsemigroup $S$ of an inverse semigroup $Q$ is a left I-order in $Q$ if every element in $Q$ can be written as $a^{-1}b$ where $a,b \in S$ and $a^{-1}$ is the inverse of $a$ in the sense of inverse semigroup theory. If we insist on $a$…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
We study the relation on linear orders induced by order preserving surjections. In particular we show that its restriction to countable orders is a bqo.
We investigate the continuum q-Potts model at its transition point from the disordered to the ordered regime, with particular emphasis on the coexistence of disordered and ordered phases in the high-q case. We argue that occurrence of phase…
We study the well-posedness of a linear control system $\Sigma(A,B,C,D)$ with unbounded control and observation operators. To this end we associate to our system an operator matrix $\mathcal{A}$ on a product space $\mathcal{X}^p$ and call…
Let $R$ be a not necessarily commutative ring with $1.$ In the present paper we first introduce a notion of quasi-orderings, which axiomatically subsumes all the orderings and valuations on $R$. We proceed by uniformly defining a coarsening…
The study of weak domains and quasicontinuous domains leads to the consideration of two types generalizations of domains. In the current paper, we define the weak way-below relation between two nonempty subsets of a poset and quasiexact…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
We study the Bohmian dynamics of a large class of bipartite systems of non-ideal qubit systems, by modifying the basic physical parameters of an ideal two-qubit system, made of coherent states of the quantum harmonic oscillator. First we…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
We show how to construct discretely ordered principal ideal subrings of $\mathbb Q[x]$ with various types of prime behaviour. Given any set $\mathcal D$ consisting of finite strictly increasing sequences $(d_1,d_2,\dots, d_l)$ of positive…
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element…
Extending well-structured transition systems to incorporate a probabilistic scheduling rule, we define a new class of stochastic well-structured transition systems that includes population protocols, chemical reaction networks, and many…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…