Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Analytic combinatorics

    Analytic combinatorics

    Philippe Flajolet · 2009

    Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

    Mathematics
    Open LibraryAmazon
    Stats for nerds
    8recommend
    16mentions
    14people
    2009–2025years
    50% recommend50% neutral

    Mentions per year

    200920112013201520172019202120232025

    What Hacker News says

    1. jmountMay 2025
      As a fan of combinatorics, I love people looking into the topic. Though most of what a programmer would find useful are approximations or trends which are handled well by the Master theorem ( https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_al... ). For those deeply interested in the deep math of combinatorics I recommend Flajolet, Sedgewick, *Analytic Combinatorics, Cambridge 2009.
      thread
    2. JPC21Oct 2024
      Generating functions are also a great tool in combinatorics (see for example the book Analytic Combinatorics by Flajolet and Sedgewick).
      thread
    3. pedrothOct 2024
      "I have long struggled with understanding what probability-generating functions are and how to intuit them. There were two pieces of the puzzle missing for me, and we’ll go through both in this article."

      Great article. For more, I really recommend Analytic Combinatorics:

      https://ac.cs.princeton.edu/home/

      thread
    4. selimthegrimDec 2022
      Flajolet and Sedgewick have a nice book on Analytic Combinatorics that covers this
      thread
    5. milemiJul 2019
      I warmly recommend Analytic Combinatorics by Flajolet & Sedgewick, freely downloadable at http://algo.inria.fr/flajolet/Publications/book.pdf I like the books you mentioned, but this one I love.
      thread
    6. svatMar 2019
      Here's a fun trick I learned from Flajolet and Sedgewick's Analytic Combinatorics (available online, page 52). I imagine it will seem incredible when tried with an actual classroom:

      > Révész in [Strong theorems on coin tossing] tells the following amusing story attributed to T. Varga: “A class of high school children is divided into two sections. In one of the sections, each child is given a coin which he throws two hundred times, recording the resulting head-and-tail sequence on a piece of paper. In the other section, the children do not receive coins, but are told instead that they should try to write down a ‘random’ head-and-tail sequence of length two hundred. Collecting these slips of paper, [a statistician] then tries to subdivide them into their original groups. Most of the time, he succeeds quite well.”

      > The statistician’s secret is [...] in a randomly produced sequence of length 200, there are usually runs of length 6 or more: the probability of the event turns out to be close to 97%. On the other hand most children (and adults) are usually afraid of writing down runs longer than 4 or 5 as this is felt as strongly “non-random”. The statistician simply selects the slips that contain runs of length 6 or more as the true random ones. Voilà!

      ----

      Obviously, the way to beat this site (or the above classroom trick) would be to use "true" random numbers. But if one doesn't have access to coins or computers, it raises the question: what is a good way to generate a long sequence of reasonably random coin flips in one's head? For example, if you've memorized many digits of pi or e or some such "believed to be normal" constant, you could use whether each digit is odd or even (or maybe even something like throw away 8 and 9, and read each remaining digit in octal to get 3 random bits). But that only gets you so far...

      thread

    Related

    Cover of ADDITIVE COMBINATORICS
    2009–2019

    ADDITIVE COMBINATORICS

    Terence Tao
    3 recommend · 3
    Cover of An introduction to the analysis of algorithms
    2013–2025

    An introduction to the analysis of algorithms

    Robert Sedgewick
    3 recommend · 6
    GeneratingfunctionologyHerbert S. Wilf
    2009–2025

    Generatingfunctionology

    Herbert S. Wilf
    9 recommend · 16
    Cover of A Walk Through Combinatorics
    2019–2026

    A Walk Through Combinatorics

    Miklos Bona
    4 recommend · 4
    Extremal combinatoricsStasys Jukna
    2014–2021

    Extremal combinatorics

    Stasys Jukna
    2 recommend · 2
    Cover of Enumerative combinatorics
    2009–2023

    Enumerative combinatorics

    Richard P. Stanley
    4 recommend · 8
    Cover of The Little Schemer
    2007–2026

    The Little Schemer

    Daniel P. Friedman
    recommend · 652
    288
    Cover of Combinatorial optimization
    2010–2024

    Combinatorial optimization

    Christos H. Papadimitriou
    1 recommend · 3