Recent questions tagged partial-order - GATE Overflow

0 votes

2 answers

1

Hasse Doubt
what is the least upper bound of {a, b, c}?

asked May 23, 2019 in Set Theory & Algebra by aditi19 Active (5.2k points) | 131 views

0 votes

0 answers

2

POSET self doubt
What is dual of a POSET?

asked Apr 27, 2019 in Set Theory & Algebra by aditi19 Active (5.2k points) | 67 views

0 votes

1 answer

3

MadeEasy Test Series: Set Thoery & Algebra - Partial Order
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10} Consider the Following POSETs I. (Q ∩ [0, 1], ≤) II. (S, ≤) Which of the above POSETs are well ordered?

asked Jan 26, 2019 in Set Theory & Algebra by Badayayash Junior (989 points) | 158 views

+1 vote

0 answers

4

Partial and Total Order
The set of all English words ordered in a dictionary is ________ $A)$ not a poset $B)$ a poset but not totally ordered $C)$ a totally ordered set but not well ordered $D)$ a well ordered set

asked Oct 6, 2018 in Set Theory & Algebra by Lakshman Patel RJIT Veteran (59k points) | 108 views

0 votes

2 answers

5

Test Series
Is 1 a lattice?

asked Sep 1, 2018 in Set Theory & Algebra by Subham Nagar Active (1.1k points) | 166 views

+1 vote

2 answers

6

UGCNET-July-2018-II-90
Which of the following statements is true? $(Z, \leq)$ is not totally ordered The set inclusion relation $\subseteq$ is a partial ordering on the power set of a set S $(Z, \neq)$ is a poset The directed graph is not a partial order

asked Jul 13, 2018 in Others by Pooja Khatri Boss (10.9k points) | 448 views

+3 votes

1 answer

7

Kenneth Rosen Edition 6th Exercise 7.6 Example 21 (Page No. 519 )
How is this a lattice?

asked Jan 25, 2018 in Set Theory & Algebra by _jerry (341 points) | 174 views

+2 votes

1 answer

8

Ace Test series: Set Theory & Algebra - Partial Order
L={d,g,h,0} R={f,i,h,0} Am I doing it Correct?

asked Jan 7, 2018 in Set Theory & Algebra by Ananya Jaiswal 1 Active (2.2k points) | 75 views

+4 votes

1 answer

9

Self-Doubt
Is the Poset (Q,Less than or equal to) a well ordered set? Where Q denotes set of all rational numbers and relation R is less than or equal to.

asked Nov 9, 2017 in Set Theory & Algebra by Ayush Upadhyaya Boss (29.1k points) | 175 views

0 votes

0 answers

10

Kenneth Rosen Ex 7.6

asked Nov 9, 2017 in Set Theory & Algebra by Ayush Upadhyaya Boss (29.1k points) | 196 views

0 votes

0 answers

11

Self Doubt
Is the dual of TOSET, a TOSET always?

asked Nov 9, 2017 in Set Theory & Algebra by Ayush Upadhyaya Boss (29.1k points) | 72 views

+2 votes

2 answers

12

Set Relation
Answer please explain the ans. R is antisymmetric then aRb, bRa -> a=b so a-b=0 and 0 is not odd positive then how it is antisymmetric?

asked Aug 11, 2017 in Set Theory & Algebra by Dilip Puri (229 points) | 301 views

+3 votes

1 answer

13

Relation and Partial order
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people, if a is not taller than b?

asked Jul 7, 2017 in Set Theory & Algebra by ram_18051996 (317 points) | 332 views

0 votes

2 answers

14

UGCNET-Dec2010-II-3
A partially ordered set is said to be a lattice if every two elements in the set have A unique least upper bound A unique greatest lower bound Both $(A)$ and $(B)$ None of the above

asked Sep 5, 2016 in Discrete Mathematics by makhdoom ghaya Boss (30.8k points) | 458 views

+5 votes

1 answer

15

Discrete MAthematics question **** imp

asked Jul 4, 2016 in Set Theory & Algebra by LavTheRawkstar Active (3.8k points) | 1.4k views

0 votes

4 answers

16

Ace Test Series: Set Theory & Algebra - Partial Order
Argument: R2 is straight away eliminated. For R3, to satisfy Antisymmetric relation.. Say -2 and +2 satisfy it then +2 and -2 should not satisfy. But its not the case. Answer is given as C. Am I so blind that I couldn't figure out my mistake?

asked Jan 30, 2016 in Set Theory & Algebra by Tushar Shinde Active (2.2k points) | 211 views

+13 votes

4 answers

17

TIFR2014-B-16
Consider the ordering relation $x\mid y \subseteq N \times N$ over natural numbers $N$ such that $x \mid y$ if there exists $z \in N$ such that $x ∙ z = y$. A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It ... $\mid$ is a total order. $(N, \mid)$ is a complete lattice. $(N, \mid)$ is a lattice but not a complete lattice.

asked Nov 20, 2015 in Set Theory & Algebra by makhdoom ghaya Boss (30.8k points) | 987 views

+13 votes

3 answers

18

TIFR2014-B-15
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is true? $N^{*}$ is uncountable. $\leq_{p}$ is a total order. Every non-empty subset of ... Every non-empty subset of $N^{*}$ has a greatest lower bound. Every non-empty finite subset of $N^{*}$ has a least upper bound.

asked Nov 20, 2015 in Set Theory & Algebra by makhdoom ghaya Boss (30.8k points) | 759 views

+5 votes

3 answers

19

Boolean Algebra
Consider a Hasse Diagram for a Boolean Algebra of Order 3 What can we comment about it? How is it successfully able to represent the Boolean Algebra System? Is there an easy way to check for distributive lattice, or any other properties of a lattice? ... that one should provide a complete answer to all parts of the question. Whatever one can supply to support its answer is welcomed.

asked Nov 11, 2015 in Set Theory & Algebra by amarVashishth Boss (30.8k points) | 999 views

+2 votes

2 answers

20

Number of edges in the Hasse Diagram of a boolean algebra with 8 elements.

asked Nov 11, 2015 in Set Theory & Algebra by LeenSharma Boss (41.2k points) | 655 views

+13 votes

4 answers

21

TIFR2013-B-4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. Consider the set of ... are only $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.

asked Nov 6, 2015 in Set Theory & Algebra by makhdoom ghaya Boss (30.8k points) | 722 views

+9 votes

3 answers

22

TIFR2012-B-5
Let $R$ be a binary relation over a set $S$. The binary relation $R$ ... $\sqsubseteq $ is an equivalence relation and a well order. $\sqsubseteq $ is neither a partial order nor an equivalence relation.

asked Oct 31, 2015 in Set Theory & Algebra by makhdoom ghaya Boss (30.8k points) | 526 views

+20 votes

6 answers

23

GATE2007-IT-23
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division. $(0, 0) \in P.$ $(a, b) \in P$ if and only if $(a \% 10) \leq (b \% 10$) and $(\frac{a}{10},\frac{b}{10})\in P.$ Consider the ... $P$? (i) and (iii) (ii) and (iv) (i) and (iv) (iii) and (iv)

asked Oct 30, 2014 in Set Theory & Algebra by Ishrat Jahan Boss (16.3k points) | 2.6k views

+15 votes

3 answers

24

GATE1996-1.2
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is $3$ $4$ $9$ None of the above

asked Oct 9, 2014 in Set Theory & Algebra by Kathleen Veteran (52.2k points) | 1.4k views

+12 votes

3 answers

25

GATE1993-8.5
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above

asked Sep 30, 2014 in Set Theory & Algebra by Kathleen Veteran (52.2k points) | 1.4k views

+28 votes

2 answers

26

GATE1997-6.1
A partial order $≤$ is defined on the set $S=\left \{ x, a_1, a_2, \ldots, a_n, y \right \}$ as $x$ $\leq _{i}$ $a_{i}$ for all $i$ and $a_{i}\leq y$ for all $i$, where $n ≥ 1$. The number of total orders on the set S which contain the partial order $≤$ is $n!$ $n+2$ $n$ $1$

asked Sep 29, 2014 in Set Theory & Algebra by Kathleen Veteran (52.2k points) | 2.6k views

+20 votes

4 answers

27

GATE1998-11
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A $\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$ List the ordered pairs of the equivalence relations induced by $\Pi_1$. Draw the graph of the above equivalence relation ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.

asked Sep 26, 2014 in Set Theory & Algebra by Kathleen Veteran (52.2k points) | 2.1k views

+27 votes

1 answer

28

GATE2007-26
Consider the set $S =\{ a , b , c , d\}.$ Consider the following $4$ partitions $π_1,π_2,π_3,π_4$ on $S : π_1 =\{\overline{abcd}\},\quad π_2 =\{\overline{ab}, \overline{cd}\},$ ... $π_i \prec π_j$ if and only if $π_i$ refines $π_j$. The poset diagram for $(S',\prec)$ is:

asked Sep 22, 2014 in Set Theory & Algebra by Kathleen Veteran (52.2k points) | 4.1k views

Page:

Recent questions tagged partial-order

50,737 questions

57,317 answers

198,367 comments

105,100 users