DOCSLIB.ORG

Title Well-Ordered Monoids : Two Numerical Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Title Well-Ordered Monoids : Two Numerical Functions Well-ordered monoids : two numerical functions (Algebraic Title Systems, Formal Languages and Conventional and Unconventional Computation Theory) Author(s) Kobayashi, Yuji Citation 数理解析研究所講究録 (2004), 1366: 111-120 Issue Date 2004-04 URL http://hdl.handle.net/2433/25368 Right Type Departmental Bulletin Paper Textversion publisher Kyoto University 数理解析研究所講究録 1366 巻 2004 年 111-120 111 Well-0rdered monoids - two numerical functions - YUJI KOBAYASHI (小林ゆう治) Department of Information Science Toho University, Funabashi 274-8510, Japan (東邦大学理学部情報科学科) 1 Introduction Compatible well-0rders on monoids are used in the rewriting theory in algebra. They do not only guarantee the termination of reduction processes in a system [3], [4] but also are a base of the completion procedure [8]. In the Grobner base theory of polynomial rings, such orders on free commutative monoids, and in the rewriting theory of groups and monoids, such orders on free monoids play a crucial role (see [1], [11]). Compatible orders on a free commutative monoid are characterized by weights [15], but in contrast, compatible orders on a free monoid are very diverse and complicated ([2], [9], [10]). In this paper we study compatible well-0rders on monoids. A well-0rdered monoid is a monoid with a well-0rder that is strictly compatible with the operation of the underlying monoid. We introduce two numerical parameters associated with the order. The first one, which is discussed in Section 3, is related to weight functions on a monoid. The second, which is discussed in Section 4, comes ffom some effect of commutation of two elements in a monoid. With these parameters we study the ordered structure of well-0rdered monoids, especially in the case of tw0-generator monoids in the last section. 2 Preliminary A quasi-Order $[succeq]$ on a set $X$ is a reflexive transitive relation on $X$ such that $x[succeq] y$ or $y[succeq] x$ holds for any $x$ , $y\in X.$ For a quasi-0rder $[succeq]$ , define relations $\sim$ and $\succ$ as follows. $x\mathrm{r}$ $y[succeq] x$ For $x$ , $y\in X$ , $x\sim y$ if and only if $y$ and $y[succeq] x,$ and $x$ ? $y$ if does not hold, $\sim$ equivalently, $x[succeq] y$ but $x \oint y$ . We call $\succ$ the strict part of $[succeq]$ . It is easy to see that is an equivalence relation. A quasi-0rder $[succeq]$ is an order, if $\sim$ is the equality relation, that 12 is, $x\sim jl$ if and only if $x=y$ . A quasi-0rder $[succeq]$ is well-founded, if there is no infinite decreasing sequence $x_{1}\succ x_{2}\succ$ I $\cdot\cdot$ . A well-founded order is called a well-Order. Let $[succeq]_{1}$ and $[succeq]_{2}$ be two quasi-0rders on $X$ . The lexicographic composition $[succeq]_{1}$ $\circ[succeq]_{2}$ of $[succeq]_{1}$ and S2 is defined by $\Leftrightarrow$ $x[succeq]_{2}$ $x$ $([succeq]_{1}\circ[succeq]_{2})$ $y$ $xc_{\mathit{1}}$ $y$ , or $x\sim_{1}y$ and $y$ , $[succeq]_{1}$ $n$ where $\sim_{1}$ is the equivalence relation induced by . Similarly, for quasi-0rders $[succeq]_{1}$ $[succeq]_{n}$ $[succeq]_{1}\circ\cdots\circ \mathrm{r}_{n}$ , $\ldots,$ , the lexicographic composition is defined as follows. Let $[succeq]_{i}$ $\succ_{i}$ $x$ , $y\in X$ and $\sim_{i}$ be the equivalence relation induced by and be the strict part $x$ $([succeq]_{1}\circ\cdots\circ[succeq]_{n})$ $y$ $x\succ_{k}y$ of 7 $i$ . Then, , if $x\sim_{i}y$ for $i=1,$ .. ’ $k-1$ and for some $1\leq$ $\leq n,$ $n$ C or $x\sim:y$ for all $i=1$ , $\ldots$ , . $If[succeq]_{1}$ $[succeq]_{n}$ $then[succeq]_{1}\circ\cdots 0[succeq]_{n}$ Lemma 2.1. , \ldots , are (well-founded) quasi-Orders on X, is (well-founded) quasi-Orders on X. Let $[succeq]_{i}$ be a quasi-0rder on a set $X_{i}(i=1,2)$ . A mapping $f$ : $X_{1}arrow X_{2}$ is order preserving, if $x[succeq]$c1 il implies $f(x)\mathrm{r}_{2}f(y)$ for all $x,y\in X_{1}$ , equivalently, $f(x)r_{2}$ $f(y)$ $x[succeq]_{1}y\Leftrightarrow f(x)[succeq]_{2}$ $y\in X_{1}$ implies $x\succ_{1}$ $y$ . It is strictly order-preserving if $f(y)$ for all $x$ , . A (quasi- (resp. well-))ordered set is a pair $(X, [succeq])$ of a set $X$ and a (quasi- (resp. well-))order\succeq on $X$ . Quasi-0rdered sets $(X_{1}, [succeq]_{1})$ and $(X_{2}, [succeq]_{2})$ are isomorphic if there is a bijection $f$ : $X_{1}arrow X_{2}$ which is strictly order-preserving. A class of isomorphic well-0rdered sets is an order type. If the class of $(X, [succeq])$ is $\alpha$ , we say $(X, [succeq])$ has order type $\alpha$ . $\mathrm{N}$ Let $\geq$ be the ordinary order of the set of natural numbers. The order type of $\mathrm{N}^{n}$ $(\mathrm{N}, \geq)$ is denoted by $\omega$ . For $n\geq 2,$ let $\geq$ lex be the lexicographic order on , that is, $(x_{1}, \ldots, x_{n})>\mathrm{l}\mathrm{e}\mathrm{x}$ $(y_{1}, \ldots, y_{n})$ if there is A such that $1\leq k\leq n$ and $x_{1}=y_{1}$ , . , $x_{k-1}=$ $\omega^{n}$ $(\mathrm{N}^{n}, \geq_{1\mathrm{e}\mathrm{x}})$ $y_{k-1}$ and $x_{k}>y\mathrm{h}.$ The order type of is . Similarly we can consider the length-lexicographic order $\geq$ llex on the set $\mathrm{N}^{*}=\bigcup_{k=1}^{\infty}\mathrm{N}^{k}$ of all finite sequences of natural numbers; $(x_{1}, \ldots, x_{m})\geq$ llex $(y_{1}, \ldots, y_{n})$ $F\mathit{7}$ $m>n,$ or $m=n$ and $(x_{1}, \ldots, x_{m})\geq_{1\mathrm{e}\mathrm{x}}(y_{1}, \ldots, y_{m})$ . $\omega^{\omega}$ The ordered set $(\mathrm{N}^{*}, 2_{11\mathrm{e}\mathrm{x}})$ has order type . Let $M$ be a monoid, a semigroup with identity element 1. A quasi-0rder $[succeq]$ on $M$ is compatible if $x[succeq] y$ implies $zxw[succeq] zyw$ for any $x,y$, $z$ , $w\in M,$ or equivalently, $zxw$ ? $zyw$ implies $x\succ y.$ It is $st\sqrt.ctly$ compatible if $x\succ y\Leftrightarrow zxw\succ$ $zyw$ for $x[succeq] y\Leftrightarrow zxrn$ $[succeq] zyw$ $\mathrm{A}$ any $\mathrm{x},\mathrm{y}$ $z$ , $w\in M,$ or equivalently for any $x,y$ , $z,w\in M.$ pair $(M, [succeq])$ of a monoid and a compatible (quasi-)order\succeq 0n $M$ is $\mathrm{a}$ (quasi-)ordered monoid. Lemma 2.2. $Let[succeq] be$ a compatible quasi-Order on a monoid M. Then, the equivalence relation $\sim$ induced $by[succeq] is$ a congruence and the quotient monoid $M/\sim is$ an ordered monoid with the order induced $by[succeq]$ . $If[succeq] is$ strictly compatible (resp. well-founded) on $M$ , then so is the induced order $\mathrm{S}$ on $M/\sim$ . 113 Note that the induced order $[succeq]$ on the quotient $M/\sim$ in the above lemma is defined as $[x][succeq][y]\Leftrightarrow x[succeq] y$ for $x$ , $y\in M,$ where $[x]$ denotes the congruence class of $x$ . In this paper, by a well-Ordered monoid we mean an ordered monoid $(M, [succeq])$ with strictly compatible well-0rder $\mathrm{s}$ . As easily seen, a monoid $(M, [succeq])$ with compatible well-0rder $[succeq]$ is a well-0rdered monoid if it is cancellative. $If[succeq]_{1}$ $[succeq]_{n}$ Lemma 2.3. , \ldots , are (strictly) compatible quasi-Orders on M, then the lex- icographic compositions $[succeq]_{1}\circ\cdots\circ[succeq]_{n}$ is also a (strictly) compatible quasi-Order on M. A weight function of $M$ is a morphism of $M$ to the additive group $\mathbb{R}$ of real numbers; $f(xy)=f(x)+f(y)$ for $x,y\in M.$ Of course, the zero function 0 is a weight function. A weight function $f$ is non-negative (resp. positive) if $f(x)\geq 0$ (resp. $f(x)>0$) for all $x\in M\backslash \{1\}$ . If $M$ is generated by a subset $\Sigma$ , a weight function $f$ is determined by $\mathrm{X}$ the values $f(a)$ for generators $a\in$ C. In fact, for any $x=a_{1}\cdots$ $a_{n}$ with $a_{i}\in$ , we have $f(x)= \sum_{i}f(a_{i})$ . $M$ We define a relation $[succeq] f$ associated with a weight function $f$ on by $x[succeq]_{f}$ $y$ $\Leftrightarrow$ $f(x)\geq f(y)$ . Lemma 2.4. For a weight function $f$ of a monoid $M,$ $\mathrm{r}_{1}$ is a strictly compatible quasi- $by[succeq]_{f}$ $y\Leftrightarrow f(x)=f(y)_{J}$ order on M. The congruence $\sim_{f}$ induced is given by $x\sim f$ and the quotient $M/\sim f$ is a well-Ordered monoid. A quasi-0rder $[succeq]$ on a monoid $M$ is weight-sensitive, if there is a nonzero order- preserving weight function $f$ on $M$ , that is, $x[succeq] y$ implies $f(x)\geq f(y)$ , or equivalently, $[succeq]$ $f$ $f(x)>f(y)$ implies $x$ ? $y$ , for $x,y\in M.$ In this case we say is -sensitive specifying $f$ . If this $f$ is nonzero non-negative (resp. positive), $[succeq]$ is non-negatively (resp. positively) weight-sensitive. Lemma 2.5. Let $M$ be a finitely generated monoid. If $f$ is a non-negative weight function of $M$, the quasi-Order $[succeq]_{f}$ is well-founded. If $f$ is positive, any f-sensitive quasi-Order is well-founded.
Load more

Recommended publications
  • MA/CSSE 473 Day 15 Return Exam
    MA/CSSE 473 Day 15 Return Exam Student questions Towers of Hanoi Subsets Ordered Permutations MA/CSSE 473 Day 13 • Student Questions on exam or anything else •Towers of Hanoi • Subset generation –Gray code • Permutations and order 1 Towers of Hanoi •Move all disks from peg A to peg B •One at a time • Never place larger disk on top of a smaller disk •Demo •Code • Recurrence and solution Towers of Hanoi code Recurrence for number of moves, and its solution? 2 Permutations and order number permutation number permutation •Given a permutation 0 0123 12 2013 of 0, 1, …, n‐1, can 1 0132 13 2031 2 0213 14 2103 we directly find the 3 0231 15 2130 next permutation in 4 0312 16 2301 the lexicographic 5 0321 17 2310 sequence? 6 1023 18 3012 7 1032 19 3021 •Given a permutation 8 1203 20 3102 of 0..n‐1, can we 9 1230 21 3120 determine its 10 1302 22 3201 11 1320 23 3210 permutation sequence number? •Given n and i, can we directly generate the ith permutation of 0, …, n‐1? Subset generation • Goal: generate all subsets of {0, 1, 2, …, N‐1} • Bottom‐up (decrease‐by‐one) approach •First generate Sn‐1, the collection of all subsets of {0, …, N‐2} •Then Sn = Sn‐1 { Sn‐1 {n‐1} : sSn‐1} 3 Subset generation • Numeric approach: Each subset of {0, …, N‐1} corresponds to an bit string of length N where the ith bit is 1 iff i is in the subset. •So each subset can be represented by N bits.
    [Show full text]
  • 1 (15 Points) Lexicosort
    CS161 Homework 2 Due: 22 April 2016, 12 noon Submit on Gradescope Handed out: 15 April 2016 Instructions: Please answer the following questions to the best of your ability. If you are asked to show your work, please include relevant calculations for deriving your answer. If you are asked to explain your answer, give a short (∼ 1 sentence) intuitive description of your answer. If you are asked to prove a result, please write a complete proof at the level of detail and rigor expected in prior CS Theory classes (i.e. 103). When writing proofs, please strive for clarity and brevity (in that order). Cite any sources you reference. 1 (15 points) LexicoSort In class, we learned how to use CountingSort to efficiently sort sequences of values drawn from a set of constant size. In this problem, we will explore how this method lends itself to lexicographic sorting. Let S = `s1s2:::sa' and T = `t1t2:::tb' be strings of length a and b, respectively (we call si the ith letter of S). We say that S is lexicographically less than T , denoting S <lex T , if either • a < b and si = ti for all i = 1; 2; :::; a, or • There exists an index i ≤ min fa; bg such that sj = tj for all j = 1; 2; :::; i − 1 and si < ti. Lexicographic sorting algorithm aims to sort a given set of n strings into lexicographically ascending order (in case of ties due to identical strings, then in non-descending order). For each of the following, describe your algorithm clearly, and analyze its running time and prove cor- rectness.
    [Show full text]
  • Total Ordering on Subgroups and Cosets
    Total Ordering on Subgroups and Cosets ∗ Alexander Hulpke Steve Linton Department of Mathematics Centre for Interdisciplinary Research in Colorado State University Computational Algebra 1874 Campus Delivery University of St Andrews Fort Collins, CO 80523-1874 The North Haugh [email protected] St Andrews, Fife KY16 9SS, U.K. [email protected] ABSTRACT permutation is thus the identity element ( ).) In the sym- We show how to compute efficiently a lexicographic order- metric group Sn this comparison of elements takes at most ing for subgroups and cosets of permutation groups and, n point comparisons. In a similar way a total order on a field F induces a to- more generally, of finite groups with a faithful permutation n representation. tal lexicographic order on the n-dimensional row space F which in turn induces a total (again lexicographic) order on the set F n×n of n×n matrices with entries in F . A compar- Categories and Subject Descriptors ison of two matrices takes at most n2 comparisons of field F[2]: 2; G [2]: 1; I [1]: 2 elements. As a third case we consider the automorphism group G of a (finite) group A. A total order on the elements of A again General Terms induces a total order on the elements of G by lexicographic Algorithms comparison of the images of a generating list L of A. (It can be convenient to take L to be sorted as well. The most Keywords “generic” choice is probably L = A.) Comparison of two automorphisms will take at most |L| comparisons of images.
    [Show full text]
  • Implementing Language-Dependent Lexicographic Orders in Scheme
    Implementing Language-Dependent Lexicographic Orders in Scheme Jean-Michel HUFFLEN LIFC (EA CNRS 4157) — University of Franche-Comté 16, route de Gray — 25030 BESANÇON CEDEX — FRANCE Abstract algorithm related to Unicode, an industry standard designed to al- The lexicographical order relations used within dictionaries are low text and symbols from all of the writing systems of the world to language-dependent, and we explain how we implemented such be consistently represented [2006]. Our method can be generalised orders in Scheme. We show how our sorting orders are derived to other alphabets. In addition, let us mention that if a document from the Unicode collation algorithm. Since the result of a Scheme cites some works written using the Latin alphabet and some writ- function can be itself a function, we use generators of sorting ten using another alphabet (Arabic, Cyrillic, . ), they are usually orders. Specifying a sorting order for a new natural language has itemised in two separate bibliography sections. So this limitation is been made as easy as possible and can be done by a programmer not too restrictive within MlBIBTEX’s purpose. who just has basic knowledge of Scheme. We also show how The next section of this article is devoted to some examples Scheme data structures allow our functions to be programmed in order to give some idea of this task’s complexity. We briefly efficiently. recall the principles of the Unicode collation algorithm [2006a] in Section 3 and explain how we adapted it in Scheme in Section 4. Keywords Lexicographical order relations, collation algorithm, Section 5 discusses some points, gives some limitations of our Unicode, MlBIBTEX, Scheme.
    [Show full text]
  • A Versatile Algorithm to Generate Various Combinatorial Structures
    A Versatile Algorithm to Generate Various Combinatorial Structures Pramod Ganapathi,∗ Rama B† August 23, 2018 Abstract Algorithms to generate various combinatorial structures find tremen- dous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl [24] that generates all unique permutations of a list of elements which possibly contains repetitions, taking some or all of the elements at a time, in any imposed order. The algorithm uses an auxiliary array that maintains the number of occurrences of each unique element in the input list. We provide a proof of correctness of the algo- rithm. We then show how one can efficiently generate other combinatorial structures like combinations, subsets, n-Parenthesizations, derangements and integer partitions & compositions with minor changes to the same algorithm. 1 Introduction Algorithms which generate combinatorial structures like permutations, combi- nations, etc. come under the broad category of combinatorial algorithms [16]. These algorithms find importance in areas like Cryptography, Molecular Bi- ology, Optimization, Graph Theory, etc. Combinatorial algorithms have had a long and distinguished history. Surveys by Akl [1], Sedgewick [27], Ord Smith [21, 22], Lehmer [18], and of course Knuth’s thorough treatment [12, 13], arXiv:1009.4214v2 [cs.DS] 30 Sep 2010 successfully capture the most important developments over the years. The lit- erature is clearly too large for us to do complete justice. We shall instead focus on those which have directly impacted our work. The well known algorithms which solve the problem of generating all n! per- mutations of a list of n unique elements are Heap Permute [9], Ives [11] and Johnson-Trotter [29].
    [Show full text]
  • A New Method for Generating Permutations in Lexicographic Order
    科學與工程技術期刊 第五卷 第四期 民國九十八年 21 Journal of Science and Engineering Technology, Vol. 5, No. 4, pp. 21-29 (2009) A New Method for Generating Permutations in Lexicographic Order TING KUO Department of International Trade, Takming University of Science and Technology No. 56, Sec.1, HuanShan Rd., Neihu, Taipei, Taiwan 11451, R.O.C. ABSTRACT First, an ordinal representation scheme for permutations is defined. Next, an “unranking” algorithm that can generate a permutation of n items according to its ordinal representation is designed. By using this algorithm, all permutations can be systematically generated in lexicographic order. Finally, a “ranking” algorithm that can convert a permutation to its ordinal representation is designed. By using these “ranking” and “unranking” algorithms, any permutation that is positioned in lexicographic order, away from a given permutation by any specific distance, can be generated. This significant benefit is the main difference between the proposed method and previously published alternatives. Three other advantages are as follows: First, not being restricted to sequentially numbering the n items from one to n, this method can even handle items with non-numeral marks without the aid of mapping. Second, this approach is well suited to a wide variety of permutation generations such as alternating permutations and derangements. Third, the proposed method can also be extended to a multiset. Key Words: lexicographic order, ordinal representation, permutation, ranking, unranking 一個依字母大小序產生排列的新方法 郭定 德明財經科技大學國際貿易系 11451 臺北市內湖區環山路一段 56 號 摘 要 首先，我們為排列問題定義一個順序表示法。第二，我們設計一個定序演算法，它可以根 據一個 n 項目的順序表示產生其對應的排列。藉由此演算法，我們可以依字母大小序地系統化 產生所有的 n 項目排列。第三，我們設計一個解序演算法，它可以根據一個 n 項目的排列產生 其對應的順序表示。藉由此兩個演算法，我們可以產生離一個 n 項目的排列任意距離，依字母 大小序而言，的另一個排列；此特點是我們的方法與其它研究最不同的地方。我們的方法還有 另三項優點如下：第一，它不限制於必須是 1 至 n 的連續數目，甚至於可以無需藉由轉換而直 接處理非數字的排列。第二，它也很適合用在其它的排列問題上，例如產生交替排列與錯位排 列。第三，它也可擴展至針對含有重複元素的集合之排列問題上。 22 Journal of Science and Engineering Technology, Vol.
    [Show full text]
  • Implementing Language-Dependent Lexicographic Orders in Scheme Jean-Michel Hufflen
    Implementing Language-Dependent Lexicographic Orders in Scheme Jean-Michel Hufflen To cite this version: Jean-Michel Hufflen. Implementing Language-Dependent Lexicographic Orders in Scheme. Proc.of the 8th Workshop on and , 2007, Germany. pp.139–144. hal-00661897 HAL Id: hal-00661897 https://hal.archives-ouvertes.fr/hal-00661897 Submitted on 20 Jan 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Implementing Language-Dependent Lexicographic Orders in Scheme Jean-Michel HUFFLEN LIFC (EA CNRS 4157) — University of Franche-Comté 16, route de Gray — 25030 BESANÇON CEDEX — FRANCE huffl[email protected] Abstract algorithm related to Unicode, an industry standard designed to al- The lexicographical order relations used within dictionaries are low text and symbols from all of the writing systems of the world language-dependent, and we explain how we implemented such to be consistently represented [2006]. Our method can be gener- orders in Scheme. We show how our sorting orders are derived alised to other alphabets than the Latin one. In addition, let us men- from the Unicode collation algorithm. Since the result of a Scheme tion that if a document cites some works written using the Latin function can be itself a function, we use generators of sorting alphabet and some written using another alphabet (Arabic, Cyril- orders.
    [Show full text]
  • CSI 2101 / Partial Orderings (§8.6)
    CSI 2101 / Partial Orderings (§8.6) Introduction Lexicographic Order Maximal/minimal, greatest/least elements Lattices Topological Sorting 1 Partial Orderings - Introduction There is a total ordering for numbers: we can compare any two numbers and decide which is “larger or equal than”. What about comparing strings? Or sets? Or formulas? We can come up with a scheme to compare all strings • lexicographic ordering, will talk about it shortly However, quite often what we have is that some objects are genuinely incomparable, while for others we can say that a is less or equal then b. •In an organization: A being the boss of B •For sets: A being the subset of B Captured in the notion of partial ordering 2 Partial Ordering – Definition & Examples Definition: Let S be a set and R be a binary relation on S. If R is reflexive, antisymmetric and transitive, then we say that R is a partial ordering of S. The set S together with the partial ordering R is called a poset (partially ordered set) and denoted by (S,R). Members of S are called elements of the poset. We will often use infix notation a R b to denote R(a,b) = T Example 1: S is a set of sets, and the partial order is a set inclusion ⊆ Example 2: S is a set of integers, and R is ‘divides’: aRb ≡ a|b Example 3: S is a set of formulae, aRb iff a is a sub-formula of b Example 4: S is the set of tasks to be scheduled, aRb means “a must finish before b can run” 3 Partial Ordering - Comparability We can have the same set S with different relation R: Example 5: S is a set of strings, aRb iff a is a prefix of b Example 6: S is a set of strings, aRb iff a is a substring of b Example 7: S is a set of formulae, aRb iff (b → a) Example 8: S is a set of integers, R is the normal ≤ The last one is different then previous ones.
    [Show full text]
  • Lexicographic Order These Notes Are About an Example That Isn't Directly
    Lexicographic order These notes are about an example that isn't directly relevant to the material in Rudin, but which seems to me to shed some light on the \least upper bound" prop- erty of the real numbers. You might read it as a \lite" version of the construction of the real numbers in the appendix to chapter 1. A side benefit is that some of the ideas are well-known to you but difficult to state formally; so you'll get some practice in interpreting formally complicated statements. Definition 1. A word is a non-empty string of letters (like supercalifragilistic- expialidocious or mpqskhdg or r). A little more formally, a word is a symbol X = x1x2 · · · xr; where r is a positive integer and each xi is an element of the set fa; b; c; : : : ; x; y; zg. The integer r is called the length of the word X. The world of words is a fascinating one, but we're going to look only at one small part of it. Definition 2. The lexicographic order on words is the relation defined by X < Y if X comes (strictly) before Y in the dictionary. Here's a more formal definition. First we order the alphabet in the obvious way: a < b < c < d < · · · < w < x < y < z: Now suppose that X = x1 · · · xr; Y = y1 · · · ys are two words. Then X < Y if and only if there is a non-negative integer t with the following properties: i) t ≤ r and t ≤ s; ii) for every positive integer i ≤ t, xi = yi; and iii) either xt+1 < yt+1, or t = r and t < s.
    [Show full text]
  • Chapter 8 Ordered Sets
    Chapter VIII Ordered Sets, Ordinals and Transfinite Methods 1. Introduction In this chapter, we will look at certain kinds of ordered sets. If a set \ is ordered in a reasonable way, then there is a natural way to define an “order topology” on \. Most interesting (for our purposes) will be ordered sets that satisfy a very strong ordering condition: that every nonempty subset contains a smallest element. Such sets are called well-ordered. The most familiar example of a well-ordered set is and it is the well-ordering property that lets us do mathematical induction in In this chapter we will see “longer” well ordered sets and these will give us a new proof method called “transfinite induction.” But we begin with something simpler. 2. Partially Ordered Sets Recall that a relation V\ on a set is a subset of \‚\ (see Definition I.5.2 ). If ÐBßCÑ−V, we write BVCÞ An “order” on a set \ is refers to a relation on \ that satisfies some additional conditions. Order relations are usually denoted by symbols such asŸ¡ß£ , , or . Definition 2.1 A relation V\ on is called: transitive ifÀ a +ß ,ß - − \ Ð+V, and ,V-Ñ Ê +V-Þ reflexive ifÀa+−\+V+ antisymmetric ifÀ a +ß , − \ Ð+V, and ,V+ Ñ Ê Ð+ œ ,Ñ symmetric ifÀ a +ß , − \ +V, Í ,V+ (that is, the set V is “symmetric” with respect to thediagonal ? œÖÐBßBÑÀB−\ש\‚\). Example 2.2 1) The relation “œ\ ” on a set is transitive, reflexive, symmetric, and antisymmetric. Viewed as a subset of \‚\, the relation “ œ ” is the diagonal set ? œÖÐBßBÑÀB−\×Þ 2) In ‘, the usual order relation is transitive and antisymmetric, but not reflexive or symmetric.
    [Show full text]
  • Partial Order Relations
    Partial Order Relations We defined three properties of relations: reflexivity, symmetry and transitivity. A fourth property of relations is anti-symmetry. Definition of Antisymmetry:: Let R be a relation on a set A, R is antisymmetric if , and only if, for all a and b in A, if a R b and b R a then a=b. Testing for Antisymmetry of finite Relations: Let R1 and R2 be the relations on {0, 1, 2} defined as follows: a- R1= { (0,2 ), (1, 2), (2, 0)} b- R2 = { (0,0), (0, 1), (0, 2), (1, 1), (1, 2)} Draw a directed graph for R1 and R2 and indicate which relation is antisymmetric? a- R1 is not antisymmetric b- R2 is antisymmetric Testing for Antisymmetry of “Divides” relations. Let R1 be the “divides” relation on the set of all positive integers, and let R2 be the “divides” relation on the set of all integers. + For all a, b ∈ Z , a R1 b ⇔ a | b For all a, b ∈ Z, a R2 b ⇔ a | b a- Is R1 antisymmetric ? Prove or give a counterexample b- Is R2 antisymmetric ? Prove or give a counter example. Solution: -R1 is antisymmetric -R2 is not antisymmetric Partial Order Relations: Let R be a binary relation defined on a set A. R is a partial order relation if, and only if, R is reflexive, antisymmetric and transitive. Two fundamental partial order relations are the “less than or equal to” relation on a set of real numbers and the “subset” relation on a set of sets. The “Subset” Relation: Let A be any collection of sets and define the subset relation ⊆ on A as follows: For all U, V ∈ A U ⊆ V ⇔ for all x, if x ∈ U then x ∈ V.
    [Show full text]
  • A Study on Collation of Languages from Developing Asia
    A Study on Collation of Languages from Developing Asia Sarmad Hussain Nadir Durrani Center for Research in Urdu Language Processing National University of Computer and Emerging Sciences www.nu.edu.pk www.idrc.ca Published by Center for Research in Urdu Language Processing National University of Computer and Emerging Sciences Lahore, Pakistan Copyrights © International Development Research Center, Canada Printed by Walayatsons, Pakistan ISBN: 978-969-8961-03-9 This work was carried out with the aid of a grant from the International Development Research Centre (IDRC), Ottawa, Canada, administered through the Centre for Research in Urdu Language Processing (CRULP), National University of Computer and Emerging Sciences (NUCES), Pakistan. ii Preface Defining collation, or what is normally termed as alphabetical order or less frequently as lexicographic order, is one of the first few requirements for enabling computing in any language, second only to encoding, keyboard and fonts. It is because of this critical dependence of computing on collation that its definition is included within the locale of a language. Collation of all written languages are defined in their dictionaries, developed over centuries, and are thus very representative of cultural tradition. However, though it is well understood in these cultures, it is not always thoroughly documented or well understood in the context of existing character encodings, especially the Unicode. Collation is a complex phenomenon, dependent on three factors: script, language and encoding. These factors interact in a complicated fashion to uniquely define the collation sequence for each language. This volume aims to address the complex algorithms needed for sorting out the words in sequence for a subset of the languages.
    [Show full text]