Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Combinatorics and Geometry of Matroids and Polytopes

2019/34/E/ST1/00087

Keywords:

matroid toric ideal generators Gröbner basis Betti number exchange property polytope triangulation reflexive polytope reciprocity theorem cube

Descriptors:

  • ST1_14: Discrete mathematics and combinatorics
  • ST1_4: Algebraic and complex geometry
  • ST1_2: Algebra

Panel:

ST1 - Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics

Host institution :

Instytut Matematyczny Polskiej Akademii Nauk

woj.

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Michał Lasoń 

Number of co-investigators in the project: 7

Call: SONATA BIS 9 - announced on 2019-06-17

Amount awarded: 1 400 000 PLN

Project start date (Y-m-d): 2020-03-31

Project end date (Y-m-d): 2026-03-30

Project duration:: 72 months (the same as in the proposal)

Project status: Pending project

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

  • Publication in academic press/journals (13)
  • Articles in post-conference publications (1)
  1. Optimal stopping for many connected components in a graph
    Authors:
    Michał Lasoń
    Academic press:
    Random Structures & Algorithms (rok: 2021, tom: 59 (2), strony: 267-287), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.21000 - link to the publication
  2. Optimal stopping for many connected components in a graph
    Authors:
    Michał Lasoń
    Academic press:
    Random Structures & Algorithms (rok: 2021, tom: 59 (2), strony: 267-287), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.21000 - link to the publication
  3. Alon-Tarsi for hypergraphs
    Authors:
    M. Anholcer, B. Bosek, G. Gutowski, M. Lason, J. Przybyło, O. Serra, M. Tuczynski, L. Vena, M. Zajac
    Academic press:
    arXiv:2501.00157 (rok: 2024, )
    Status:
    Published
  4. A note on seminormality of cut polytopes
    Authors:
    Michał Lasoń, Mateusz Michałek
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2022, tom: 36 (1), strony: 114-117), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/20M138586X - link to the publication
  5. Modularity of minor-free graphs
    Authors:
    Michał Lasoń, Małgorzata Sulkowska
    Academic press:
    Journal of Graph Theory (rok: 2023, tom: 102, strony: 728-736), Wydawca: Wiley Periodicals LLC.
    Status:
    Published
    DOI:
    10.1002/jgt.22896 - link to the publication
  6. Modularity of minor-free graphs
    Authors:
    Michał Lasoń, Małgorzata Sulkowska
    Academic press:
    Journal of Graph Theory (rok: 2023, tom: 102, strony: 728-736), Wydawca: Wiley Periodicals LLC.
    Status:
    Published
    DOI:
    10.1002/jgt.22896 - link to the publication
  7. Modularity of minor-free graphs
    Authors:
    Michał Lasoń, Małgorzata Sulkowska
    Academic press:
    Journal of Graph Theory (rok: 2023, tom: 102, strony: 728-736), Wydawca: Wiley Periodicals LLC.
    Status:
    Published
    DOI:
    10.1002/jgt.22896 - link to the publication
  8. Modularity of minor-free graphs
    Authors:
    Michał Lasoń, Małgorzata Sulkowska
    Academic press:
    Journal of Graph Theory
    Status:
    Submitted
  9. Optimal stopping for many connected components in a graph
    Authors:
    Michał Lasoń
    Academic press:
    Random Structures & Algorithms (rok: 2021, tom: 59 (2), strony: 267-287), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.21000 - link to the publication
  10. Optimal stopping for many connected components in a graph
    Authors:
    Michał Lasoń
    Academic press:
    Random Structures & Algorithms (rok: 2021, tom: 59 (2), strony: 267-287), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.21000 - link to the publication
  11. A note on seminormality of cut polytopes
    Authors:
    Michał Lasoń, Mateusz Michałek
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2022, tom: 36 (1), strony: 114-117), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/20M138586X - link to the publication
  12. A note on seminormality of cut polytopes
    Authors:
    Michał Lasoń, Mateusz Michałek
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2022, tom: 36 (1), strony: 114-117), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/20M138586X - link to the publication
  13. A note on seminormality of cut polytopes
    Authors:
    Michał Lasoń, Mateusz Michałek
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2022, tom: 36 (1), strony: 114-117), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/20M138586X - link to the publication
  1. First-Fit Coloring of Forests in Random Arrival Model
    Authors:
    Bartłomiej Bosek, Grzegorz Gutowski, Michał Lasoń, Jakub Przybyło
    Conference:
    49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) (rok: 2024, tom: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), strony: 33:1-33:10), Wydawca: Leibniz International Proceedings in Informatics
    Data:
    konferencja 26.08.2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.MFCS.2024.33 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy