Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2017, Volume 463, Pages 269–276 (Mi znsl6517)  

A generalization of the theorem on forming a matroid from parts

N. A. Lebedinskayaa, D. M. Lebedinskiia, A. A. Smirnovb

a St. Petersburg State University, St. Petersburg, Russia
b Mozhaiskiy Space Military Academy, St. Petersburg, Russia
References:
Abstract: A generalization of the theorem on forming a matroid from parts is proved, i.e., given a finite set subdivided into some blocks, each of which is supplied with a matroid structure, and assuming that the ranks of every union of certain blocks are prescribed in such a way that the conditions on the rank function of a matroid are fulfilled, one can extend the rank function to all the subsets of the original set in such a way that the latter becomes a matroid.
Key words and phrases: direct sum, subspace, matroid.
Received: 11.10.2017
English version:
Journal of Mathematical Sciences (New York), 2018, Volume 232, Issue 6, Pages 921–925
DOI: https://doi.org/10.1007/s10958-018-3919-5
Bibliographic databases:
Document Type: Article
UDC: 519.112.1
Language: Russian
Citation: N. A. Lebedinskaya, D. M. Lebedinskii, A. A. Smirnov, “A generalization of the theorem on forming a matroid from parts”, Computational methods and algorithms. Part XXX, Zap. Nauchn. Sem. POMI, 463, POMI, St. Petersburg, 2017, 269–276; J. Math. Sci. (N. Y.), 232:6 (2018), 921–925
Citation in format AMSBIB
\Bibitem{LebLebSmi17}
\by N.~A.~Lebedinskaya, D.~M.~Lebedinskii, A.~A.~Smirnov
\paper A generalization of the theorem on forming a~matroid from parts
\inbook Computational methods and algorithms. Part~XXX
\serial Zap. Nauchn. Sem. POMI
\yr 2017
\vol 463
\pages 269--276
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl6517}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2018
\vol 232
\issue 6
\pages 921--925
\crossref{https://doi.org/10.1007/s10958-018-3919-5}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049103659}
Linking options:
  • https://www.mathnet.ru/eng/znsl6517
  • https://www.mathnet.ru/eng/znsl/v463/p269
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:96
    Full-text PDF :35
    References:26
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024