← Mathematical compendium

Published equation contexts

(n2)=n(n−1)2\binom{n}{2} = \frac{n(n-1)}{2}

Why this formula appears here

For n agents that each need a channel to every other agent, the number of pairwise links a fully connected coordination topology requires is (n2)=n(n−1)2\binom{n}{2} = \frac{n(n-1)}{2}. which grows quadratically in n even before accounting for the content sent over each link. That is a modeling assumption, not a law of nature — a system that routes all communication through a single orchestrator instead of a full mesh pays a linear cost in links, at the price of a central bottleneck and a single point of failure — but every real multi-agent framework has to choose a point on that trade-off, and reasonable designers disagree about where: full-mesh topologies keep no single node load-bearing but scale their wiring…

Read the full article-specific guide →

Read the representative guide

How to interpret it

With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Learn the mathematics behind it

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

(n2)=n(n−1)2,\binom{n}{2} = \frac{n(n-1)}{2},

Equation 14 · AI Agents & Systems

The Hardest Unsolved Problems in AI Agent Architecture

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

For n agents that each need a channel to every other agent, the number of pairwise links a fully connected coordination topology requires is (n2)=n(n−1)2\binom{n}{2} = \frac{n(n-1)}{2}. which grows quadratically in n even before accounting for the content sent over each link. That is a modeling assumption, not a law of nature — a system that routes all communication through a single orchestrator instead of a full mesh pays a linear cost in links, at the price of a central bottleneck and a single point of failure — but every real multi-agent framework has to choose a point on that trade-off, and reasonable designers disagree about where: full-mesh topologies keep no single node load-bearing but scale their wiring…

Meanings in this article

  • nn: the number of agents.
Equation guide → · Article →