addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupshelp-with-circleimageimagesinstagramlinklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1ShapeoutlookpersonJoin Group on CardStartprice-ribbonShapeShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahoo

Combinatorics and Computing Power

Welcome to the DC/NoVA Papers We Love meetup! Celebrate Thanksgiving early by spending some time with fundamental computer science principles and puzzles.

Papers We Love is an international organization centered around the appreciation of computer science research papers. There's so much we can learn from the landmark research that shaped the field and the current studies that are shaping our future. Our goal is to create a community of tech professionals passionate about learning and sharing knowledge. Come join us!

New to research papers? Watch The Refreshingly Rewarding Realm of Research Papers by Sean Cribbs.

Ideas and suggestions are welcome–fill our our interest survey here and let us know what motivates you!


// Tentative Schedule

• 7:00-7:30–Networking and informal paper discussion

• 7:30-7:35–Introduction and announcements

• 7:35-8:40Combinatorics and Computing Power presented by David Bock (see papers below)

• 8:40-9:00–Networking and informal paper discussion


// Directions

Look for the white manor house just off Old Reston Ave. There's plenty of parking in the lot; after that, just follow the Papers We Love signs down the stairs and to the meeting room.

After the main event, anyone interested is welcome to join us at Reston Town Center (a very short walk/drive away) to continue the discussion.


// Papers

The talk today by David Bock will encompass two papers:

  • Combinatorial Analysis and Computers by Marshall Hall Jr. and Donald E. Knuth, California Institute of Technology

  • Computer Investigation of Orthogonal Latin Squares of Order Ten by E. T. Parker (not free to share)

Much of the talk will focus on the puzzle of orthogonal latin squares.

Join or login to comment.

  • Richard F.

    The best kind of talk; surprised by the material even having reviewed the source material.

    November 23

  • Lee

    If you get here after 7:30, I won't be standing by the door. Just knock or text me to come in! (The path is marked by PwL signs; if you haven't seen any, you're probably at the wrong door.)

    1 · November 23

  • Richard F.

    I got a hall pass to attend. Looking forward to it!

    1 · November 22

  • Paul

    I like combinatorics but the timing and distance aren't good for me. Perhaps a followup on this topic could be on a Sat afternoon (say at 3pm)

    November 21

  • David B.

    My current plan is not just a walkthrough of the topics in the paper, but an exploration on combinatorics - the several algorithms for combinations and permutations, and several games/puzzle based on them. Given the time frame, I'll skip a few deep topics in the papers in order to play a card game and work through a coding challenge or two.

    October 28

    • Ishi C.

      this is not really relevant since i can't make that, but i studied some statistical mechanics, where combinatorics is a basic element (maximum entropy, random walks, randowm graphs, spin models, TSP, partitions); alot of generating functions. I never was really competent at it except on a few applied problems in theoretical biology.

      November 18

10 went

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy