Transitive Relations on Finite Sets of Size n

  • Context: Graduate 
  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Relations
Click For Summary
SUMMARY

The discussion centers on the enumeration of transitive binary relations on finite sets of size n. It establishes that there is no direct formula available for calculating the number of such relations. Participants referenced a resource from Inria that provides further insights into the topic, specifically focusing on posets and their properties.

PREREQUISITES
  • Understanding of binary relations
  • Familiarity with transitive properties in mathematics
  • Basic knowledge of finite set theory
  • Awareness of partially ordered sets (posets)
NEXT STEPS
  • Research the properties of transitive relations in depth
  • Explore the concept of partially ordered sets (posets)
  • Study combinatorial enumeration techniques
  • Investigate advanced topics in set theory related to finite sets
USEFUL FOR

Mathematicians, computer scientists, and students studying discrete mathematics or combinatorics who are interested in the properties and enumeration of relations on finite sets.

Dragonfall
Messages
1,023
Reaction score
5
How many transitive binary relations are there on a finite set of size n?
 
Physics news on Phys.org
There's no direct formula to calculate that, as far as I know. See http://algo.inria.fr/csolve/posets.pdf for some details.
 
Last edited by a moderator:

Similar threads

  • · Replies 1 ·
Replies
1
Views
485
  • · Replies 3 ·
Replies
3
Views
394
  • · Replies 10 ·
Replies
10
Views
2K
Replies
2
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K