6
votes
Accepted
Given any finite relation $R$ what is the cardinality of $\langle R\rangle=\{\underbrace{R\circ R\cdots \circ R}_{n\text{ times}}:n\in\mathbb{N}\}$?
$\newcommand{\N}{\mathbb{N}}$
Recall that Landau function $g(n)$ is the biggest possible $\mbox{lcm}$ of numbers wich sum up to $n$. It's asymptotic is well-studied.
I'll prove the following
$\textbf{...
5
votes
Why is Set, and not Rel, so ubiquitous in mathematics?
(With apologies for reviving an old question which already has many answers) here are two perspectives:
Ponder the fact that
$\mathsf{Set}$ is complete and cocomplete. $\mathsf{Rel}$ is not.
For ...
Community wiki
4
votes
Accepted
Characterizing relations by forbidden induced subsets
I am going to rephrase the question in terms of first order relational structures. I believe the answer will be sufficiently close to what you are looking for.
Let $L$ be the first order language ...
1
vote
Accepted
Generalizing cycle/pseudo-tree factorizations for permutations/transformations to arbitrary binary relations
The situation for binary relations is more complicated than for transformations. Of course your weak component relations can be further decomposed, but into what is less clear. The symmetric groups ...
1
vote
Why is Set, and not Rel, so ubiquitous in mathematics?
One way to approach the concepts of "elements" (or "its") and "distinctions"
(or "dits") is to start with the category-theoretic duality between subsets
and ...
Community wiki
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
relation-algebra × 12ct.category-theory × 3
graph-theory × 3
lo.logic × 3
semigroups-and-monoids × 2
big-picture × 2
co.combinatorics × 1
set-theory × 1
ca.classical-analysis-and-odes × 1
ds.dynamical-systems × 1
soft-question × 1
terminology × 1
symmetric-functions × 1
mapping-class-groups × 1
factorization × 1
directed-graphs × 1
heuristics × 1
semirings × 1
string-diagrams × 1
diagram-chase × 1