{"title":"Non-expansive matrix number systems with bases similar to certain Jordan blocks","authors":"Joshua W. Caldwell , Kevin G. Hare , Tomáš Vávra","doi":"10.1016/j.jcta.2023.105828","DOIUrl":null,"url":null,"abstract":"<div><p>We study representations of integral vectors in a number system with a matrix base <em>M</em> and vector digits. We focus on the case when <em>M</em> is equal or similar to <span><math><msub><mrow><mi>J</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, the Jordan block with eigenvalue 1 and dimension <em>n</em>. If <span><math><mi>M</mi><mo>=</mo><msub><mrow><mi>J</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>, we classify all digit sets of size two allowing representation for all of <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>. For <span><math><mi>M</mi><mo>=</mo><msub><mrow><mi>J</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> with <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span>, we show that a digit set of size three suffice to represent all of <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span>. For bases <em>M</em> similar to <span><math><msub><mrow><mi>J</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>, we construct a digit set of size <em>n</em> such that all of <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> is represented. The language of words representing the zero vector with <span><math><mi>M</mi><mo>=</mo><msub><mrow><mi>J</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> and the digits <span><math><msup><mrow><mo>(</mo><mn>0</mn><mo>,</mo><mo>±</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>T</mi></mrow></msup></math></span> is shown not to be context-free, but to be recognizable by a Turing machine with logarithmic memory.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"202 ","pages":"Article 105828"},"PeriodicalIF":0.9000,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316523000961","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We study representations of integral vectors in a number system with a matrix base M and vector digits. We focus on the case when M is equal or similar to , the Jordan block with eigenvalue 1 and dimension n. If , we classify all digit sets of size two allowing representation for all of . For with , we show that a digit set of size three suffice to represent all of . For bases M similar to , , we construct a digit set of size n such that all of is represented. The language of words representing the zero vector with and the digits is shown not to be context-free, but to be recognizable by a Turing machine with logarithmic memory.
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.