Related papers: On level-induced suborders
We give sufficient conditions to find all subtypes isomorphic to a subtype in a finite generalized ordered type.
We do not attempt to provide yet another definition of selforganization, but explore the conditions under which we can model a system as self-organizing. These involve the dynamics of entropy, and the purpose, aspects, and description level…
In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other…
Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…
We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
For a category with subobjects and factorization, here we describe a new category which we call category of chain bundles and it is shown that this new category is also a category with subobjects and admits factorization under certain…
We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…
In this paper, we will study on some topologies induced by order convergences in a vector lattice. We will investigate the relationships of them.
We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…
The purpose of this note is to show that the subvarieties of small degree inside a general hypersurface of large degree come from intersecting with linear spaces or other varieties.
This paper concerns instruction sequences that contain probabilistic instructions, i.e. instructions that are themselves probabilistic by nature. We propose several kinds of probabilistic instructions, provide an informal operational…
In this paper, we study properties of nodal orders defined over arbitrary base fields. In particular we give a classification of complete real nodal orders.
In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…
Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view,…
We study topological factors of rank-one subshifts and prove that those factors that are themselves subshifts are either finite or isomorphic to the original rank-one subshifts. Thus, we completely characterize the subshift factors of…
In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…
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…