Scribd
Upload
649 views2 pages

Lexicographic Order

Lexicographic order is a natural ordering structure for the Cartesian product of ordered sets. It orders elements by comparing them left to right. When applied to numbers, it is increasing numerical order. When applied to subsets, subsets are ordered by their smallest elements. Reverse lexicographic order is derived from lexicographic order by inverting the external order of elements. Topological sorting is a linear ordering of vertices in a directed acyclic graph such that for every edge u v, u comes before v in the ordering. Ramsey theory studies combinatorial structures that exhibit order or structure as their size increases, such as ensuring monochromatic triangles in edge colorings of a complete graph.

Uploaded by

Ahmad Akhtar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
649 views2 pages

Lexicographic Order

Lexicographic order is a natural ordering structure for the Cartesian product of ordered sets. It orders elements by comparing them left to right. When applied to numbers, it is increasing numerical order. When applied to subsets, subsets are ordered by their smallest elements. Reverse lexicographic order is derived from lexicographic order by inverting the external order of elements. Topological sorting is a linear ordering of vertices in a directed acyclic graph such that for every edge u v, u comes before v in the ordering. Ramsey theory studies combinatorial structures that exhibit order or structure as their size increases, such as ensuring monochromatic triangles in edge colorings of a complete graph.

Uploaded by

Ahmad Akhtar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Lexicographic order

In mathematics, the lexicographic, lexicographical order or lex order, (also known as dictionary


order, alphabetical order or lexicographic product, is a natural order structure of the Cartesian
product of two or more ordered sets. 
More generally, one can define the lexicographic order on the Cartesian product of  ordered sets,
on the Cartesian product of a countably infinite family of ordered sets, and on the union of such
sets.
When applied to numbers, lexicographic order is increasing numerical order, i.e. increasing
numerical order (numbers read left to right). For example, the permutations of {1,2,3} in
lexicographic order are 123, 132, 213, 231, 312, and 321.

When applied to subsets, two subsets are ordered by their smallest elements. For example, the
subsets of {1,2,3} in lexicographic order are {}, {1}, {1,2}, {1,2,3}, {1,3}, {2}, {2,3}, {3}.

For example, using the natural order of the integers, the lexicographical ordering on the subsets of
three elements of S = {1, 2, 3, 4, 5, 6} is
123 < 124 < 125 < 126 < 134 < 135 < 136 < 145 < 146 < 156 <
234 < 235 < 236 < 245 < 246 < 256 < 345 < 346 < 356 < 456.
Reverse lexicographic order

The reverse lexicographic order is derived from the lexicographic order by inverting the external
order of elements.:

The following is a reverse lex ordering on subsets of size 3 from the set :
{1,2,3,4,5,6}:
456<356<346<345<256<246<245<236<235<234<156<146<145<136<135<134<126<125<124<123

Topological Sorting

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that
for every directed edge u v, vertex u comes before v in the ordering. Topological Sorting for a
graph is not possible if the graph is not a DAG.
For example, a topological sorting of the following graph is “5 4 2 3 1 0”. There can be more
than one topological sorting for a graph. For example, another topological sorting of the
following graph is “4 5 2 3 1 0”. The first vertex in topological sorting is always a vertex with
in-degree as 0 (a vertex with no incoming edges).
452310

542310

Ramsey Theory

The mathematical study of combinatorial objects in which a certain degree of order must occur
as the scale of the object becomes large. Ramsey theory is named after Frank Plumpton Ramsey,
who did seminal work in this area before his untimely death at age 26 in 1930.

The classical problem in Ramsey theory is the party problem, which asks the minimum number
of guests   that must be invited so that at least   will know each other or at least   will not
know each other. Here,   is called a Ramsey number.

A typical result in Ramsey theory states that if some mathematical object is partitioned into
finitely many parts, then one of the parts must contain a sub object of an interesting kind. For
example, it is known that if   is large enough and   is an  -dimensional vector space over
the field of integers, then however   is partitioned into   pieces, one of the pieces contains an
affine subspace of dimension  .

A typical result in Ramsey theory starts with some mathematical structure that is then cut into
pieces. How big must the original structure be in order to ensure that at least one of the pieces
has a given interesting property? This idea can be defined as partition regularity.
For example, consider a complete graph of order n; that is, there are n vertices and each vertex is
connected to every other vertex by an edge. A complete graph of order 3 is called a triangle.
Now colour each edge either red or blue. How large must n be in order to ensure that there is
either a blue triangle or a red triangle? It turns out that the answer is 6. Another way to express
this result is as follows: at any party with at least six people, there are three people who are all
either mutual acquaintances (each one knows the other two) or mutual strangers (each one does
not know either of the other two).

You might also like