Complexity of deciding whether a tropical linear prevariety is a tropical variety

From MaRDI portal
Revision as of 19:07, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2032307

DOI10.1007/S00200-019-00407-WzbMATH Open1462.14059arXiv1803.01068OpenAlexW2990631995WikidataQ126633081 ScholiaQ126633081MaRDI QIDQ2032307FDOQ2032307

Nicolai Vorobjov, Dima Grigoriev

Publication date: 11 June 2021

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: We give an algorithm, with a singly exponential complexity, deciding whether a tropical linear prevariety is a tropical linear variety. The algorithm relies on a criterion to be a tropical linear variety in terms of a duality between the tropical orthogonalization Aperp and the double tropical orthogonalization Aperpperp of a subset A of the vector space (mathbbRcupinfty)n. We also give an example of a countable family of tropical hyperplanes such that their intersection is not a tropical prevariety.


Full work available at URL: https://arxiv.org/abs/1803.01068





Cites Work


Cited In (2)






This page was built for publication: Complexity of deciding whether a tropical linear prevariety is a tropical variety

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032307)