Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Alek Vainshtein"'
Autor:
Idan Eisner, Alek Vainshtein
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
no abstract
Externí odkaz:
https://doaj.org/article/9222f404f063417fb5dafb331df1ef49
Autor:
Toufik Mansour, Alek Vainshtein
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 1 (2000)
We find an explicit expression for the generating function of the number of permutations in S n avoiding a subgroup of S k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook
Externí odkaz:
https://doaj.org/article/dc412c990e804832aacf888f1c5b589c
As is well-known, cluster transformations in cluster structures of geometric type are often modeled on determinant identities, such as short Plucker relations, Desnanot--Jacobi identities and their generalizations. We present a construction that play
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::daa0dde8dfd250cd642f4ec1316c64fb
http://arxiv.org/abs/1912.00453
http://arxiv.org/abs/1912.00453
Publikováno v:
Advances in Mathematics. 300:390-450
The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the pentagram m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05a38ea725f86451e05f87220cc82022
https://doi.org/10.1016/j.aim.2016.03.023
https://doi.org/10.1016/j.aim.2016.03.023
Publikováno v:
Memoirs of the American Mathematical Society. 246
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc5f9579a261b6ab74bf154898b6cdfb
https://doi.org/10.1090/memo/1165
https://doi.org/10.1090/memo/1165
Publikováno v:
Proceedings of the National Academy of Sciences. 111:9688-9695
We study natural cluster structures in the rings of regular functions on simple complex Lie groups and Poisson-Lie structures compatible with these cluster structures. According to our main conjecture, each class in the Belavin-Drinfeld classificatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9062023ed34258ba746defa38a7cf851
https://doi.org/10.1073/pnas.1315283111
https://doi.org/10.1073/pnas.1315283111
Publikováno v:
Proceedings of the London Mathematical Society
We construct a generalized cluster structure compatible with the Poisson bracket on the Drinfeld double of the standard Poisson-Lie group $GL_n$ and derive from it a generalized cluster structure on $GL_n$ compatible with the push-forward of the Pois
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::476b6d2a8af9eb6dfa6ba8aefcffd0f7
http://arxiv.org/abs/1605.05705
http://arxiv.org/abs/1605.05705
Publikováno v:
Moscow Mathematical Journal. 12:293-312
We study natural cluster structures in the rings of regular func- tions on simple complex Lie groups and Poisson-Lie structures compatible with these cluster structures. According to our main conjecture, each class in the Belavin-Drinfeld classificat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1a2b07977ef04070735350a191dec60
https://doi.org/10.17323/1609-4514-2012-12-2-293-312
https://doi.org/10.17323/1609-4514-2012-12-2-293-312
Publikováno v:
Discrete Mathematics. 298(1-3):321-333
We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.
10 pages, 1 figure
10 pages, 1 figure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da93406dc0634bb22f5200e480c4bd7b
Publikováno v:
Discrete Applied Mathematics. 129:513-520
We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c115db39e7f971d0985a1cdda8cd53a
https://doi.org/10.1016/s0166-218x(03)00359-7
https://doi.org/10.1016/s0166-218x(03)00359-7