HackerPapers

arXiv:0712.4233cond-mat.dis-nn

Insights into glass formation and glass transition in supercooled liquids, by study of related phenomena in crystals

C. Austen Angell

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We divide glass and viscous liquid sciences into two major research areas, the first dealing with how to avoid crystals and so access the viscous liquid state, and the second dealing with how liquids behave when no crystals form. We review some current efforts to elucidate each area, looking at strategies for vitrification of monatomic metals in the first, and the origin of the property fragility in the second. Essential here is the non- trivial behavior of the glassformer thermodynamics. We explore the findings on nonexponential relaxationand dynamic heterogeneities in viscous liquids, emphasizing the way in which direct excitation of the configurational modes has helped differentiate configurational from nonconfigurational contributions to the excess heat capacity. We then propose a scheme for understanding the relation between inorganic network and non-network glassformers which includes the anomalous case of water as an intermediate. In a final section we examine the additional insights to be gained by study of the ergodicity-breaking, glass-like, transitions that occur in disordering crystals. Here we highlight systems in which the background thermodynamics is understood because the ergodic behavior is a lambda transition. Water and the classical network glassformers appear to be attenuated versions of these.

arXiv comments
20 pages, 8 figures, MS of opening talk to Brazilian glass physics conference: introduces links to isosymmetric transitions in crystals, glass transitions in systems with lambda transitions
Journal reference
DOI
doi:10.1016/j.jnoncrysol.2008.05.054
Subjects
cond-mat.dis-nnDisordered Systems and Neural Networks cond-mat.mtrl-sciMaterials Science

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jan 2008 to Jan 2008.

Comments linking this paper, per year.

Discussed in comments1 thread

    • It is my understanding that the hard part is when m/n ~1 (P/N~1 in wikipedia terms). Does your O(sqrt(2)^N) algorithm work well for 1000 numbers between 1 and 2^1000. Wikipedia says, "We give efficient algorithms for both small N and small P cases below," which would seem to…

      auferstehungView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.