pith. sign in

arxiv: 2606.07927 · v1 · pith:UHTFFXOSnew · submitted 2026-06-06 · 🧮 math-ph · cond-mat.mtrl-sci· math.MP

Mathematical crystal chemistry: A formal theory for crystal structure prediction by generalized disjunctive programming

Ryotaro Koshoji This is my paper

Pith reviewed 2026-06-27 19:30 UTC · model grok-4.3

classification 🧮 math-ph cond-mat.mtrl-scimath.MP
keywords crystal structure predictiongeneralized disjunctive programmingmathematical chemistryatomic radiicoordination numberscombinatorial graphsoptimization
0
0 comments X

The pith

Generalized disjunctive programming casts crystal structure prediction as an optimization over atomic radii and coordination numbers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a formal theory that reformulates crystal structure prediction as generalized disjunctive programming. Continuous variables handle atomic positions while Boolean variables encode combinatorial choices such as which coordination shells are active. Because the feasibility of one type of variable shifts sharply with the value of the other, alternating optimization moves a random initial arrangement to a stable crystal. Boolean variables expose the underlying graph of chemical bonds, and repeated discovery of common subgraphs allows on-the-fly learning that speeds later searches. The resulting procedure designs many crystal structures using only tabulated atomic radii and lists of feasible coordination numbers.

Core claim

Inorganic structural chemistry leads naturally to a theory for crystal structure prediction formalized by a generalized disjunctive programming (GDP), which is formulated using continuous and Boolean variables to involve the algebraic equations, disjunctions, and logic propositions. Since the feasibilities of continuous variables change drastically depending on Boolean variables and vice versa, iterative optimization of continuous and Boolean variables efficiently transforms a randomly generated initial structure into an optimal solution. Boolean variables are introduced to elucidate the combinatorial backbone of the original continuous optimization problem, which corresponds to the graphs d

What carries the argument

Generalized disjunctive programming (GDP) that couples continuous variables for geometry with Boolean variables for combinatorial choices, turning the structure prediction task into alternating feasibility checks between the two variable classes.

Load-bearing premise

The feasibility of continuous position variables changes sharply with the truth values of the Boolean coordination variables and vice versa, so that alternating optimization reliably converts a random starting arrangement into an optimal crystal.

What would settle it

Apply the procedure to a known experimental crystal using only its tabulated atomic radii and allowed coordination numbers; if the method fails to recover the observed arrangement or requires large computation for moderately complex unit cells, the central efficiency claim is false.

read the original abstract

Inorganic structural chemistry leads naturally to a theory for crystal structure prediction formalized by a generalized disjunctive programming (GDP), which is formulated using continuous and Boolean variables to involve the algebraic equations, disjunctions, and logic propositions. Since the feasibilities of continuous variables change drastically depending on Boolean variables and vice versa, iterative optimization of continuous and Boolean variables efficiently transforms a randomly generated initial structure into an optimal solution. Boolean variables are introduced to elucidate the ``combinatorial backbone'' of the original continuous optimization problem, which corresponds to the graphs describing crystal structures with clear chemical meanings. Since many subgraphs are discovered in numerous graphs generated through structural optimizations, on-the-fly learning of the feasibilities of them accelerates the discovery of the optimal solutions. This theory enables designing a wide variety of crystal structures with small computations based on only the atomic radii and feasible coordination numbers of each atom.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper claims to formalize crystal structure prediction as a generalized disjunctive programming (GDP) problem using continuous and Boolean variables to encode algebraic equations, disjunctions, and logic propositions. It asserts that the drastic mutual dependence between continuous and Boolean feasibilities allows iterative optimization to efficiently convert random initial structures into optimal ones; Boolean variables reveal a chemically interpretable 'combinatorial backbone' corresponding to graphs; on-the-fly learning of discovered subgraphs accelerates search; and the resulting theory predicts a wide variety of structures from atomic radii and coordination numbers alone.

Significance. If the modeling construction and the asserted efficiency of the coupled continuous-Boolean iteration hold, the framework would supply a mathematically structured, low-parameter route to structure prediction whose graph-based Boolean variables carry direct chemical meaning. The absence of any reproduced benchmarks, convergence proofs, or explicit GDP formulation in the manuscript, however, leaves the practical significance unestablished.

major comments (2)
  1. [Abstract] Abstract: the central efficiency claim ('iterative optimization of continuous and Boolean variables efficiently transforms a randomly generated initial structure into an optimal solution') is load-bearing yet unsupported by any convergence analysis, scaling data, or even a single worked example; without these the assertion that the feasibility coupling enables rapid discovery from random starts cannot be evaluated.
  2. [Abstract] Abstract: the on-the-fly subgraph learning is described only at the level of 'many subgraphs are discovered in numerous graphs,' with no indication of how feasibility constraints are updated, whether the learning introduces dependence on structures found during the same run, or how it is integrated into the GDP solver; this directly affects the claimed parameter-free character.
minor comments (1)
  1. The abstract refers to 'feasible coordination numbers of each atom' without specifying how these numbers are obtained or whether they are treated as fixed inputs or derived quantities.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments. The points raised correctly identify that the abstract's efficiency and learning claims require more concrete support than is currently provided. We respond to each major comment below and indicate planned revisions.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central efficiency claim ('iterative optimization of continuous and Boolean variables efficiently transforms a randomly generated initial structure into an optimal solution') is load-bearing yet unsupported by any convergence analysis, scaling data, or even a single worked example; without these the assertion that the feasibility coupling enables rapid discovery from random starts cannot be evaluated.

    Authors: The efficiency claim is derived directly from the GDP construction, in which the feasibility of the continuous variables (atomic positions and radii constraints) depends sharply on the Boolean variables (graph edges and coordination choices) and vice versa, enabling the iterative procedure. We acknowledge, however, that the manuscript contains no worked example, scaling data, or convergence analysis. In revision we will insert a short worked example illustrating the iteration on a simple known structure using only the stated inputs. A formal convergence proof lies outside the scope of the present theoretical paper; we will add an explicit statement of this limitation. revision: partial

  2. Referee: [Abstract] Abstract: the on-the-fly subgraph learning is described only at the level of 'many subgraphs are discovered in numerous graphs,' with no indication of how feasibility constraints are updated, whether the learning introduces dependence on structures found during the same run, or how it is integrated into the GDP solver; this directly affects the claimed parameter-free character.

    Authors: The on-the-fly learning updates the disjunctive constraints by adding newly discovered feasible subgraphs to the Boolean-variable logic propositions as the optimization proceeds. This necessarily introduces dependence on structures encountered within the same run. Integration occurs inside the GDP solver by dynamically tightening the disjunctions that encode subgraph feasibility. The parameter-free character is retained because all updates remain functions of the input atomic radii and coordination numbers alone. We will revise the abstract and the relevant methodological section to state these mechanisms explicitly. revision: yes

Circularity Check

0 steps flagged

No significant circularity in formal modeling framework

full rationale

The manuscript formulates crystal structure prediction as a generalized disjunctive programming problem whose variables and constraints are defined directly from atomic radii and feasible coordination numbers; the on-the-fly subgraph learning is presented only as an efficiency heuristic inside the iterative solver and does not redefine the target structures or feasibility predicates in terms of quantities discovered during the same run. No self-citation chain, uniqueness theorem, or fitted parameter is invoked as a load-bearing premise. The derivation therefore remains self-contained and does not reduce any claimed prediction to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review yields no concrete free parameters or invented entities; the central claim rests on one domain assumption about graph representations of crystal structures.

axioms (1)
  • domain assumption Crystal structures can be represented using graphs with clear chemical meanings that correspond to the Boolean variables in the GDP formulation.
    The abstract states that Boolean variables elucidate the combinatorial backbone corresponding to graphs describing crystal structures with clear chemical meanings.

pith-pipeline@v0.9.1-grok · 5681 in / 1164 out tokens · 20067 ms · 2026-06-27T19:30:46.567352+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

80 extracted references

  1. [1]

    Maddox, Crystals from first principles, Nature335, 201 (1988)

    J. Maddox, Crystals from first principles, Nature335, 201 (1988)

    1988

  2. [2]

    C. J. Pickard and R. J. Needs, High-pressure phases of silane, Phys. Rev. Lett.97, 045504 (2006)

    2006

  3. [3]

    C. J. Pickard and R. J. Needs, Ab initio random struc- ture searching, Journal of Physics: Condensed Matter 23, 053201 (2011)

    2011

  4. [4]

    C. J. Pickard, Beyond theory-driven discovery: intro- ducing hot random search and datum-derived structures, Faraday Discuss.256, 61 (2025)

    2025

  5. [5]

    Y. Wang, J. Lv, L. Zhu, and Y. Ma, Crystal structure prediction via particle-swarm optimization, Phys. Rev. B82, 094116 (2010)

    2010

  6. [6]

    H. Wang, Y. Wang, J. Lv, Q. Li, L. Zhang, and Y. Ma, Calypso structure prediction method and its wide ap- plication, Computational Materials Science112, 406 (2016), computational Materials Science in China

    2016

  7. [7]

    X. Shao, J. Lv, P. Liu, S. Shao, P. Gao, H. Liu, Y. Wang, and Y. Ma, A symmetry-orientated divide-and-conquer method for crystal structure prediction, The Journal of Chemical Physics156, 014105 (2022)

    2022

  8. [8]

    X. Luo, Z. Wang, P. Gao, J. Lv, Y. Wang, C. Chen, and Y. Ma, Deep learning generative model for crystal structure prediction, npj Computational Materials10, 254 (2024). 6

    2024

  9. [9]

    A. R. Oganov, G. Saleh, and A. G. Kvashnin, eds.,Com- putational Materials Discovery(The Royal Society of Chemistry, 2019)

    2019

  10. [10]

    A. R. Oganov and C. W. Glass, Crystal structure predic- tion using ab initio evolutionary techniques: Principles and applications, The Journal of Chemical Physics124, 244704 (2006)

    2006

  11. [11]

    X. Liu, H. Niu, and A. R. Oganov, Copex: co- evolutionary crystal structure prediction algorithm for complex systems, npj Computational Materials7, 199 (2021)

    2021

  12. [12]

    I. A. Kruglov, A. V. Yanilkin, Y. Propad, A. B. Mazitov, P. Rachitskii, and A. R. Oganov, Crystal structure pre- diction at finite temperatures, npj Computational Mate- rials9, 197 (2023)

    2023

  13. [13]

    Falls, P

    Z. Falls, P. Avery, X. Wang, K. P. Hilleke, and E. Zurek, The xtalopt evolutionary algorithm for crystal structure prediction, The Journal of Physical Chemistry C125, 1601 (2021)

    2021

  14. [14]

    Hajinazar and E

    S. Hajinazar and E. Zurek, Xtalopt version 13: Multi- objective evolutionary search for novel functional ma- terials, Computer Physics Communications304, 109306 (2024)

    2024

  15. [15]

    Racioppi, A

    S. Racioppi, A. Otero-de-la Roza, S. Hajinazar, and E. Zurek, Powder x-ray diffraction assisted evolutionary algorithm for crystal structure prediction, Digital Discov- ery4, 73 (2025)

    2025

  16. [16]

    Hajinazar and E

    S. Hajinazar and E. Zurek, Xtalopt version 14: Variable- composition crystal structure search for functional ma- terials through pareto optimization, Computer Physics Communications320, 109910 (2026)

    2026

  17. [17]

    Tomiyasu, R

    K. Tomiyasu, R. Oishi-Tomiyasu, M. Matsuda, and K. Matsuhira, A new mathematical approach to finding global solutions of the magnetic structure determination problem, Scientific Reports8, 16228 (2018)

    2018

  18. [18]

    L. E. Gibbons, D. W. Hearn, P. M. Pardalos, and M. V. Ramana, Continuous characterizations of the maximum clique problem, Mathematics of Operations Research22, 754 (1997)

    1997

  19. [19]

    V. V. Gusev, D. Adamson, A. Deligkas, D. Antypov, C. M. Collins, P. Krysta, I. Potapov, G. R. Darling, M. S. Dyer, P. Spirakis, and M. J. Rosseinsky, Optimality guar- antees for crystal structure prediction, Nature619, 68 (2023)

    2023

  20. [20]

    Pauling, The principles determining the structure of complex ionic crystals, Journal of the American Chemical Society51, 1010 (1929)

    L. Pauling, The principles determining the structure of complex ionic crystals, Journal of the American Chemical Society51, 1010 (1929)

    1929

  21. [21]

    A. F. Wells,Structural Inorganic Chemistry, Fifth Edi- tion(Oxford University Press, 1984)

    1984

  22. [22]

    M¨ uller,Inorganic Structural Chemistry, Second Edi- tion(John Wiley & Sons, Ltd, 2007)

    U. M¨ uller,Inorganic Structural Chemistry, Second Edi- tion(John Wiley & Sons, Ltd, 2007)

    2007

  23. [23]

    S. S. Batsanov and A. S. Batsanov,Introduction to Struc- tural Chemistry(Springer, 2012)

    2012

  24. [24]

    T. C. Hales, A proof of the kepler conjecture, Annals of Mathematics162, 1065 (2005)

    2005

  25. [25]

    Filion and M

    L. Filion and M. Dijkstra, Prediction of binary hard- sphere crystal structures, Phys. Rev. E79, 046714 (2009)

    2009

  26. [26]

    J. K. Kummerfeld, T. S. Hudson, and P. Harrowell, The densest packing of ab binary hard-sphere homogeneous compounds across all size ratios, The Journal of Physical Chemistry B112, 10773 (2008), pMID: 18693695

    2008

  27. [27]

    P. I. O’Toole and T. S. Hudson, New high-density pack- ings of similarly sized binary spheres, The Journal of Physical Chemistry C115, 19037 (2011)

    2011

  28. [28]

    T. S. Hudson, Dense sphere packing in the nazn13 struc- ture type, The Journal of Physical Chemistry C114, 14013 (2010)

    2010

  29. [29]

    T. S. Hudson and P. Harrowell, Structural searches us- ing isopointal sets as generators: densest packings for binary hard sphere mixtures, Journal of Physics: Con- densed Matter23, 194103 (2011)

    2011

  30. [30]

    A. B. Hopkins, Y. Jiao, F. H. Stillinger, and S. Torquato, Phase diagram and structural diversity of the densest binary sphere packings, Phys. Rev. Lett.107, 125501 (2011)

    2011

  31. [31]

    A. B. Hopkins, F. H. Stillinger, and S. Torquato, Densest binary sphere packings, Phys. Rev. E85, 021130 (2012)

    2012

  32. [32]

    Koshoji, M

    R. Koshoji, M. Kawamura, M. Fukuda, and T. Ozaki, Di- verse densest binary sphere packings and phase diagram, Phys. Rev. E103, 023307 (2021)

    2021

  33. [33]

    Koshoji and T

    R. Koshoji and T. Ozaki, Densest ternary sphere pack- ings, Phys. Rev. E104, 024101 (2021)

    2021

  34. [34]

    Koshoji and T

    R. Koshoji and T. Ozaki, Diverse densest ternary sphere packings, Journal of Physics Communications6, 075002 (2022)

    2022

  35. [35]

    Koshoji, M

    R. Koshoji, M. Fukuda, M. Kawamura, and T. Ozaki, Prediction of quaternary hydrides based on densest ternary sphere packings, Phys. Rev. Mater.6, 114802 (2022)

    2022

  36. [36]

    V. A. Blatov, A. P. Shevchenko, and D. M. Proserpio, Applied topological analysis of crystal structures with the program package topospro, Crystal Growth & Design14, 3576 (2014)

    2014

  37. [37]

    Delgado-Friedrichs, M

    O. Delgado-Friedrichs, M. D. Foster, M. O’Keeffe, D. M. Proserpio, M. M. Treacy, and O. M. Yaghi, What do we know about three-periodic nets?, Journal of Solid State Chemistry178, 2533 (2005), reticular Chemistry: De- sign, Synthesis, Properties and Applications of Metal- Organic Polyhedra and Frameworks

    2005

  38. [38]

    O’Keeffe, M

    M. O’Keeffe, M. A. Peskov, S. J. Ramsden, and O. M. Yaghi, The reticular chemistry structure resource (rcsr) database of, and symbols for, crystal nets, Accounts of Chemical Research41, 1782 (2008), pMID: 18834152

    2008

  39. [39]

    O’Keeffe and O

    M. O’Keeffe and O. M. Yaghi, Deconstructing the crystal structures of metal-organic frameworks and related ma- terials into their underlying nets, Chemical Reviews112, 675 (2012), pMID: 21916513

    2012

  40. [40]

    O’Keeffe, Nets, tiles, and metal-organic frameworks, APL Materials2, 124106 (2014)

    M. O’Keeffe, Nets, tiles, and metal-organic frameworks, APL Materials2, 124106 (2014)

    2014

  41. [41]

    Yokoyama, K

    T. Yokoyama, K. Ichikawa, and H. Naito, Crystal struc- ture generation based on polyhedra using dual periodic graphs, Crystal Growth & Design24, 2168 (2024)

    2024

  42. [42]

    Yokoyama, K

    T. Yokoyama, K. Ichikawa, and H. Naito, From polyhe- dra to crystals: a graph-theoretic framework for crystal structure generation, CrystEngComm28, 2293 (2026)

    2026

  43. [43]

    Xie and J

    T. Xie and J. C. Grossman, Crystal graph convolutional neural networks for an accurate and interpretable predic- tion of material properties, Phys. Rev. Lett.120, 145301 (2018)

    2018

  44. [44]

    C. Chen, W. Ye, Y. Zuo, C. Zheng, and S. P. Ong, Graph networks as a universal machine learning framework for molecules and crystals, Chemistry of Materials31, 3564 (2019)

    2019

  45. [45]

    C. W. Park and C. Wolverton, Developing an improved crystal graph convolutional neural network framework for accelerated materials discovery, Phys. Rev. Mater.4, 063801 (2020). 7

    2020

  46. [46]

    Jiang, D

    Y. Jiang, D. Chen, X. Chen, T. Li, G.-W. Wei, and F. Pan, Topological representations of crystalline com- pounds for the machine-learning prediction of materials properties, npj Computational Materials7, 28 (2021)

    2021

  47. [47]

    V. Fung, J. Zhang, E. Juarez, and B. G. Sumpter, Bench- marking graph neural networks for materials chemistry, npj Computational Materials7, 84 (2021)

    2021

  48. [48]

    Cheng, C

    J. Cheng, C. Zhang, and L. Dong, A geometric- information-enhanced crystal graph network for predict- ing properties of materials, Communications Materials2, 92 (2021)

    2021

  49. [49]

    Choudhary and B

    K. Choudhary and B. DeCost, Atomistic line graph neu- ral network for improved materials property predictions, npj Computational Materials7, 185 (2021)

    2021

  50. [50]

    Reiser, M

    P. Reiser, M. Neubert, A. Eberhard, L. Torresi, C. Zhou, C. Shao, H. Metni, C. van Hoesel, H. Schopmans, T. Sommer, and P. Friederich, Graph neural networks for materials science and chemistry, Communications Mate- rials3, 93 (2022)

    2022

  51. [51]

    T. Long, N. M. Fortunato, I. Opahle, Y. Zhang, I. Samathrakis, C. Shen, O. Gutfleisch, and H. Zhang, Constrained crystals deep convolutional generative ad- versarial network for the inverse design of crystal struc- tures, npj Computational Materials7, 66 (2021)

    2021

  52. [52]

    Schmidt, L

    J. Schmidt, L. Pettersson, C. Verdozzi, S. Botti, and M. A. L. Marques, Crystal graph attention networks for the prediction of stable materials, Science Advances7, eabi7948 (2021)

    2021

  53. [53]

    Cheng, X.-G

    G. Cheng, X.-G. Gong, and W.-J. Yin, Crystal structure prediction by combining graph network and optimization algorithm, Nature Communications13, 1492 (2022)

    2022

  54. [54]

    Li, H.-P

    C.-N. Li, H.-P. Liang, X. Zhang, Z. Lin, and S.-H. Wei, Graph deep learning accelerated efficient crystal struc- ture search and feature extraction, npj Computational Materials9, 176 (2023)

    2023

  55. [55]

    H. Xiao, R. Li, X. Shi, Y. Chen, L. Zhu, X. Chen, and L. Wang, An invertible, invariant crystal representation for inverse design of solid-state materials using generative deep learning, Nature Communications14, 7027 (2023)

    2023

  56. [56]

    Pawar, A

    R. Pawar, A. Rout, S. Bhattacharjee, and P. Mota- marri, Robust lightweight graph neural network frame- work for accelerating crystal structure prediction, Jour- nal of Chemical Information and Modeling65, 6470 (2025)

    2025

  57. [57]

    T. Hong, J. Yang, and G. Cao, Crystal structure predic- tion based on diffusion model and graph network opti- mization, Journal of Physics: Materials8, 035011 (2025)

    2025

  58. [58]

    S. Yu, J. Wang, Y. Han, Q. Jia, Z. Liang, Z. Yang, Y. Pan, H. Gao, and J. Sun, A generalized method for refining and selecting random crystal structures us- ing graph theory, The Journal of Chemical Physics163, 094106 (2025)

    2025

  59. [59]

    Lee and S

    J. Lee and S. Leyffer, eds.,Mixed Integer Nonlinear Pro- gramming(Springer New York, NY, 2012)

    2012

  60. [60]

    I. E. Grossmann,Advanced Optimization for Process Sys- tems Engineering, Cambridge Series in Chemical Engi- neering (Cambridge University Press, 2021)

    2021

  61. [61]

    P. M. Castro and I. E. Grossmann, Generalized disjunc- tive programming as a systematic modeling framework to derive scheduling formulations, Industrial & Engineering Chemistry Research51, 5781 (2012)

    2012

  62. [62]

    I. E. Grossmann and F. Trespalacios, Systematic mod- eling of discrete-continuous optimization models through generalized disjunctive programming, AIChE Journal59, 3276 (2013)

    2013

  63. [63]

    Trespalacios and I

    F. Trespalacios and I. Grossmann, Review of mixed- integer nonlinear and generalized disjunctive program- ming methods, Chemie Ingenieur Technik86, 991 (2014)

    2014

  64. [64]

    H. D. Perez and I. E. Grossmann, Extensions to gener- alized disjunctive programming: hierarchical structures and first-order logic, Optimization and Engineering25, 959 (2024)

    2024

  65. [65]

    Ovalle, A

    D. Ovalle, A. Bhatia, C. D. Laird, and I. E. Grossmann, A logic-based decomposition for the global optimization of the multiperiod blending problem using symmetry- breaking cuts, Industrial & Engineering Chemistry Re- search65, 3981 (2026)

    2026

  66. [66]

    R. D. Shannon, Revised effective ionic radii and sys- tematic studies of interatomic distances in halides and chalcogenides, Acta Crystallographica Section A32, 6751 (1976)

    1976

  67. [67]

    Cordero, V

    B. Cordero, V. G´ omez, A. E. Platero-Prats, M. Rev´ es, J. Echeverr´ ıa, E. Cremades, F. Barrag´ an, and S. Alvarez, Covalent radii revisited, Dalton Trans. , 2832 (2008)

    2008

  68. [68]

    Dronskowski,Chemical Bonding(De Gruyter, Berlin, Boston, 2023)

    R. Dronskowski,Chemical Bonding(De Gruyter, Berlin, Boston, 2023)

    2023

  69. [69]

    P. C. M¨ uller, C. Ertural, J. Hempelmann, and R. Dron- skowski, Crystal orbital bond index: Covalent bond or- ders in solids, The Journal of Physical Chemistry C125, 7959 (2021)

    2021

  70. [70]

    P. C. M¨ uller, L. S. Reitz, D. Hemker, and R. Dron- skowski, Orbital-based bonding analysis in solids, Chem. Sci.16, 12212 (2025)

    2025

  71. [71]

    N. V. Sahinidis, M. Tawarmalani, and M. Yu, Design of alternative refrigerants via global optimization, AIChE Journal49, 1761 (2003)

    2003

  72. [72]

    See Supplemental Materials for the reformulation of the auxiliary GDP into an MINLP, a detailed description of the algorithm for the solution method, and the compu- tational conditions for the examples of crystal structure prediction

  73. [73]

    Koshoji and T

    R. Koshoji and T. Ozaki, Mathematical crystal chem- istry: A mathematical programming approach to crystal structures of inorganic compounds, Phys. Rev. Mater.8, 113801 (2024)

    2024

  74. [74]

    Koshoji, Mathematical crystal chemistry ii: Random search for ionic crystals and analysis on oxide crystals registered in icsd, Phys

    R. Koshoji, Mathematical crystal chemistry ii: Random search for ionic crystals and analysis on oxide crystals registered in icsd, Phys. Rev. Res.7, 033078 (2025)

    2025

  75. [75]

    The softwareMARICI(Mathematical Architecture for Realizing Inorganic Crystalline materials using mixed-Integer nonlinear programming) is available at https://marici.mathematical-crystal-chemistry. solutions/.MARICIis distributed under the MIT Li- cense.MARICIcan efficiently not only design prototypes of crystal structures but also analyze a large dataset ...

  76. [76]

    Merchant, S

    A. Merchant, S. Batzner, S. S. Schoenholz, M. Aykol, G. Cheon, and E. D. Cubuk, Scaling deep learning for materials discovery, Nature624, 80 (2023)

    2023

  77. [77]

    C. Zeni, R. Pinsler, D. Z¨ ugner, A. Fowler, M. Horton, X. Fu, Z. Wang, A. Shysheya, J. Crabb´ e, S. Ueda, R. Sor- dillo, L. Sun, J. Smith, B. Nguyen, H. Schulz, S. Lewis, C.-W. Huang, Z. Lu, Y. Zhou, H. Yang, H. Hao, J. Li, C. Yang, W. Li, R. Tomioka, and T. Xie, A generative model for inorganic materials design, Nature639, 624 (2025)

    2025

  78. [78]

    Y. Zhao, E. M. D. Siriwardane, Z. Wu, N. Fu, M. Al- 8 Fahdi, M. Hu, and J. Hu, Physics guided deep learning for generative design of crystal materials with symmetry constraints, npj Computational Materials9, 38 (2023)

    2023

  79. [79]

    Fredericks, K

    S. Fredericks, K. Parrish, D. Sayre, and Q. Zhu, Pyx- tal: A python library for crystal structure generation and symmetry analysis, Computer Physics Communications 261, 107810 (2021)

    2021

  80. [80]

    ionic chemical element

    Q. Zhang, A. Choudhury, and A. Chernatynskiy, A symmetry-oriented crystal structure prediction method for crystals with rigid bodies, Journal of Physics: Con- densed Matter37, 095901 (2024). 9 Supplemental Material for mathematical crystal chemistry REFORMULA TION AS MIXED-INTEGER NONLINEAR PROGRAMMING As described in the main article, a generalized dis- ...

    2024