{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:34:37Z","timestamp":1775018077941,"version":"3.50.1"},"reference-count":20,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1134\/s0361768824020142","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T18:01:54Z","timestamp":1716400914000},"page":"202-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal"],"prefix":"10.1134","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-6396","authenticated-orcid":false,"given":"A. V.","family":"Seliverstov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8546-364X","authenticated-orcid":false,"given":"O. A.","family":"Zverkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"3839_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1134\/S0037446622050019","volume":"63","author":"P.E. Alaev","year":"2022","unstructured":"Alaev, P.E., Finitely generated structures computable in polynomial time, Sib. Math. J., 2022, vol. 63, pp.\u00a0801\u2013818. https:\/\/doi.org\/10.1134\/S0037446622050019","journal-title":"Sib. Math. J."},{"key":"3839_CR2","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1134\/S000511792109006X","volume":"82","author":"V.K. Leontiev","year":"2021","unstructured":"Leontiev, V.K. and Gordeev, E.N., On the number of solutions to a system of Boolean equations, Autom. Remote Control, 2021, vol. 82, pp. 1581\u20131596.\nhttps:\/\/doi.org\/10.1134\/S000511792109006X","journal-title":"Autom. Remote Control"},{"key":"3839_CR3","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1134\/S0965542522090044","volume":"62","author":"E.N. Gordeev","year":"2022","unstructured":"Gordeev, E.N. and Leont\u2019ev, V.K., On the number of solutions to linear Diophantine equation and Frobenius problem, Comput. Math. Math. Phys., 2022, vol. 62, pp.\u00a01413\u20131423. https:\/\/doi.org\/10.1134\/S0965542522090044","journal-title":"Comput. Math. Math. Phys."},{"key":"3839_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s11424-015-3324-9","volume":"29","author":"Y. Pan","year":"2016","unstructured":"Pan, Y. and Zhang, F., Solving low-density multiple subset sum problems with SVP oracle, J. Syst. Sci. Complexity, 2016, vol. 29, pp. 228\u2013242. https:\/\/doi.org\/10.1007\/s11424-015-3324-9","journal-title":"J. Syst. Sci. Complexity"},{"key":"3839_CR5","doi-asserted-by":"publisher","unstructured":"Seliverstov, A.V., Binary solutions to large systems of linear equations, Prikl. Diskretnaya Mat., 2021, no. 52, pp. 5\u201315. https:\/\/doi.org\/10.17223\/20710410\/52\/1","DOI":"10.17223\/20710410\/52\/1"},{"key":"3839_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S0965542523010116","volume":"63","author":"A.V. Seliverstov","year":"2023","unstructured":"Seliverstov, A.V., Generalization of the subset sum problem and cubic forms, Comput. Math. Math. Phys., 2023, vol. 63, pp. 48\u201356.\nhttps:\/\/doi.org\/10.1134\/S0965542523010116","journal-title":"Comput. Math. Math. Phys."},{"key":"3839_CR7","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s00453-023-01102-6","volume":"85","author":"S. Akmal","year":"2023","unstructured":"Akmal, S., Chen, L., Jin, C., Raj, M., and Williams, R., Improved Merlin\u2013Arthur protocols for central problems in fine-grained complexity, Algorithmica, 2023, vol. 85, pp. 2395\u20132426. https:\/\/doi.org\/10.1007\/s00453-023-01102-6","journal-title":"Algorithmica"},{"key":"3839_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11786-023-00556-9","volume":"17","author":"S.D. Stoichev","year":"2023","unstructured":"Stoichev, S.D. and Gezek, M., Unitals in projective planes of order 25, Math. Comput. Sci., 2023, vol. 17, no. 5, pp. 1\u201319. https:\/\/doi.org\/10.1007\/s11786-023-00556-9","journal-title":"Math. Comput. Sci."},{"key":"3839_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BFb0028792","volume":"199","author":"A.L. Chistov","year":"1985","unstructured":"Chistov, A.L., Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, Lect. Notes Comput. Sci., 1985, vol. 199, pp. 63\u201369. https:\/\/doi.org\/10.1007\/BFb0028792","journal-title":"Lect. Notes Comput. Sci."},{"key":"3839_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, 1987, vol. 7, no. 1, pp. 101\u2013104. https:\/\/doi.org\/10.1007\/BF02579205","journal-title":"Combinatorica"},{"key":"3839_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528404","volume":"60","author":"H.Y. Cheung","year":"2013","unstructured":"Cheung, H.Y., Kwok, T.C., and Lau, L.C., Fast matrix rank algorithms and applications, J. ACM, 2013, vol.\u00a060, no. 5, pp. 1\u201325. https:\/\/doi.org\/10.1145\/2528404","journal-title":"J. ACM"},{"key":"3839_CR12","doi-asserted-by":"publisher","unstructured":"Pereslavtseva, O.N., On calculating the characteristic polynomial of a matrix, Discrete Mathematics and Applications, 2011, vol. 21, no. 1, pp. 109\u2013128.\nhttps:\/\/doi.org\/10.1515\/DMA.2011.008","DOI":"10.1515\/DMA.2011.008"},{"key":"3839_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2021.101572","volume":"67","author":"V. Neiger","year":"2021","unstructured":"Neiger, V. and Pernet, C., Deterministic computation of the characteristic polynomial in the time of matrix multiplication, J. Complexity, 2021, vol. 67, no. 101572, pp. 1\u201335. https:\/\/doi.org\/10.1016\/j.jco.2021.101572","journal-title":"J. Complexity"},{"key":"3839_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jsc.2022.09.002","volume":"116","author":"S. Birmpilis","year":"2023","unstructured":"Birmpilis, S., Labahn, G., and Storjohann, A., A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix, J. Symbolic Comput., 2023, vol. 116, pp. 146\u2013182. https:\/\/doi.org\/10.1016\/j.jsc.2022.09.002","journal-title":"J. Symbolic Comput."},{"key":"3839_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1134\/S0965542523050020","volume":"63","author":"S.A. Abramov","year":"2023","unstructured":"Abramov, S.A., Petkov\u0161ek, M., and Ryabenko, A.A., On ranks of matrices over noncommutative domains, Comput. Math. Math. Phys., 2023, vol. 63, no. 5, pp.\u00a0771\u2013778.","journal-title":"Comput. Math. Math. Phys."},{"key":"3839_CR16","doi-asserted-by":"publisher","unstructured":"Yuran, A., Newton polytopes of non-degenerate quadratic forms, Functional Analysis and Its Applications, 2022, vol. 56, no. 2, pp. 152\u2013158. \nhttps:\/\/doi.org\/10.1134\/S0016266322020095","DOI":"10.1134\/S0016266322020095"},{"key":"3839_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0965542523010062","volume":"63","author":"A.B. Batkhin","year":"2023","unstructured":"Batkhin, A.B. and Bruno, A.D., Real normal form of a binary polynomial at a second-order critical point, Comput. Math. Math. Phys., 2023, vol. 63, pp. 1\u201313. https:\/\/doi.org\/10.1134\/S0965542523010062","journal-title":"Comput. Math. Math. Phys."},{"key":"3839_CR18","unstructured":"Seliverstov, A.V., On a simple lower bound for the matrix rank, Komp\u2019yuternaya algebra: materialy 5-i mezhdunarodnoi konferentsii (Computer Algebra: Proc. 5th Int. Conf.), Abramov, S.A., Batkhin, A.B., and Sevast\u2019yanov, L.A., Eds., Moscow: Inst. Prikl. Mat. im. Keldysha, 2023, pp. 126\u2013128."},{"key":"3839_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1134\/S0965542523010050","volume":"63","author":"R.E. Bayramov","year":"2023","unstructured":"Bayramov, R.E., Blinkov, Yu.A., Levichev, I.V., Malykh, M.D., and Melezhik, V.S., Analytical study of cubature formulas on a sphere in computer algebra systems, Comput. Math. Math. Phys., 2023, vol. 63, pp.\u00a077\u201385. https:\/\/doi.org\/10.1134\/S0965542523010050","journal-title":"Comput. Math. Math. Phys."},{"key":"3839_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7717\/peerjcs.103","volume":"3","author":"A. Meurer","year":"2017","unstructured":"Meurer, A., Smith, C.P., Paprocki, M., \u010certik, O., Kirpichev, S.B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J.K., Singh, S., Rathnayake, T., Vig, S., Granger, B.E., Muller, R.P., Bonazzi, F., Gupta, H., Vats, S., Johansson, F., Pedregosa, F., Curry, M.J., Terrel, A.R., Rou\u010dka, \u0160., Saboo, A., Fernando, I., Kulal, S., Cimrman, R., and Scopatz, A., SymPy: Symbolic computing in Python, PeerJ Comput. Sci., 2017, vol. 3, no. e103, pp. 1\u201327. https:\/\/doi.org\/10.7717\/peerjcs.103","journal-title":"PeerJ Comput. Sci."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768824020142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768824020142","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768824020142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:49:52Z","timestamp":1775011792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768824020142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["3839"],"URL":"https:\/\/doi.org\/10.1134\/s0361768824020142","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"12 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}