2000 character limit reached
Statistical complexity without explicit reference to underlying probabilities
Published 22 Feb 2018 in cond-mat.stat-mech | (1802.07861v1)
Abstract: We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting particles, without appeal to probabilities, and discuss configurational properties.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
