Roots in the semiring of finite deterministic dynamical systems

preprint OA: closed
Full text JSON View at publisher
Full text 11,786 characters · extracted from preprint-html · click to expand
Roots in the semiring of finite deterministic dynamical systems | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Roots in the semiring of finite deterministic dynamical systems François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6278096/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 11 You are reading this latest preprint version Abstract Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a commutative semiring. This algebraic structure led to several works employing polynomial equations to model hypotheses on phenomena modelled using FDDS.To solve these equations, algorithms for performing the division and computing $k$-th roots are needed.In this paper, we propose two polynomial algorithms for these tasks, under the condition that the result is a connected FDDS. This ultimately leads to an efficient solution to equations of the type $AX^k=B$ for connected $X$ and some generalisations.These results are some of the important final steps for solving more general polynomial equations on FDDS. discrete dynamical systems root of graph direct product Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 15 Sep, 2025 Reviews received at journal 12 Sep, 2025 Reviews received at journal 12 Aug, 2025 Reviews received at journal 04 Aug, 2025 Reviewers agreed at journal 09 May, 2025 Reviewers agreed at journal 06 May, 2025 Reviewers agreed at journal 06 May, 2025 Reviewers invited by journal 06 May, 2025 Editor assigned by journal 24 Mar, 2025 Submission checks completed at journal 22 Mar, 2025 First submitted to journal 21 Mar, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6278096","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":452751602,"identity":"b6996d8c-217d-45a7-b931-7831c5d17ca4","order_by":0,"name":"François Doré","email":"","orcid":"","institution":"University of Bordeaux","correspondingAuthor":false,"prefix":"","firstName":"François","middleName":"","lastName":"Doré","suffix":""},{"id":452751603,"identity":"c43323b3-bf6e-42cb-88f2-ce13d36b4efc","order_by":1,"name":"Kévin Perrot","email":"","orcid":"","institution":"Aix-Marseille University","correspondingAuthor":false,"prefix":"","firstName":"Kévin","middleName":"","lastName":"Perrot","suffix":""},{"id":452751604,"identity":"a94d29bd-d1fb-421c-84e8-4cb85b257dad","order_by":2,"name":"Antonio E. Porreca","email":"","orcid":"","institution":"Aix-Marseille University","correspondingAuthor":false,"prefix":"","firstName":"Antonio","middleName":"E.","lastName":"Porreca","suffix":""},{"id":452751605,"identity":"2de528e9-445a-4b0c-941e-8e903b63a622","order_by":3,"name":"Sara Riva","email":"","orcid":"","institution":"University of Lille","correspondingAuthor":false,"prefix":"","firstName":"Sara","middleName":"","lastName":"Riva","suffix":""},{"id":452751606,"identity":"aaf80768-9ec7-43ea-aa18-2720ffe015d6","order_by":4,"name":"Marius Rolland","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABAklEQVRIie2QMUsDMRiG33CQLjmzprTaXyBkqohHf0tBOEedOkpKIE7iqoP/o2OOrNe7VejUpZNCwUmsYFLdJL3VIc8QPhKevG8CJBL/FLtfe5kCaDGkALFEgXcrGQlKyWjY8XNfdWb9KI6hSzm9W64d2+GaZ2T+fjNr2RG3sB8LiLOIM66vpMsNzp800YPHZsWomKK6ryGGNqLYEi5XkNIRNchNUPjW+ktuRaTYuN0gFAuK/sxNw6gvVn0ZiKjy4lP8LwXF+BTr5ylC1QPKBtWzEbKviblgzeX+Le64FnGlLbPt666QvKfdis0mJ6MHS9ZviyKq/PL3uENIJBKJxEG+AZLuUW8WEgg/AAAAAElFTkSuQmCC","orcid":"","institution":"French National Centre for Scientific Research","correspondingAuthor":true,"prefix":"","firstName":"Marius","middleName":"","lastName":"Rolland","suffix":""}],"badges":[],"createdAt":"2025-03-21 13:38:25","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6278096/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6278096/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":82317328,"identity":"0a9a50b0-2101-4c99-bb81-66b9ec9dd4d6","added_by":"auto","created_at":"2025-05-09 03:53:59","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":453972,"visible":true,"origin":"","legend":"","description":"","filename":"AutomataRacine.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6278096/v1_covered_07c7ba8f-4390-4f9e-beae-e2eaa2a82f73.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Roots in the semiring of finite deterministic dynamical systems","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"natural-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"naco","sideBox":"Learn more about [Natural Computing](http://link.springer.com/journal/11047)","snPcode":"11047","submissionUrl":"https://submission.nature.com/new-submission/11047/3","title":"Natural Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"discrete dynamical systems, root of graph direct product","lastPublishedDoi":"10.21203/rs.3.rs-6278096/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6278096/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a commutative semiring. This algebraic structure led to several works employing polynomial equations to model hypotheses on phenomena modelled using FDDS.To solve these equations, algorithms for performing the division and computing $k$-th roots are needed.In this paper, we propose two polynomial algorithms for these tasks, under the condition that the result is a connected FDDS. This ultimately leads to an efficient solution to equations of the type $AX^k=B$ for connected $X$ and some generalisations.These results are some of the important final steps for solving more general polynomial equations on FDDS.","manuscriptTitle":"Roots in the semiring of finite deterministic dynamical systems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-05-09 03:45:54","doi":"10.21203/rs.3.rs-6278096/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-09-15T10:11:10+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-12T09:45:20+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-12T14:37:52+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-04T11:58:42+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"310471471008840435966633392117421057763","date":"2025-05-09T08:33:26+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"251877153327385768293421303749805959857","date":"2025-05-06T14:31:28+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"24534805334286633609325680673027983544","date":"2025-05-06T14:20:51+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-05-06T13:45:05+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-03-24T16:33:22+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-03-22T11:08:09+00:00","index":"","fulltext":""},{"type":"submitted","content":"Natural Computing","date":"2025-03-21T13:34:15+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"natural-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"naco","sideBox":"Learn more about [Natural Computing](http://link.springer.com/journal/11047)","snPcode":"11047","submissionUrl":"https://submission.nature.com/new-submission/11047/3","title":"Natural Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"1e0c147b-68c8-4605-9184-7248a643c217","owner":[],"postedDate":"May 9th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-02-18T15:09:59+00:00","versionOfRecord":[],"versionCreatedAt":"2025-05-09 03:45:54","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6278096","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6278096","identity":"rs-6278096","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00