Decision problem on interactions
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910651115372544 |
|---|---|
| author | Wachi, Hidetada |
| author_facet | Wachi, Hidetada |
| contents | An interaction is a certain symmetric graph that describes the possible transition of states of adjacent sites of large-scale interacting systems. In the series of studies Bannai-Kametani-Sasada arXiv:2009.04699, Bannai-Sasada arXiv:2111.08934, they defined the notion of the irreducibly quantified interactions which is suitable for considering the hydrodynamic limits via the conserved quantities. In this paper, we prove that the property that an interaction is irreducibly quantified is decidable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_11292 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Decision problem on interactions Wachi, Hidetada Combinatorics 05C30, 20M05, 20M14 An interaction is a certain symmetric graph that describes the possible transition of states of adjacent sites of large-scale interacting systems. In the series of studies Bannai-Kametani-Sasada arXiv:2009.04699, Bannai-Sasada arXiv:2111.08934, they defined the notion of the irreducibly quantified interactions which is suitable for considering the hydrodynamic limits via the conserved quantities. In this paper, we prove that the property that an interaction is irreducibly quantified is decidable. |
| title | Decision problem on interactions |
| topic | Combinatorics 05C30, 20M05, 20M14 |
| url | https://arxiv.org/abs/2410.11292 |