Thotsaporn Thanatipanonda

Affiliations:
  • Mahidol University International College (MUIC), Science Division, Nakhonpathom, Thailand


According to our database1, Thotsaporn Thanatipanonda authored at least 18 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
von Neumann and Newman Pokers with Finite Decks.
CoRR, 2024

2023
The card guessing game: A generating function approach.
J. Symb. Comput., 2023

2022
Binomial determinants for tiling problems yield to the holonomic ansatz.
Eur. J. Comb., 2022

The arithmetic-periodicity of cut for C={1, 2c}.
Discret. Appl. Math., 2022

2021
A multi-computational exploration of some games of pure chance.
J. Symb. Comput., 2021

2020
Game of pure chance with restricted boundary.
Discret. Appl. Math., 2020

2019
A Probabilistic Two-Pile Game.
J. Integer Seq., 2019

A curious family of binomial determinants that count rhombus tilings of a holey hexagon.
J. Comb. Theory A, 2019

2018
Curious Bounds for Floor Function Sums.
J. Integer Seq., 2018

2017
On the Minimum Number of Monochromatic Generalized Schur Triples.
Electron. J. Comb., 2017

2016
Determinants Containing Powers of Generalized Fibonacci Numbers.
J. Integer Seq., 2016

2014
Rook endgame problems in <i>m</i> by <i>n</i> Chess.
Adv. Appl. Math., 2014

2011
Advanced Computer Algebra for Determinants
CoRR, 2011

Further Hopping with Toads and Frogs.
Electron. J. Comb., 2011

2009
On the Monochromatic Schur Triples Type Problem.
Electron. J. Comb., 2009

2008
Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only).
ACM Commun. Comput. Algebra, 2008

Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (II) (abstract only).
ACM Commun. Comput. Algebra, 2008

How to beat Capablanca.
Adv. Appl. Math., 2008


  Loading...