Tipaluck Krityakierne

collaborators

3 papers

math.CO2026

A quick proof that $321$ -avoiding permutations without double deficiencies are counted by the Motzkin numbers

Tipaluck Krityakierne, Thotsaporn "Aek" Thanatipanonda, Doron Zeilberger

We present a short "proof from the Book" that $321$ -avoiding permutations without double deficiencies are counted by the Motzkin numbers. Although this result was first proved by R…

math.PR2026

When Does the Dice Sum Become Prime?

Christoph Koutschan, Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda

Given a (possibly infinite) subset $A$ of the natural numbers, we ask how many times a fair six-sided die must be rolled until the rolled numbers add up to an element of $A$ . Using…

math.PR2026

High-Precision Framework for Expected Hitting Times Analysis in the Dice-Sum Process

Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda

We study the expected number of rolls required for the cumulative sum of a fair six-sided die to first enter a prescribed target set $H \subset Z_{\geq 0}$ . A one-variable dyn…

A quick proof that 321-avoiding permutations without double deficiencies are counted by the Motzkin numbers

When Does the Dice Sum Become Prime?

High-Precision Framework for Expected Hitting Times Analysis in the Dice-Sum Process

A quick proof that $321$ -avoiding permutations without double deficiencies are counted by the Motzkin numbers