{"paper":{"title":"1324-avoiding permutations revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew R. Conway, Anthony J. Guttmann, Paul Zinn-Justin","submitted_at":"2017-09-05T06:08:03Z","abstract_excerpt":"We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\\le 50$. We re-analyse the generating function and find additional evidence for our earlier conclusion that unlike other classical length-$4$ pattern-avoiding permutations, the generating function does not have a simple power-law singularity, but rather, the number of $1324$-avoiding permutations of length $n$ behaves as \\[ B\\cdot \\mu^n \\cdot \\mu_1^{\\sqrt{n}} \\cdot n^g. \\] We estimate $\\mu=11.600 \\pm 0."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01248","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}