{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nThe acyclicity of *G* is an essential assumption in the Lindström–Gessel–Viennot lemma; it guarantees (in reasonable situations) that the sums $e(a, b)$ are well-defined, and it advects into the proof (if *G* is not acyclic, then *f* might transform a self-intersection of a path into an intersection of two distinct paths, which breaks the argument that *f* is an involution). Nevertheless, Kelli Talaska's 2012 paper establishes a formula generalizing the lemma to arbitrary digraphs. The sums $e(a, b)$ are replaced by [[formal power series|033WGN00BF]], and the sum over nonintersecting path tuples now becomes a sum over collections of nonintersecting and non-self-intersecting paths and cycles, divided by a sum over collections of nonintersecting cycles. The reader is referred to Talaska's paper for details.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "8559FZV67G"
    ],
    "kind": "statement",
    "name": "Talaska's formula",
    "role": "proposition",
    "sources": [
      {
        "locator": "Lindström–Gessel–Viennot lemma, section Generalizations \u003e Talaska's formula",
        "mention": "wikipedia://en/31847498#6O99",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:31847498@r1371973165"
      }
    ],
    "tag": "ZD4Z8Z1NJ2"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/ZD4Z8Z1NJ2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/ZD4Z8Z1NJ2.md",
  "msc": null,
  "name": "Talaska's formula",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/ZD4/ZD4Z8Z1NJ2.md",
  "status": null,
  "tag": "ZD4Z8Z1NJ2",
  "uri": "m2://ZD4Z8Z1NJ2",
  "url": "https://math2.tamnd.com/wiki/talaskas-formula/",
  "writing": {
    "tag": "ZD4Z8Z1NJ2",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}