AbstractIn this paper we show some kind of isomorphism theorem for ordered sets under antiorders. Let (𝑋,=𝑥, ≠𝑥, 𝛼) and (𝑌,=𝑦 , ≠𝑦 , 𝛽) be ordered sets under antiorders, where the apartness ...
We work with the $E_1$-term for spheres and the stable Moore space, given by the $\Lambda$-algebra at odd primes. Writing $W(n) = \Lambda(2n + 1)/\Lambda(2n - 1)$ and ...
4monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback