Yayın: Period-3 Orbits of Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Finite Fields
| dc.contributor.author | Ulutas, Tugce | |
| dc.contributor.author | Koroglu, Mehmet Emin | |
| dc.date.accessioned | 2026-06-27T15:31:12Z | |
| dc.date.issued | 2026 | |
| dc.description.abstract | A sequential dynamical system consists of the following data; a finite graph Y with vertex set v1,& mldr;,vn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_1,\ldots ,v_n$$\end{document}, a state set, local update functions, and an update ordering sigma\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}. We study period-3 orbits of SDSs on the complete graph Kn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document} with identical local functions. We prove that the maximum number theta n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta _{n+1}$$\end{document} of 3-cycles in the phase space equals A3(n,4)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3(n,4)$$\end{document}, the largest size of a ternary code of length n with minimum Hamming distance at least 4. Our approach reduces the problem to a clique number computation in an explicit graph and yields a direct correspondence with optimal ternary (n, 4)-codes. We also give field-agnostic necessary conditions for prime period-p orbits and discuss extensions over Fp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_p$$\end{document}. | en |
| dc.description.uri | https://doi.org/10.1007/s00373-025-03008-2 | |
| dc.identifier.doi | 10.1007/s00373-025-03008-2 | |
| dc.identifier.eissn | 1435-5914 | |
| dc.identifier.issn | 0911-0119 | |
| dc.identifier.issue | 1 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14981/71467 | |
| dc.identifier.volume | 42 | |
| dc.identifier.wos | 001654170000002 | |
| dc.language.iso | eng | |
| dc.publisher | SPRINGER JAPAN KK | |
| dc.relation.ispartof | GRAPHS AND COMBINATORICS | |
| dc.subject | Sequential dynamical systems | |
| dc.subject | Periodic orbit | |
| dc.subject | Complete graph | |
| dc.subject | Codes over finite fields | |
| dc.subject | ACYCLIC ORIENTATIONS | |
| dc.subject | MINIMUM DISTANCE | |
| dc.subject | EQUIVALENCE | |
| dc.subject | SIMULATION | |
| dc.subject | ELEMENTS | |
| dc.subject | Mathematics | |
| dc.title | Period-3 Orbits of Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Finite Fields | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| local.import.source | WOS |