Pitchayut Saengrungkongka

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Sparse $k$ -AP Covering Sets and the Arithmetic Kakeya Conjecture

Pitchayut Saengrungkongka

A subset $A \subseteq N_{0}$ is $k$ -AP covering if there exists a constant $n_{0}$ such that for every integer $x > n_{0}$ , there exists $d \in N_{0}$ such that $x-d, x-2d,\dots…

math.CO2026

Extremal $t$ -intersecting Families of Permutations for Large $t$

Pitchayut Saengrungkongka

A set of permutations of ${1, 2, \dots, n}$ is $t$ -intersecting if any two permutations agree on at least $t$ inputs. A recent work by Kupavskii, in the spirit of the Erdős-Ko-Rado…

math.CO2025

Improved Bounds on Rainbow $k$ -partite Matchings

Pitchayut Saengrungkongka

Let $n$ , $s$ , and $k$ be positive integers. We say that a sequence $f_{1}, \dots, f_{s}$ of nonnegative integers is satisfying if for any collection of $s$ families $\mathcal F_1,\dots,\…

math.CO2025

On $t$ -intersecting Families of Spanning Trees

Pitchayut Saengrungkongka

We prove that there exists a constant $c > 0$ such that for all integers $2 \leq t \leq c n$ , if $\calA$ is a collection of spanning trees in $K_{n}$ such that any two intersect at at lea…

Sparse k-AP Covering Sets and the Arithmetic Kakeya Conjecture

Extremal t-intersecting Families of Permutations for Large t

Improved Bounds on Rainbow k-partite Matchings

On t-intersecting Families of Spanning Trees

Sparse $k$ -AP Covering Sets and the Arithmetic Kakeya Conjecture

Extremal $t$ -intersecting Families of Permutations for Large $t$

Improved Bounds on Rainbow $k$ -partite Matchings

On $t$ -intersecting Families of Spanning Trees