Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Shalosh B. Ekhad"'
Publikováno v:
Enumerative Combinatorics and Applications, Vol 1, Iss 3, p Article S2R17 (2021)
Externí odkaz:
https://doaj.org/article/85b1e9121f0e4db0b15ff907f4d115f6
Autor:
Shalosh B. Ekhad, Doron Zeilberger
Publikováno v:
Annals of Combinatorics. 23:717-724
We use George Andrews’ “reverse-engineering” method to reprove, using experimental mathematics, a conjecture of D.H. Lehmer.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c3fcec9840e1392d9bc8931699c54a7
https://doi.org/10.1007/s00026-019-00441-y
https://doi.org/10.1007/s00026-019-00441-y
Publikováno v:
Mathematical Intelligencer, 42, 3, pp. 10-11
Mathematical Intelligencer, 42, 10-11
Mathematical Intelligencer, 42, 10-11
We find this identity, that looks like an exercise in Calculus 1, surprising, and beautiful. We hope that you would too.
Comment: 1+epsilon pages. This version corrects a typo pointed out by Greg Egan, gives links to a beautiful animation that h
Comment: 1+epsilon pages. This version corrects a typo pointed out by Greg Egan, gives links to a beautiful animation that h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89e8df20b44bc6e1346411e75a4dad9b
https://doi.org/10.1007/s00283-020-09972-2
https://doi.org/10.1007/s00283-020-09972-2
Publikováno v:
Enumerative Combinatorics and Applications, Vol 1, Iss 3, p Article S2R17 (2021)
In this memorial tribute to Joe Gillis, who taught us that Special Functions count, we show how the seminal Even-Gillis integral formula for the number of derangements of a multiset, in terms of Laguerre polynomials, can be used to efficiently comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bf995d7ed3406708459126e60ee7107
https://doi.org/10.54550/eca2021v1s3r17
https://doi.org/10.54550/eca2021v1s3r17
Autor:
Doron Zeilberger, Shalosh B. Ekhad
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783319683751
The Rudin–Shapiro polynomials \(P_k(z)\), are defined by a certain linear functional recurrence equation and are of interest in signal processing due to their special autocorrelation properties. An algorithmic approach to computation of the moments
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28a785b6a9dc7ff63ab68f41a2d46b69
https://doi.org/10.1007/978-3-319-68376-8_15
https://doi.org/10.1007/978-3-319-68376-8_15
Autor:
Shalosh B. Ekhad, Doron Zeilberger
Publikováno v:
Journal of Difference Equations and Applications. 20:852-858
Jacobi said ‘man muss immer umkehren’. And indeed it takes a genius like Michael Somos to take a specific nonlinear recurrence, like a(n) = (a(n − 1)a(n − 3)+a(n − 2)2)/a(n − 4), subject to a(1) = 1, a(2) = 1, a(3) = 1, a(4) = 1, and obse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fb8b3b8b5378fa2c7037767d4a0b8cf
https://doi.org/10.1080/10236198.2013.823956
https://doi.org/10.1080/10236198.2013.823956
Publikováno v:
Journal of Difference Equations and Applications. 19:520-526
The beautiful theory of statistical gambling, started by Dubins and Savage (for subfair games) and continued by Kelly and Breiman (for superfair games), has mostly been studied under the unrealistic assumption that we live in a continuous world, that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd855f83601b9891a215174fa95e9046
https://doi.org/10.1080/10236198.2012.656620
https://doi.org/10.1080/10236198.2012.656620
Autor:
Shalosh B. Ekhad, Doron Zeilberger
Publikováno v:
Alles Mathematik ISBN: 9783658099893
Wir alle kennen die Geschichte, wie der junge Carl Friedrich Gaus angeblich die ersten 100 Zahlen aufaddierte, indem er einen „genialen“ Trick anwandte: Er addierte 1 und 100, dann 2 und 99, 3 und 98, und so weiter. Sein Trick ware aber klaglich
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b70c0c2d2ea8d84ba4be2ea88711516
https://doi.org/10.1007/978-3-658-09990-9_26
https://doi.org/10.1007/978-3-658-09990-9_26
Publikováno v:
Discrete Mathematics. 309(23-24):6626-6631
We investigate the notion of almost avoiding a permutation: $\pi$ almost avoids $\beta$ if one can remove a single entry from $\pi$ to obtain a $\beta$-avoiding permutation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4ea9a1a669a167d2ab31e5869cb015d
Autor:
Shalosh B. Ekhad, Doron Zeilberger
Publikováno v:
Advances in Applied Mathematics. 41(2):206-213
Gian-Carlo's powerfull Umbral calculus, suitably automated, is used to enumerate large families of Richard Stanley's P-partitions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8689638b9699aa669d064a36bf3d1585