If anyone here happens to be an expert in the combinatorics of graphs, I’d love to have a call to get help on some problems we’re trying to work out. The problems aren’t quite trivial but I suspect an expert would pretty straight-forwardly know what techniques to apply.
Questions I have include;
When to try for an exact expression versus an asymptotic expression
Are there approximations people use other than Stirling’s?
When to use random graph methods
When graph automorphisms make a problem effectively unsolvable
If anyone here happens to be an expert in the combinatorics of graphs, I’d love to have a call to get help on some problems we’re trying to work out. The problems aren’t quite trivial but I suspect an expert would pretty straight-forwardly know what techniques to apply.
Questions I have include;
When to try for an exact expression versus an asymptotic expression
Are there approximations people use other than Stirling’s?
When to use random graph methods
When graph automorphisms make a problem effectively unsolvable
What does Gemini say? Seems like a perfect set of questions to ask a modern LLM.
We regularly try using LLMs (and, at least for me, they continue to be barely break-even in value).
Gemini: https://docs.google.com/document/d/1m6A5Rkf0NzPsCMt8c1Qb-o9pTWup-zk5epQNYX_cdo4/edit?usp=sharing
2. Chatgpt: https://chatgpt.com/share/6888b1b6-0e88-8011-8b41-d675d3aefb04
seems to me that there is a lot of good content here already.
you’ll probably have more luck spelling the problems out explicitly