User contributions for 147.229.196.135

24 August 2020

• 16:4116:41, 24 August 2020 diff hist +3 Ordinal arithmetic →Factorization into primes: formatting
• 16:3716:37, 24 August 2020 diff hist +91 Ordinal arithmetic →Cantor normal form: explanation needed for definiton of addition and multiplication

19 August 2020

• 21:5421:54, 19 August 2020 diff hist −1,556 User talk:147.229.196.135 sod off please Tag: Blanking
• 18:3618:36, 19 August 2020 diff hist −1 Circle packing →Packings in the plane: triangular -> hexagonal, as is in the rest of the article
• 18:3518:35, 19 August 2020 diff hist −1 Circle packing →Unequal circles: triangular -> hexagonal, as is in the rest of the article

30 July 2020

• 22:3822:38, 30 July 2020 diff hist +16 Glossary of graph theory →C: added glossary links
• 22:3522:35, 30 July 2020 diff hist −2 Glossary of graph theory →E: removed accidental italics
• 18:5518:55, 30 July 2020 diff hist +518 Pigeonhole sort added Python implementation
• 18:4518:45, 30 July 2020 diff hist −26 Link/cut tree →Pseudocode of operations: made formatting more conformant with conventions
• 18:1118:11, 30 July 2020 diff hist −350 Pigeonhole sort removed Python implementation of counting sort (not pigeonhole sort), hidden TOC, improved wording
• 18:0318:03, 30 July 2020 diff hist −136 Pigeonhole sort →Example: Removed a confusing statement (Using what information? What would be exchanged?). At best, the statement is redundant, and does not belomg to the examples section...

26 July 2020

• 14:5914:59, 26 July 2020 diff hist +26 Dyck language →References: replaced <ref> with link Tag: references removed

21 July 2020

• 16:5316:53, 21 July 2020 diff hist +1 Link/cut tree →Pseudocode of operations: whitespace
• 12:5612:56, 21 July 2020 diff hist −39 Link/cut tree →Pseudocode of operations: fixed wonky font size and syntax highlighting
• 12:3812:38, 21 July 2020 diff hist −30 Link/cut tree moved pseudocode from side-box into separate section

18 July 2020

• 20:1120:11, 18 July 2020 diff hist +97 Talk:Polynomial →Discussion of Polynomial#Graphs: signature
• 20:1120:11, 18 July 2020 diff hist +176 Talk:Polynomial →Discussion of Polynomial#Graphs: reply
• 01:0101:01, 18 July 2020 diff hist +806 Talk:Polynomial →Edit to Arithmetic section: reply

15 July 2020

• 23:1023:10, 15 July 2020 diff hist +172 Narayana number →Rooted trees: added example of trees
• 20:0520:05, 15 July 2020 diff hist +11 Narayana number →Combinatorial interpretations: changed ordering of example to correspond with lattice paths example

11 July 2020

• 23:3623:36, 11 July 2020 diff hist −7 Hilbert's tenth problem →Applications: replaced italics by blockquote
• 23:2923:29, 11 July 2020 diff hist +3 Hilbert's tenth problem →Original formulation: unified quotes
• 21:4621:46, 11 July 2020 diff hist −35 Polynomial →Etymology: removing {{cn}} since OED citation is already present

10 July 2020

• 22:4522:45, 10 July 2020 diff hist +4 Quadratic residue code →Constructions: link to q.r.
• 22:0822:08, 10 July 2020 diff hist −17 Incompressibility method →History: removed useless link
• 21:3521:35, 10 July 2020 diff hist −703 Incompressibility method →Summary: description of Kolmogorov complexity is already given in the article on Kolmogorov complexity, no need to duplicate it here Tag: section blanking
• 21:2421:24, 10 July 2020 diff hist +7 Incompressibility method →History: weirdly placed ref, typo, notability
• 20:4320:43, 10 July 2020 diff hist +32 Probabilistic method →First example: added notelist, left side in last inequality
• 20:3820:38, 10 July 2020 diff hist +229 Probabilistic method →First example: left sides of formulas, some cleanup Tag: references removed
• 16:3316:33, 10 July 2020 diff hist −6 Hereditary property →In graph theory: remove bold, spelling, capitals
• 16:2516:25, 10 July 2020 diff hist −194 Distance-hereditary graph →Definition and characterization: removed duplicate entry

9 July 2020

• 14:2914:29, 9 July 2020 diff hist −1,087 Blum axioms →Notes: Removed incorrect and misleading statements: "There is an algorithm which, on input (M, x, n) decides if Φ(M, x) = n" -- such algorithm cannot exist, for it would solve the halting problem. "If M exceeds n steps, it can halt and reject, so there is no need to determine if M halts on x." -- the author of this statement is quite clearly not familiar with Blum axioms. Tag: section blanking
• 13:5613:56, 9 July 2020 diff hist −2 Glossary of graph theory →C: removed (apparently accidental) italics
• 10:4010:40, 9 July 2020 diff hist +318 Eulerian path →Fleury's algorithm: added citation Tarjan (1974); math formatting

8 July 2020

• 23:1623:16, 8 July 2020 diff hist +1,001 Cycle detection →Gosper's algorithm: added a short description, and information on the *actual* vs. advertised space/time complexity
• 03:4303:43, 8 July 2020 diff hist +442 Cycle detection →Gosper's algorithm: corrected time complexity, extended description

7 July 2020

• 14:3414:34, 7 July 2020 diff hist +576 Cycle detection →Gosper's algorithm: added more information

6 July 2020

• 17:0117:01, 6 July 2020 diff hist +2 Chvátal–Sankoff constants →Bounds: "Lueker (2010)" is nowere to be found and the sated result is given in Lueker (2009)
• 16:5716:57, 6 July 2020 diff hist −140 Chvátal–Sankoff constants Undid revision 966354272 by 147.229.196.135 (talk). The bounds are not for different values of k, but for different values of n, so only the last one is relevant Tag: Undo
• 16:4716:47, 6 July 2020 diff hist +140 Chvátal–Sankoff constants →Bounds: added upper bounds for \gamma_k according to Lueker (2009)
• 15:3815:38, 6 July 2020 diff hist +10 Chvátal–Sankoff constants →Bounds: included lower bound of \gamma_2 in the table; minor polishing
• 15:0515:05, 6 July 2020 diff hist +20 Chvátal–Sankoff constants →Definition and existence: minor polishing, added link

5 July 2020

• 23:3123:31, 5 July 2020 diff hist 0 Soft heap typo

4 July 2020

• 17:0317:03, 4 July 2020 diff hist +12 Soft heap minor improvements in wording
• 15:4315:43, 4 July 2020 diff hist +51 Dijkstra's algorithm →Dynamic programming perspective: fixed broken deep link

3 July 2020

• 23:3323:33, 3 July 2020 diff hist −31 Steinitz's theorem "with at least four vertices" is superfluous since it follows from being 3-vertex-connected and formed by the edges and vertices of three-dimensional convex polyhedra

2 July 2020

• 08:3508:35, 2 July 2020 diff hist +48 Dyck language →Properties
• 08:3208:32, 2 July 2020 diff hist +32 Narayana number →Combinatorial interpretations: rendering parentheses as code
• 02:2102:21, 2 July 2020 diff hist +9 Narayana number forgotten math formatting
• 02:1802:18, 2 July 2020 diff hist +1 Narayana number minute typographical improvements