{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:12393"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:12393","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Bounds for long max-plus matrix products","abstract":"We consider long matrix products over max-plus algebra and develop bounds on the transient of their length after which they admit a certain decomposition as the product length exceeds these bounds. First we build on the weak CSR approach for max-plus powers of a matrix by Merlet, Nowak, and Sergeev [68] and consider the case when the products are tropical matrix powers of just one matrix. For this case we obtain new bounds on the above mentioned transient that make use of the cyclicity of the associated digraph and the tropical factor rank. Next, we develop a CSR decomposition for tropical inhomogeneous matrix products and establish bounds in which certain matrix products become CSR. We also critically examine the limitations of the developed theory by presenting a number of counterexamples in the cases where no bound exists for a matrix product to be CSR.","abstract_html":"We consider long matrix products over max-plus algebra and develop bounds on the transient of their length after which they admit a certain decomposition as the product length exceeds these bounds. First we build on the weak CSR approach for max-plus powers of a matrix by Merlet, Nowak, and Sergeev [68] and consider the case when the products are tropical matrix powers of just one matrix. For this case we obtain new bounds on the above mentioned transient that make use of the cyclicity of the associated digraph and the tropical factor rank. Next, we develop a CSR decomposition for tropical inhomogeneous matrix products and establish bounds in which certain matrix products become CSR. We also critically examine the limitations of the developed theory by presenting a number of counterexamples in the cases where no bound exists for a matrix product to be CSR.","abstract_has_math":false,"creators":["Kennedy-Cochran-Patrick, Arthur"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-07","date_published":"2022-07","updated_at":"2026-11-19T09:31:44Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/12393/1/KennedyCochranPatrick2022PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A12393","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["na"]},{"key":"dc:creator","label":"Author","values":["Kennedy-Cochran-Patrick, Arthur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-07"]},{"key":"dc:date.issued","label":"Date","values":["2022-07"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/12393/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/12393/1/KennedyCochranPatrick2022PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We consider long matrix products over max-plus algebra and develop bounds on the transient of their length after which they admit a certain decomposition as the product length exceeds these bounds. First we build on the weak CSR approach for max-plus powers of a matrix by Merlet, Nowak, and Sergeev [68] and consider the case when the products are tropical matrix powers of just one matrix. For this case we obtain new bounds on the above mentioned transient that make use of the cyclicity of the associated digraph and the tropical factor rank. Next, we develop a CSR decomposition for tropical inhomogeneous matrix products and establish bounds in which certain matrix products become CSR. We also critically examine the limitations of the developed theory by presenting a number of counterexamples in the cases where no bound exists for a matrix product to be CSR."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Bounds for long max-plus matrix products"]}]}],"canonical_facts":{"dc:contributor.sponsor":["na"],"dc:creator":["Kennedy-Cochran-Patrick, Arthur"],"dc:date":["2022-07"],"dc:date.issued":["2022-07"],"dc:description.abstract":["We consider long matrix products over max-plus algebra and develop bounds on the transient of their length after which they admit a certain decomposition as the product length exceeds these bounds. First we build on the weak CSR approach for max-plus powers of a matrix by Merlet, Nowak, and Sergeev [68] and consider the case when the products are tropical matrix powers of just one matrix. For this case we obtain new bounds on the above mentioned transient that make use of the cyclicity of the associated digraph and the tropical factor rank. Next, we develop a CSR decomposition for tropical inhomogeneous matrix products and establish bounds in which certain matrix products become CSR. We also critically examine the limitations of the developed theory by presenting a number of counterexamples in the cases where no bound exists for a matrix product to be CSR."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/12393/1/KennedyCochranPatrick2022PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/12393/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Bounds for long max-plus matrix products"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:31:44Z"}