# Tagged Questions

83 views

### Some equivalence relation from flipping binary trees

I know almost nothing in combinatorics, so this question might be very easy, or well-known. Fix a number $n$. We will consider rooted planar binary trees with $n$ leaves. We will distinguish between ...
196 views

Recently I had the problem to find an estimate of a $2$-norm of a block partitioned matrix $$A = \begin{bmatrix} A_{11} & \cdots & A_{1n} \\ \vdots & \ddots & \vdots \\ A_{n1} ... 1answer 265 views ### Is this alternative definition of 'equivalence relation' well-known? useful? used? I discovered that$$R \textrm{ is an equivalence relation on } A \;\equiv\; \langle \forall a,b \in A :: aRb \:\equiv\: \langle \forall x \in A :: aRx \equiv bRx\rangle \rangle The nice thing about ...
Define the relation $x \sim y$ where $x$ and $y$ are real numbers to hold if and only if there exist natural numbers $n$ and $m$ such that $x^n = y^m$. It is easy to see that $\sim$ is an equivalence ...
Given a function $f : X \to Y$, an equivalence relation $\sim_X$ on $X$ and an equivalence relation $\sim_Y$ on $Y$, there is a notion of compatibility'' between $f$, $\sim_X$ and $\sim_Y$ if the ...