Related papers: The Seed Order
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
Consider the following generalization of the bicyclic monoid. Let $\kappa$ be any infinite cardinal and let $\mathcal{IP\!F}\left(\sigma{\mathbb{N}^\kappa}\right)$ be the semigroup of all order isomorphisms between principal filters of the…
We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We…
Unsupervised machine learning methods can be of great help in many traditional engineering disciplines, where huge amount of labeled data is not readily available or is extremely difficult or costly to generate. Two specific examples…
We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle…
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…
An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
Lee and Kwon [12] defined an ordered semigroup S to be completely regular if a 2 (a2Sa2] for every a 2 S. We characterize every completely regular ordered semigroup as a union of t-simple subsemigroups, and every Clifford ordered semigroup…
Let $n$ be any positive integer and $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ be the semigroup of all order isomorphisms between principal filters of the $n$-th power of the set of positive integers $\mathbb{N}$ with the product order. We study…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
This note contains additions to the paper 'Clustered cell decomposition in P-minimal structures' (arXiv:1612.02683). We discuss a question which was raised in that paper, on the order of clustered cells. We also consider a notion of cells…
We study the possible number of normal measures on a measurable cardinal in settings where inner model techniques are unavailable. Instead, we exploit consequences of the Ultrapower Axiom to obtain our theorems. We show that the classical…
Partial orders are a natural model for the social hierarchies that may constrain "queue-like" rank-order data. However, the computational cost of counting the linear extensions of a general partial order on a ground set with more than a few…
This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a…
A {\it superpattern} is a string of characters of length $n$ that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length $k$ in a certain class. We prove structural and probabilistic results…