{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:53Z","timestamp":1759638233171,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_22","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"273-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An Algebraic Geometric Approach to Nivat\u2019s Conjecture"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Szabados","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. In: Discrete & Computational Geometry 6 (1991)","DOI":"10.1007\/BF02574705"},{"key":"22_CR2","unstructured":"Cyr, V., Kra, B.: Complexity of short rectangles and periodicity. In: (submitted) (2013). arXiv: 1307.0098 [math.DS]"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Cyr, V., Kra, B.: Nonexpansive \n$$\\mathbb{Z}$$\n2-subdynamics and Nivat\u2019s conjecture. Trans. Amer. Math. Soc. (2013). http:\/\/dx.doi.org\/10.1090\/S0002-9947-2015-06391-0","DOI":"10.1090\/S0002-9947-2015-06391-0"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Epifanio, C., Koskas, M., Mignosi, F.: On a conjecture on bidimensional words. In: Theor. Comput. Sci. 1\u20133(299) (2003)","DOI":"10.1016\/S0304-3975(01)00386-3"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s002220050056","volume":"124","author":"JC Lagarias","year":"1996","unstructured":"Lagarias, J.C., Wang, Y.: Tiling the Line with Translates of One Tile. Inventiones Mathematicae 124, 341\u2013365 (1996)","journal-title":"Inventiones Mathematicae"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511626302"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic Dynamics. American Journal of Mathematics 60(4), 815\u2013866 (1938)","journal-title":"American Journal of Mathematics"},{"key":"22_CR8","unstructured":"Nivat, M.: Invited talk at ICALP, Bologna (1997)"},{"issue":"1-3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2004.02.026","volume":"319","author":"A Quas","year":"2004","unstructured":"Quas, A., Zamboni, L.Q.: Periodicity and local complexity. Theor. Comput. Sci. 319(1-3), 229\u2013240 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(99)00078-X","volume":"246","author":"JW Sander","year":"2000","unstructured":"Sander, J.W., Tijdeman, R.: The complexity of functions on lattices. Theor. Comput. Sci. 246(1-2), 195\u2013225 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1016\/S0304-3975(01)00281-X","volume":"270","author":"JW Sander","year":"2002","unstructured":"Sander, J.W., Tijdeman, R.: The rectangle complexity of func tions on two-dimensional lattices. Theor. Comput. Sci. 270(1-2), 857\u2013863 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR12","unstructured":"Szegedy, M.: Algorithms to tile the infinite grid with finite clusters. In: FOCS, pp. 137\u2013147. IEEE Computer Society (1998)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:08:12Z","timestamp":1676945292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}