{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:52Z","timestamp":1761609952959,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2016-03886","PGSD3-547508-2020"],"award-info":[{"award-number":["RGPIN-2016-03886","PGSD3-547508-2020"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00454-024-00661-x","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:02:14Z","timestamp":1718128934000},"page":"258-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Sylvester\u2013Gallai-Type Theorem for Complex-Representable Matroids"],"prefix":"10.1007","volume":"73","author":[{"given":"Jim","family":"Geelen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7816-0747","authenticated-orcid":false,"given":"Matthew E.","family":"Kroeker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"661_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Dvir, Z., Wigderson, A., Yehudayoff, A.: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 519\u2013528, San Jose, CA, ACM, New York (2011)","DOI":"10.1145\/1993636.1993705"},{"key":"661_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511586507","volume-title":"Oriented Matroids","author":"A Bj\u00f6rner","year":"1999","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, second Cambridge University Press, Cambridge (1999)","edition":"second"},{"key":"661_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02112289","volume":"40","author":"P Borwein","year":"1990","unstructured":"Borwein, P., Moser, W.O.J.: A survey of Sylvester\u2019s problem and its generalizations. Aequationes Math. 40, 111\u2013135 (1990)","journal-title":"Aequationes Math."},{"key":"661_CR4","first-page":"11","volume":"15","author":"W Bonnice","year":"1967","unstructured":"Bonnice, W., Edelstein, M.: Flats associated with the finite sets in $$\\mathbb{P} ^d$$. Niew. Arch. Wisk. 15, 11\u201314 (1967)","journal-title":"Niew. Arch. Wisk."},{"key":"661_CR5","volume-title":"Improved Rank Bounds for Design Matrices and a New Proof of Kelly\u2019s Theorem. Forum of Mathematics, Sigma","author":"Z Dvir","year":"2014","unstructured":"Dvir, Z., Saraf, S., Wigderson, A.: Improved Rank Bounds for Design Matrices and a New Proof of Kelly\u2019s Theorem. Forum of Mathematics, Sigma, vol. 2. Cambridge University Press, Cambridge (2014)"},{"issue":"3","key":"661_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00454-005-1226-7","volume":"35","author":"N Elkies","year":"2006","unstructured":"Elkies, N., Pretorius, L.M., Swanepoel, K.J.: Sylvester-Gallai theorems for complex numbers and quaternions. Discrete Comput. Geom. 35(3), 361\u2013373 (2006)","journal-title":"Discrete Comput. Geom."},{"key":"661_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2303021","volume":"51","author":"T Gallai","year":"1944","unstructured":"Gallai, T.: Solution to problem 4065. Am. Math. Mon. 51, 169\u2013171 (1944)","journal-title":"Am. Math. Mon."},{"key":"661_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.7146\/math.scand.a-10758","volume":"16","author":"S Hansen","year":"1965","unstructured":"Hansen, S.: A generalization of a theorem of Sylvester on the lines determined by a finite point set. Math. Scand. 16, 175\u2013180 (1965)","journal-title":"Math. Scand."},{"key":"661_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187687","volume":"1","author":"LM Kelly","year":"1986","unstructured":"Kelly, L.M.: A resolution of the Sylvester-Gallai problem of J.-P. Serre. Discrete Comput. Geom. 1, 101\u2013104 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"661_CR10","first-page":"461","volume":"5","author":"E Melchior","year":"1941","unstructured":"Melchior, E.: \u00dcber vielseite der projektiven ebene. Deutsche Math. 5(1), 461\u2013475 (1941)","journal-title":"Deutsche Math."},{"key":"661_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1090\/S0002-9947-1951-0041447-9","volume":"70","author":"TS Motzkin","year":"1951","unstructured":"Motzkin, T.S.: The lines and planes connecting the points of a finite set. Trans. Am. Math. Soc. 70, 451\u2013464 (1951)","journal-title":"Trans. Am. Math. Soc."},{"key":"661_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory, 2nd edn. Oxford University Press, New York (2011)","edition":"2"},{"key":"661_CR13","first-page":"98","volume":"59","author":"JJ Sylvester","year":"1893","unstructured":"Sylvester, J.J.: Mathematical question 11851. Educ. Times 59, 98 (1893)","journal-title":"Educ. Times"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00661-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-024-00661-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00661-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T16:04:58Z","timestamp":1736179498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-024-00661-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["661"],"URL":"https:\/\/doi.org\/10.1007\/s00454-024-00661-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,6,11]]},"assertion":[{"value":"9 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}