Explore >> Select a destination
|
You are here 
|
ellipticnews.wordpress.com | ||
| | | | |
mikespivey.wordpress.com
|
|
| | | | | A few months ago Mathematics Magazine published a paper of mine, "A Combinatorial View of Sums of Powers." In it I give a combinatorial interpretation for the power sum $latex \sum_{k=1}^n k^m$, together with combinatorial proofs of two formulas for this power sum. (An earlier version of some of the results in this paper actually... | |
| | | | |
mkatkov.wordpress.com
|
|
| | | | | Edit 6.6.2016. Premature optimization is a source for errors. The following is completely wrong. Would like to smoke the same thing again. Linear algebra does not work here. We need characterization of quotient space. What I do not understand is why fast methods are working modulo number itself, but not other prime numbers. Suppose we... | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
rapuran.wordpress.com
|
|
| | | More on Weekly Travel Theme | ||
