This is the user sandbox of Tokenzero. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here. Other sandboxes: Main sandbox | Template sandbox Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

User:Jorge Stolfi/DoW Wall Street Journal: Wikipedia loosing Volunteers

Lemma. For any two elements a and b (st. ab=ba), of order i and j, there is an element of order lcm(i,j). Proof: We can assume ${\displaystyle i\bot j}$, since otherwise we can replace a with an element of order ${\displaystyle i/{\text{lcd}}(i,j)}$, namely ${\displaystyle a^{{\text{lcd}}(i,j)}}$. Consider ord(ab)=k. k divides ij. a^k=(b^{-1})^k where b^{-1} has also order j. ord(a^k) divides i = ord(b^k) = divides j, so a^k=b^k=1. So i divides k and j divides k.

• Degeneracy (graph theory) (e.g. O(d)-time adjacency structure).
• De Bruijn graph, Line graph
• non-trivial "densest subgraph" algorithms, see non-dynamic refs in Near-Optimal Fully Dynamic Densest Subgraph
• Wikipedia talk:WikiProject Mathematics/Typography
• max-width
• PageRank

• fokonolona (maybe also Balinese 'seka')
• Modern approaches to early Islamic history – The New Cambridge History of Islam

Cite error: There are <ref group=lower-alpha> tags or {{efn}} templates on this page, but the references will not show without a {{reflist|group=lower-alpha}} template or {{notelist}} template (see the help page).