# Combinatorial Entropy for Distinguishable Entities in Indistinguishable States

Source: [Combinatorial Entropy for Distinguishable Entities in Indistinguishable States](<https://www.sota2.com/research/paper/68fa27cb2c2a3760193c4e89>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:52:46.593Z

Authors: Robert K. Niven

Published: 2007-09-20T13:20:53.000Z

## Abstract

The combinatorial basis of entropy by Boltzmann can be written $H= {N}^{-1} \\ln \\mathbb{W}$, where $H$ is the dimensionless entropy of a system, per unit entity, $N$ is the number of entities and $\\mathbb{W}$ is the number of ways in which a given realization of the system can occur, known as its statistical weight. Maximizing the entropy (\`\`MaxEnt'') of a system, subject to its constraints, is then equivalent to choosing its most probable (\`\`MaxProb'') realization. For a system of distinguishable entities and states, $\\mathbb{W}$ is given by the multinomial weight, and $H$ asymptotically approaches the Shannon entropy. In general, however, $\\mathbb{W}$ need not be multinomial, leading to different entropy measures. This work examines the allocation of distinguishable entities to non-degenerate or equally degenerate, indistinguishable states. The non-degenerate form converges to the Shannon entropy in some circumstances, whilst the degenerate case gives a new entropy measure, a function of a multinomial coefficient, coding parameters, and Stirling numbers of the second kind.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/0709.3124>)

[PDF](<https://arxiv.org/pdf/0709.3124.pdf>)
