English
Related papers

Related papers: Capturing Forms in Dense Subsets of Finite Fields

200 papers

A relativistic quantum field theory is presented for finite density problems based on the principle of locality. It is found that, in addition to the conventional ones, a local approach to the relativistic quantum field theories at both…

High Energy Physics - Theory · Physics 2014-11-18 S. Ying

A number field $k$ admits a binary integral quadratic form which represents all integers locally but not globally if and only if the class number of $k$ is bigger than one. In this case, there are only finitely many classes of such binary…

Number Theory · Mathematics 2021-11-02 Fei Xu , Yang Zhang

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

Combinatorics · Mathematics 2023-08-28 Bryce Frederickson , Liana Yepremyan

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…

Logic · Mathematics 2020-09-10 Natasha Dobrinen

Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of…

Combinatorics · Mathematics 2018-03-21 David Conlon , Jacob Fox

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

For graphs $G$, $F$ and $H$, let $G\rightarrow (F,H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$. The Ramsey number $R(F,H)=\min\{r|\; K_r\rightarrow (F,H)\}$. In this note, we consider redundant…

Combinatorics · Mathematics 2019-04-18 Ye Wang , Yusheng Li , Yan Li

We consider the equation $$ ab + cd = \lambda, \qquad a\in A, b \in B, c\in C, d \in D, $$ over a finite field $F_q$ of $q$ elements, with variables from arbitrary sets $ A, B, C, D \subseteq F_q$. The question of solvability of such and…

Number Theory · Mathematics 2007-09-16 Igor E. Shparlinski

If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently…

Combinatorics · Mathematics 2012-11-02 John Goldwasser , John Talbot

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

Number Theory · Mathematics 2017-06-14 Wai Kiu Chan , Alicia Marino

We show that, for $n$ large, there must exist at least \[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic $K_t$s in any two-colouring of the edges of $K_n$, where $C \approx 2.18$ is an explicitly defined constant. The old lower bound, due to…

Combinatorics · Mathematics 2007-12-03 David Conlon

For positive integers $n,r,s$ with $r > s$, the set-coloring Ramsey number $R(n;r,s)$ is the minimum $N$ such that if every edge of the complete graph $K_N$ receives a set of $s$ colors from a palette of $r$ colors, then there is guaranteed…

Combinatorics · Mathematics 2022-06-24 David Conlon , Jacob Fox , Xiaoyu He , Dhruv Mubayi , Andrew Suk , Jacques Verstraete

We say that a subset $M$ of $\mathbb R^n$ is exponentially Ramsey if there are $\epsilon>0$ and $n_0$ such that $\chi(\mathbb R^n,M)\ge(1+\epsilon)^n$ for any $n>n_0$, where $\chi(\mathbb R^n,M)$ stands for the minimum number of colors in a…

Combinatorics · Mathematics 2026-02-03 Andrey Kupavskii , Arsenii Sagdeev , Dmitrii Zakharov

We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…

Combinatorics · Mathematics 2025-11-03 Sukrit Chakraborty , Sayan Goswami , Sourav Kanti Patra

The problem of the classification of the indefinite binary quadratic forms with integer coefficients is solved introducing a special partition of the de Sitter world, where the coefficients of the forms lie, into separate domains. Every…

Number Theory · Mathematics 2008-03-27 Francesca Aicardi

The $q$-color Ramsey number of a $k$-uniform hypergraph $H$ is the minimum integer $N$ such that any $q$-coloring of the complete $k$-uniform hypergraph on $N$ vertices contains a monochromatic copy of $H$. The study of these numbers is one…

Combinatorics · Mathematics 2023-08-22 Domagoj Bradač , Jacob Fox , Benny Sudakov

We provide a characterization of integers represented by the positive definite binary quadratic form $ax^2+bxy+cy^2$. In order to prove the main theorem, we define the "relative conductor" of two orders in an imaginary quadratic field. Then…

Number Theory · Mathematics 2020-02-20 Naoki Uchida

Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…

Number Theory · Mathematics 2016-03-08 Shuangnian Hu , Shaofang Hong , Xiaoer Qin

We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…

Combinatorics · Mathematics 2018-08-22 David Covert , Yeşim Demiroğlu Karabulut , Jonathan Pakianathan

A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the family $\cal F$ in every edge coloring…

Combinatorics · Mathematics 2012-07-03 Amir Khamseh , Gholam Reza Omidi