Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Yuriy Shablya"'
Publikováno v:
Mathematics, Vol 12, Iss 8, p 1207 (2024)
Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specifie
Externí odkaz:
https://doaj.org/article/b11f2b37bf4346489aa56e1d403cc9dd
Publikováno v:
Mathematics, Vol 11, Iss 13, p 2859 (2023)
There are several general concepts that allow obtaining explicit formulas for the coefficients of generating functions in one variable by using their powers. One such concept is the application of compositae of generating functions. In previous studi
Externí odkaz:
https://doaj.org/article/a529c2256b614a1ca4ef5947ef55bfea
Autor:
Yuriy Shablya
Publikováno v:
Algorithms, Vol 16, Iss 6, p 266 (2023)
Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties. In this article, we demonstrate the possibilities of using the method based on A
Externí odkaz:
https://doaj.org/article/9fc8075cb72e447d85d4e017deb2bae9
Publikováno v:
Algorithms, Vol 15, Iss 2, p 36 (2022)
The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey’s algorithm for unranking m-combinations of an n-set in co-lexicographic ord
Externí odkaz:
https://doaj.org/article/888576cd8ff943ecbef2e2b2b9e489c7
Publikováno v:
Mathematics, Vol 9, Iss 4, p 428 (2021)
In this paper, we study methods for obtaining explicit formulas for the coefficients of generating functions. To solve this problem, we consider the methods that are based on using the powers of generating functions. We propose to generalize the conc
Externí odkaz:
https://doaj.org/article/d005ba8d1bcb4240a674ea0c543aecba
Publikováno v:
Mathematics, Vol 8, Iss 6, p 962 (2020)
In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms. We present basic general methods
Externí odkaz:
https://doaj.org/article/73c30e33137941a7a74f62747f22dd9e
Autor:
Yuriy Shablya, Dmitry Kruchinin
Publikováno v:
Symmetry, Vol 12, Iss 4, p 600 (2020)
In this paper, we study such combinatorial objects as labeled binary trees of size n with m ascents on the left branch and labeled Dyck n-paths with m ascents on return steps. For these combinatorial objects, we present the relation of the generated
Externí odkaz:
https://doaj.org/article/852f6c7bba75487e84d9fe5937a60e80
Publikováno v:
2021 International Conference Engineering and Telecommunication (En&T).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f481db7b4a07acaa6f2e74bd61dbce75
https://doi.org/10.1109/ent50460.2021.9681730
https://doi.org/10.1109/ent50460.2021.9681730
Publikováno v:
Polynomials-Theory and Application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=intech______::3a3cdccf5eae012bbec4725e2db462bb
http://www.intechopen.com/articles/show/title/obtaining-explicit-formulas-and-identities-for-polynomials-defined-by-generating-functions-of-the-fo
http://www.intechopen.com/articles/show/title/obtaining-explicit-formulas-and-identities-for-polynomials-defined-by-generating-functions-of-the-fo
