2 citations · 2 across the 7 of their papers we have counts for
7 papers · 1 filter
Restricted generalized Schur numbers
Collier Gaiser
For , let be the smallest , if exists, such that every -coloring of has a monochromatic solution to the equation \[ x_1…
Pattern avoidance in permutations and their rotations
Ömer Eğecioğlu, Collier Gaiser, Mei Yin
A rotation of a permutation is a new permutation obtained by moving the first several terms of the permutation to the end of the permutation. A circular permutation is the set of a…
A sharp lower bound for some reciprocal Rado numbers
Collier Gaiser, Mojtaba Ramezanpour
Let be the smallest such that every -coloring of has a monochromatic solution to the equation \[\frac{1}{x_1}+\frac{1}{x_2}+\cdots+\frac{1}{x_k}=…
Subsequence sums in permutations
Collier Gaiser, Paul Horn
A sequence of positive integers is called -additive if or . In this paper, we prove that for all , if $…
Enumerating pattern-avoiding permutations by leading terms
Ömer Eğecioğlu, Collier Gaiser, Mei Yin
The number of 123-avoiding permutation on with a fixed leading terms is counted by the ballot numbers. The same holds for -avoiding permutations. These resu…
Maker-Breaker Rado games for equations with radicals
Collier Gaiser, Paul Horn
We study two-player positional games where Maker and Breaker take turns to select a previously unoccupied number in . Maker wins if the numbers selected by Maker…
On Rado numbers for equations with unit fractions
Collier Gaiser
Let be the smallest positive integer such that every -coloring of has a monochromatic solution to the nonlinear equation \[1/x_1+\cdots+1/x_k=1/y,\]…