Let a height function f be a real valued function on R 2 . A connected subset of R 2 is called an island, if there is a water level such that H is an island in the classical sense. We show that an island system is always laminar. Among others, in this paper we prove that the cardinality of a maximal laminar system is either countable or continuum.
Abstract. In this note we give an asymptotic estimate for the number of monounary algebras of given size.
Abstract. We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve this result by showing that there exist exactly five closed permutation groups which contain the automorphism group of the random partial order, and thus expose all symmetries of this structure. Our classification lines up with previous similar classifications, such as the structures definable in the random graph or the order of the rationals; it also provides further evidence for a conjecture due to Simon Thomas which states that the number of structures definable in a homogeneous structure in a finite relational language is, up to first-order interdefinability, always finite. The method we employ is based on a Ramsey-theoretic analysis of functions acting on the random partial order, which allows us to find patterns in such functions and make them accessible to finite combinatorial arguments. Reducts of homogeneous structuresThe random partial order P := (P ; ≤) is the unique countable partial order which is universal in the sense that it contains all countable partial orders as induced suborders and which is homogeneous, i.e., any isomorphism between two finite induced suborders of P extends to an automorphism of P. Equivalently, P is the Fraïssé limit of the class of finite partial orders -confer the textbook [Hod97].As the "generic order" representing all countable partial orders, the random partial order is of both theoretical and practical interest. The latter becomes in particular evident with the recent applications of homogeneous structures in theoretical computer science; see for example [BP11a,BP11b,BK09,Mac11]. It is therefore tempting to classify all structures which are first-order definable in P, i.e., all relational structures on domain P all of whose relations can be defined from the relation ≤ by a first-order formula. Such structures have been called reducts of P in the literature [Tho91,Tho96]. It is the goal of the present paper to obtain such a classification up to first-order interdefinability, that is, we consider two reducts Γ, Γ ′ equivalent iff they are reducts of one another. We will show that up to this equivalence, there are precisely five reducts of P.Our result lines up with a number of previous classifications of reducts of similar generic structures up to first-order interdefinability. The first non-trivial classification of this kind was obtained by Cameron [Cam76] for the order of the rationals, i.e., the Fraïssé limit of the class of finite linear orders; he showed that this order has five reducts up to first-order interdefinability. Thomas [Tho91] proved that the random graph has five reducts up to firstorder interdefinability as well, and later generalized this result by showing that for all k ≥ 2, Date: February 26, 2018. The second author is grateful for support through an APART-fellowship of the Austrian Academy of Sciences.
Piecewise testable languages are widely studied area in the theory of automata. We analyze the algebraic properties of these languages via their syntactic monoids. In this paper a normal form is presented for 2-and 3-piecewise testable languages and a log-asymptotic estimate is given for the number of words over these monoids.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.