7 citations · 16 across the 11 of their papers we have counts for
11 papers
The Distribution of Double Deficiencies in Pattern-Avoiding Permutations
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda, Doron Zeilberger
We study the distribution of the number of double deficiencies (DD) in permutations of length n avoiding one or two patterns of length 3. Using structural decompositions of these a…
A quick proof that -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 -avoiding permutations without double deficiencies are counted by the Motzkin numbers. Although this result was first proved by R…
When Does the Dice Sum Become Prime?
Christoph Koutschan, Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
Given a (possibly infinite) subset 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 . Using…
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 . A one-variable dyn…
von Neumann and Newman Pokers with Finite Decks
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda, Doron Zeilberger
John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between and . We harness the power of co…
The slowest coupon collector's problem
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
In the classical coupon collector's problem, every box of breakfast cereal contains one coupon from a collection of n distinct coupons, each equally likely to appear. The goal is t…
No-feedback Card Guessing Game: Moments and distributions under the optimal strategy
Tipaluck Krityakierne, Poohrich Siriputcharoen, Thotsaporn Aek Thanatipanonda +1
Relying on the optimal guessing strategy recently found for a no-feedback card guessing game with -time riffle shuffles, we derive an exact, closed-form formula for the expected…
No Feedback? No Worries! The art of guessing the right card
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
In 1998, Ciucu published "No-feedback card guessing for dovetail shuffles", an article which gives the optimal guessing strategy for cards ( even) after riffle shuffles…
Ansatz in a Nutshell: A comprehensive step-by-step guide to polynomial, -finite, holonomic, and -finite sequences
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
Given a sequence 1, 1, 5, 23, 135, 925, 7285, 64755, 641075, 6993545, 83339745,..., how can we guess a formula for it? This article will quickly walk you through the concept of ans…
The Card Guessing Game: A generating function approach
Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
Consider a card guessing game with complete feedback in which a deck of cards ordered is riffle-shuffled once. With the goal to maximize the number of correct gues…
Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization
Poompol Buathong, David Ginsbourger, Tipaluck Krityakierne
We focus on kernel methods for set-valued inputs and their application to Bayesian set optimization, notably combinatorial optimization. We investigate two classes of set kernels t…