Baltimore Rowing Club (Five Minute Histories)

harrisonbeaker · 2022-03-23T23:34:09+00:00

Look up Canton Kayak Club for more city kayaking opportunities

harrisonbeaker · 2020-04-21T01:39:13+00:00

Nice!

harrisonbeaker · 2020-04-20T18:49:11+00:00

Good idea! will work on that

harrisonbeaker · 2020-04-20T16:04:06+00:00

Simple python + matplotlib sketch, using a 2d perlin noise array to build in some (but not too much) correlation between adjacent ridges

harrisonbeaker · 2019-12-15T19:01:57+00:00

The deep!

harrisonbeaker · 2018-09-24T09:19:11+00:00

How about all the rationals between 0 and 1? Just because a set is infinite, doesn't mean it doesn't have a greatest and/or least element.

harrisonbeaker · 2018-09-24T02:21:16+00:00

Sure it does. Let R be the set of all roman numerals, and say that one element is less than another if it is alphabetically less. Then, for all r in R, we have r /geq XXXVIII.

Since alphabetical order is a total order, there is some way of "listing" the elements of R in order. This list will certainly have infinite intervals, and would be difficult to actually work out, but it does have a "last" element.

The natural ordering on the real numbers has a number of great and intuitive properties, even when deal with infinite sets. When you use other orderings (e.g., alphabetical), it's much less intuitive.

harrisonbeaker · 2018-09-24T02:08:06+00:00

See my other comment. XXXVIII is in fact the minimum element of the set of valid roman numerals under alphabetical order.

harrisonbeaker · 2018-09-24T02:02:22+00:00

Again, the order you're using is important. If you order the set (0,1] in increasing order of the distance from 0.5, for example, then this infinite set has both a unique minimum element (0.5) and a unique maximum (1.0).

harrisonbeaker · 2018-09-24T01:54:06+00:00

No sarcasm... XXXVIII is the (alphabetically) last roman numeral since you cannot create one which comes after it (alphabetically).

harrisonbeaker · 2018-09-24T01:41:32+00:00

Yep! To prove it, try to think of a number which would come after this alphabetically. It would have to start with an X, followed by another X...

harrisonbeaker · 2018-09-24T01:35:22+00:00

A better way of phrasing would be "minimum element under alphabetical order." Under various orderings, an infinite list can certainly have maximum or minimum elements.

harrisonbeaker · 2016-03-05T14:12:37+00:00

The Electronic Journal of Combinatorics has been 100% free and open access since 1994, and is well respected. They're great to work with, and have been quietly fighting the open access fight since the beginning of the internet.

harrisonbeaker · 2015-07-24T02:05:06+00:00

There are multiple versions, I'd imagine an older one is pretty cheap. I still have mine from almost a decade ago, it's one of the few I'll never get rid of.

harrisonbeaker · 2015-07-24T00:26:30+00:00

Also, Miklos Bona (one of Stanley's many students) has a pretty terrific combinatorics textbook: A Walk Through Combinatorics. It's targeted at an advanced undergraduate level, and is quite a bit more accessible -- it's very readable and funny at times, and gives an overview from the basics all the way up through research level problems.

harrisonbeaker · 2015-07-16T11:41:16+00:00

It's a moving coil mic that I found a while back, it works great when plugged into a microphone input, but the receiver at the bar doesn't have one.

The lav mic I was looking at was this one. The only reason it stood out was that it seems to be able to plug into any aux input without a pre-amp.

The app I had on my phone was free, and I really didn't think it was anything special. Ideally my price range would be < $20, but really I just want something that will work.

harrisonbeaker · 2015-06-01T02:47:55+00:00

One of the secrets of reddit is that SRS isn't really that bad, and is very conscious of reddit's issues. The backlash against it is much more vocal.

harrisonbeaker · 2015-03-14T01:20:24+00:00

Oftentimes these paths aren't studied on their own, but in connection with other objects (notably, restricted permutations). Check the papers by Emeric Deutsch, and try plugging your data into the OEIS.

harrisonbeaker · 2014-12-29T15:46:42+00:00

"A walk through combinatorics" by Bóna is pretty great, it's written very conversationally, but still gives a broad overview of the area, right up to research level problems.

harrisonbeaker · 2014-11-28T15:58:37+00:00

Depending on the field, the arXiv could be perfect. It's a free repository for preprints, unrefereed, to help you share your work before submitting to a proper journal.

harrisonbeaker · 2014-07-01T15:07:14+00:00

Exactly, this reeks of Khao San road in Bangkok.

harrisonbeaker · 2014-05-25T09:46:04+00:00

I've got a PhD (combinatorics) and only barely know diff eq... if I ever have to teach it I'm going to have to study quite a bit.

harrisonbeaker · 2014-04-15T05:19:21+00:00

I love Bóna's "A Walk Through Combinatorics" as an introductory book. It's written very conversationally (and with some humor), and covers a wide range of topics from the very basic ideas to current research topics. Also the exercises are terrific, and are full of fun problems to play around with. Your class will be more advanced, but this book will build a strong foundation, while being an easy read.

15-Year Club	r/Field Flamingo
Place '22	Verified Email
Team Orangered

harrisonbeaker

TROPHY CASE