Abstract
Let A be any integer m×n matrix of rank d. We prove that the Markov and Graver complexities of A may be arbitrarily large for n≥4 and d≤n−2. In contrast, we show they are bounded in terms of n and the largest absolute value a of any entry of A.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
