Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Thotsaporn Aek Thanatipanonda"'
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 209-216 (2023)
Externí odkaz:
https://doaj.org/article/0ae0c804f3cb40a4980fd2115fd8386f
Autor:
Tipaluck Krityakierne, Poohrich Siriputcharoen, Thotsaporn Aek Thanatipanonda, Chaloemkiat Yapolha
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 110-117 (2023)
Externí odkaz:
https://doaj.org/article/144031de076b4b1ab3e3437fde3228c4
Publikováno v:
Discrete Applied Mathematics. 322:391-403
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcb2c2dbbb8e96710bb07bac22c516bb
https://doi.org/10.1016/j.dam.2022.08.027
https://doi.org/10.1016/j.dam.2022.08.027
Publikováno v:
Discrete Applied Mathematics. 283:613-625
We consider various probabilistic games with piles for one player or two players. In each round of the game, a player randomly chooses to add $a$ or $b$ chips to his pile under the condition that $a$ and $b$ are not necessarily positive. If a player
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a39f4b890b5c875102c5d67fa5af8927
https://doi.org/10.1016/j.dam.2020.02.016
https://doi.org/10.1016/j.dam.2020.02.016
Publikováno v:
Journal of Combinatorial Theory, Series A. 166:352-381
We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Dodgson identity with automated proof techniques. More precisely, we fol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f89ffd015138c228c2d570ddc19bdcce
https://doi.org/10.1016/j.jcta.2019.03.001
https://doi.org/10.1016/j.jcta.2019.03.001
Consider a card guessing game with complete feedback in which a deck of $n$ cards ordered $1,\dots, n$ is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses cards from the top of the deck one at a time und
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::242a45044e2565e0bb3cd751a0cc7d23
We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings of hexagona
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0c00a4f5f749a9579e2d03173b5b123
We give an excellent approximation of the average number of spins of a simplified version of a two-player version of the game Dreidel. We also make a conjecture on the average number of spins of the full version of the game.
Comment: 6 pages, 1
Comment: 6 pages, 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c718e394d27856802101c16b0575882f
In the spirit of "multi-culturalism", we use four kinds of computations: simulation, numeric, symbolic, and "conceptual" to explore some "games of pure chance" inspired by children board games like "Snakes and Ladders" (aka as "Chutes and Ladders") a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc23e250223bfc2f5b3ff5347e5aee3f
Publikováno v:
The Electronic Journal of Combinatorics. 24
The solution to the problem of finding the minimum number of monochromatic triples $(x,y,x+ay)$ with $a\geq 2$ being a fixed positive integer over any 2-coloring of $[1,n]$ was conjectured by Butler, Costello, and Graham (2010) and Thanathipanonda (2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::937f30f464f7a67ac31d747bd94d1074
https://doi.org/10.37236/6490
https://doi.org/10.37236/6490