Documents

We use results of Vershik, Nechaev, and Bikbov on growth of
random heaps to improve known lower bounds on the rate of growth of the number of knots with respect to the crossing number.
Original languageEnglish
Title of host publicationInternational Conference Polynomial Computer Algebra ‘2020
Subtitle of host publicationSt. Petersburg, October 12–17 2020
EditorsN.N. Vassiliev
Place of PublicationСПб.
PublisherСанкт-Петербургское отделение Математического института им. В. А. Стеклова РАН
Pages105-107
Number of pages3
ISBN (Print)978-5-9651-0568-7
StatePublished - Nov 2020
EventPolynomial Computer Algebra '2020 - Euler International Mathematical Institute, St. Petersburg, Russian Federation
Duration: 12 Oct 2020 → 17 Oct 2020
https://pca-pdmi.ru/2020/

Conference

ConferencePolynomial Computer Algebra '2020
Abbreviated titlePCA 2020
Country/TerritoryRussian Federation
CitySt. Petersburg
Period12/10/20 → 17/10/20
Internet address

    Scopus subject areas

  • Mathematics(all)

ID: 71227148