Searcharxiv⌕ Search

arXiv subjects

Robert Fraser

Publications and source records attributed to Robert Fraser.

At least 19 recordsLinked to original sources

Game Arena: Strategic LLM Evaluation in Competitive Environments

We introduce Kaggle Game Arena, an open and ever-expanding platform to evaluate large language models (LLMs) through competitive games. Different from static benchmarks, game arena enables models to play head-to-head matchups in structured environments where the gameplay strength naturally increases as models evolve, preventing performance saturation. This technical report details the infrastructure behind Game Arena and describes the three pilot game environments: Chess, Poker, and Werewolf. These environments span perfect information, imperfect information, and multiplayer game settings, enabling a systematic study of models' strategic planning, adaptation, and robustness under uncertainty. For each game, we provide a detailed description of the environment, evaluation metrics, and results from running full competitions across models. Through robust infrastructure and large-scale ground-truth based evaluation, Game Arena ensures reproducibility, transparency and generalizability to new games and variants over time.

cs.AI↗

Prescribed projections for a general class of maps and efficient covering by variable plane curves

We prove a prescribed projection theorem for any class of non-linear projections defined on open subsets of the plane which satisfies some mild geometric conditions. This generalizes Davies's classic result on prescribed projections for orthogonal projections, as well as a recent result of authors, Chang, McDonald, and Taylor, on a specific class of non-linear projection maps. We also give several geometric applications, including a proof that certain classes of plane curves can be used to cover arbitrary measurable sets with measure zero error.

math.CA↗

Fourier restriction and well-approximable numbers

We use a deterministic construction to prove the optimality of the exponent in the Mockenhaupt-Mitsis-Bak-Seeger Fourier restriction theorem for dimension $d=1$ and parameter range $0 < a,b \leq d$ and $b\leq 2a$. Previous constructions by Hambrook and Łaba \cite{HL2013} and Chen \cite{chen} required randomness and only covered the range $0 < b \leq a \leq d=1$. We also resolve a question of Seeger \cite{seeger-private} about the Fourier restriction inequality on the sets of well-approximable numbers.

math.CA↗

Explicit Salem sets in $\mathbb{R}^n$

We construct the first explicit (i.e., non-random) examples of Salem sets in $\mathbb{R}^n$ of arbitrary prescribed Hausdorff dimension. This completely resolves a problem proposed by Kahane more than 60 years ago. The construction is based on a form of Diophantine approximation in number fields.

math.CA↗

On The Local Sum Conjecture in Two Dimensions

In this paper we give an elementary proof of the local sum conjecture in two dimensions. In a remarkable paper [CMN, arXiv:1810.11340], this conjecture has been established in all dimensions using sophisticated, powerful techniques from a research area blending algebraic geometry with ideas from logic. The purpose of this paper is to give an elementary proof of this conjecture which will be accessbile to a broad readership.

math.CA↗

Polynomial Roth theorems on sets of fractional dimensions

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $α\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability measure satisfying certain dimension condition and Fourier decay condition, then $E$ contains three points $x, x+t, x+P(t)$ for some $t>0$. Our result extends the one of Laba and the third author to the polynomial setting, under the same assumption. It also gives an affirmative answer to a question in Henriot, Laba and the third author.

math.CA↗

Large subsets of Local Fields not containing Configurations

For certain families of functions $\{f_q\}$ mapping $K^{nv_q} \to K^m$, where $K$ is a complete, nonarchimedean local field, we find a set $E$ of large Hausdorff dimension with the property that $f_q(x_1, \ldots, x_{v_q})$ is nonzero for any distinct points $x_1, \ldots, x_{v_q} \in E$. In particular, this result can be applied to show that the ring of integers of any local field contains a subset of Hausdorff dimension $1$ not containing any nondegenerate 3-term arithmetic progressions.

math.CA↗

A framework for constructing sets without configurations

We discuss a framework for constructing large subsets of $\mathbb{R}^n$ and $K^n$ for non-archimedean local fields $K$. This framework is applied to obtain new estimates for the Hausdorff dimension of angle-avoiding sets and to provide a counterexample to a limiting version of the Capset problem.

math.CA↗

Explicit Salem sets, Fourier restriction, and metric Diophantine approximation in the $p$-adic numbers

We exhibit the first explicit examples of Salem sets in $\mathbb{Q}_p$ of every dimension $0 < α< 1$ by showing that certain sets of well-approximable $p$-adic numbers are Salem sets. We construct measures supported on these sets that satisfy essentially optimal Fourier decay and upper regularity conditions, and we observe that these conditions imply that the measures satisfy strong Fourier restriction inequalities. We also partially generalize our results to higher dimensions. Our results extend theorems of Kaufman, Papadimitropoulos, and Hambrook from the real to the $p$-adic setting.

math.CA↗

Large Sets Avoiding Patterns

We construct subsets of Euclidean space of large Hausdorff dimension and full Minkowski dimension that do not contain nontrivial patterns described by the zero sets of functions. The results are of two types. Given a countable collection of $v$-variate vector-valued functions $f_q : (\mathbb{R}^{n})^v \to \mathbb{R}^m$ satisfying a mild regularity condition, we obtain a subset of $\mathbb{R}^n$ of Hausdorff dimension $\frac{m}{v-1}$ that avoids the zeros of $f_q$ for every $q$. We also find a set that simultaneously avoids the zero sets of a family of uncountably many functions sharing the same linearization. In contrast with previous work, our construction allows for non-polynomial functions as well as uncountably many patterns. In addition, it highlights the dimensional dependence of the avoiding set on $v$, the number of input variables.

math.CA↗

Kakeya-Type Sets in Local Fields with Finite Residue Field

We present a construction of a measure-zero Kakeya-type set in a finite-dimensional space $K^d$ over a local field with finite residue field. The construction is an adaptation of the ideas appearing in [12] and [13]. The existence of measure-zero Kakeya-type sets over discrete valuation rings is also discussed, giving an alternative construction to the one presented in [4] over $\mathbb{F}_q[[t]]$.

math.CA↗