arXiv (All)
open access
Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of expansion coefficients into a special bivariate generating function
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Algorithms and hardness for Metric Dimension on digraphs#146986
- Weighted averages and applications to sets of multiple recurrence#1122579
- Variational Bayesian Flow Network for Graph Generation#1062835
- Efficient Graph Generation via Direct Prediction and Flow Matching#1201410
- Recursive overlap Bernoulli distributions and an entropy concavity conjecture#972605
Record · ID 1344406
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive