{"paper":{"title":"Sur l'\\'enum\\'eration de structures discr\\`etes, une approche par la th\\'eorie des relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Djamila Oudrar","submitted_at":"2016-04-20T06:36:41Z","abstract_excerpt":"Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\\mathscr C$ be a class of finite combinatorial structures, the \\emph{profile} of $\\mathscr C$ is the function $\\varphi_{\\mathscr C}$ which count, for every $n$, the number of members of $\\mathscr{C}$ defined on $n$ elements, isomorphic structures been identified. The generating function for $\\mathscr C$ is $\\mathcal H_{\\mathscr C}(X):=\\sum_{n\\geqq 0}\\varphi_{\\mathscr C}(n)X^n$. Many results about the behavior of the function $\\varphi_{\\mathscr C}$ have been obtained. Albert and Atkinson have"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05839","kind":"arxiv","version":1},"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"}