Geometric memory in incomplete phase transitions across dimensions

F. Tolea, M. Tolea · APS Open Sci. 1, 000005 (2026) · 2026

A nucleation-and-growth model with incomplete reversion produces a geometric memory in plate-size distributions, with stronger memory in 2D than in 3D or lamellar geometries.

Moderate AI ConfidenceStrong SourceSimulationReadiness Unknown

Plain English summary

The study models a solid-state phase transition as plates (2D squares, 3D cubes, or square-faced lamellae) that grow in a self-similar way until they either hit a size limit or are stopped by other already-formed plates. To represent an incomplete reverse transformation, the model preferentially removes smaller plates while keeping larger ones, so the system does not fully “reset.” A later forward transformation then yields a changed plate-size distribution, which the authors treat as a memory effect. Extending an earlier 2D model, the authors compare how memory depends on dimensionality by running simulations for 2D, 3D, and 3DL cases. They introduce a quantitative memory descriptor (size mass ratio) and use additional analyses including growth snapshots, arrest-regrowth cycles, size distributions, and Shannon size-entropy, finding memory is robust across geometries but stronger in 2D.

Why this matters

The study extends an earlier 2D formulation to 3D cubes and 3DL lamellar plates, and introduces a quantitative memory descriptor (size mass ratio) to compare how dimensionality affects transformation memory. No evidence of prototypes, field testing, or commercial deployment is provided in the abstract.

Key findings

  • A geometric mechanism can generate memory in first-order solid-solid transformations via incomplete reversion and geometric blocking.
  • Memory is robust across 2D, 3D, and 3DL geometries.
  • Memory strength is overall stronger in 2D than in 3D or 3DL.
  • A size mass ratio descriptor is introduced to quantify memory.
  • Shannon size-entropy is used to quantify configurational diversity, alongside calorimetry simulations.

Limitations

The abstract describes modeling and simulations (including differential scanning calorimetry simulations) but does not report experimental validation. It also does not specify material systems, parameter values, or how directly the model maps to real thermal memory effects beyond being motivated by shape-memory alloys.

Publication

Publisher
arXiv
Journal
APS Open Sci. 1, 000005 (2026)
Publication date
April 30, 2026
Research type
Preprint
arXiv
2604.27779
Access
open

Tags

More on Programmable Materials

See all →
Programmable Materialspaper· Jul 1, 2026

Shape optimization of 4D-printed multi-material morphing structures for enhanced structural stability

This study presents a shape optimization framework for enhancing the stiffness of 4D-printed multi-material morphing structures.

Hoo Min Lee, Chang-Min Lee +2 · IOP PublishingWorking Prototype
Programmable Materialspaper· Jun 22, 2026

A Versatile‐Designable Framework for Active and Programmable Shape‐Morphing Soft Matter Systems: From Inverse Design to Closed‐Loop Control

This research presents a framework for active and programmable shape-morphing soft matter systems, enhancing soft robotics capabilities.

Kai Liu, Peiling Xie +4 · WileyLaboratory Research
Programmable Materialspaper· Jun 5, 2026

Architecting three-dimensional reconfigurable matter from pop-up kirigami with programmable multistability

This research presents a new platform for creating programmable multistable pop-up kirigami systems that can transform into complex 3D shapes.

Tong Zhou, Chong Huang +5 · American Association for the Advancement of Science (AAAS)Concept
Programmable Materialspreprint· May 2, 2026

Dimple-Encoded Reprogrammable Origami

This research presents a dimple-encoded origami platform that allows for reprogrammable shape-morphing and adaptive mechanical systems.

Qun Zhang, Weicheng Huang +5 · arXivLaboratory Research
Programmable Materialspreprint· Apr 17, 2026

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter

It presents an O(log n)-round algorithm to decompose arbitrary amoebot programmable-matter structures into O(|H|) geodesically convex regions using reconfigurable circuits.

Henning Hillebrandt, Andreas Padalkin +3 · arXivSimulation
Programmable Materialspreprint· Mar 11, 2026

Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements

The paper shows sublinear-time centralized reconfiguration of geometric amoebot programmable matter using joint parallel movements, including universal reconfiguration to a line segment in O(√n log n) rounds.

Manish Kumar, Othon Michail +2 · arXivSimulation
Method note: Summaries and ratings on this page are generated by AI from the abstract only. Read the original paper for full context. · Model: gpt-5.4-nano-2026-03-17