English
Related papers

Related papers: Square-Difference-Free Sets of Size Omega(n^{0.733…

200 papers

We combine here Tao's slice-rank bounding method and Gr\"obner basis techniques and apply here to the Erd\H{o}s-Rado Sunflower Conjecture. Let $\frac{3k}{2}\leq n\leq 3k$ be integers. We prove that if $\mbox{$\cal F$}$ be a $k$-uniform…

Combinatorics · Mathematics 2017-03-17 Gábor Hegedüs

Let $A\subseteq \mathbb Z_n$ be a subset. A sequence $S=(x_1,\ldots,x_k)$ in $\mathbb Z_n$ is said to be an $A$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ such that $a_1x_1+\cdots+a_kx_k=0$. By a square, we shall mean a…

Number Theory · Mathematics 2024-04-09 Krishnendu Paul , Shameek Paul

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…

Combinatorics · Mathematics 2013-11-12 Josef Cibulka

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant

In this work we establish some rigidity results for Serrin's overdetermined problem \begin{equation*} \left\{ \begin{array}{cll} - \Delta u=f(u) & \text{in}& \Omega,\newline u > 0& \text{in} & \Omega,\newline u=0 & \text{on} & \partial…

Analysis of PDEs · Mathematics 2025-02-10 Nicolas Beuvin , Alberto Farina

We show that any subset of $\mathbb{Z}_p^n$ ($p$ an odd prime) without $3$-term arithmetic progression has size $O(p^{cn})$, where $c:=1-\frac{1}{18\log p}<1$. In particular, we find an upper bound of $O(2.84^n)$ on the maximum size of an…

Combinatorics · Mathematics 2016-06-02 Dion Gijswijt

A subset $A$ of the $k$-dimensional grid $\{1,2, \cdots, N\}^k$ is called $k$-dimensional corner-free if it does not contain a set of points of the form $\{ a \} \cup \{ a + de_i : 1 \leq i \leq k \}$ for some $a \in \{1,2, \cdots, N\}^k$…

Combinatorics · Mathematics 2022-03-04 Younjin Kim

For any $\beta>1$, let $T_\beta$ be the classical $\beta$-transformations. Fix $x_0\in[0,1]$ and a nonnegative real number $\hat{v}$, we compute the Hausdorff dimension of the set of real numbers $x\in[0,1]$ with the property that, for…

Dynamical Systems · Mathematics 2020-06-01 Wanlou Wu

Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of $[n]$ with $\mbox{Vdim}(\mbox{$\cal F$} \Delta \mbox{$\cal F$})\leq d$. Let $d\leq n$ be integers. Let $\mbox{$\cal F$}$ be a family of…

Combinatorics · Mathematics 2021-05-11 Gábor Hegedüs

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

Number Theory · Mathematics 2023-12-05 Alexander Kalmynin , Sergei Konyagin

For a subset A of a finite abelian group G we define Sigma(A)={sum_{a\in B}a:B\subset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least quadratic in |A|; the bound |Sigma(A)|>=…

Number Theory · Mathematics 2015-05-13 Simon Griffiths

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

Combinatorics · Mathematics 2023-01-24 Eric Naslund

It is consistent that there is a set mapping from the four-tuples of omega_n into the finite subsets with no free subsets of size t_n for some natural number t_n. For any n< omega it is consistent that there is a set mapping from the pairs…

Logic · Mathematics 2007-05-23 Peter Komjath , Saharon Shelah

We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size $N$ requires size $2^{\Omega(\sqrt[7]{N/logN})}$ to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi…

Computational Complexity · Computer Science 2007-05-23 Nathan Segerlind

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

Metric Geometry · Mathematics 2024-01-26 Ansgar Freyer , Martin Henk

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

Combinatorics · Mathematics 2021-10-13 Jie Ma , Tianchi Yang

Let $n_0(N,k)$ be the number of initial Fourier coefficients necessary to distinguish newforms of level $N$ and even weight $k$. We produce extensive data to support our conjecture that if $N$ is a fixed squarefree positive integer and $k$…

Number Theory · Mathematics 2014-04-18 Sam Chow , Alexandru Ghitza

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Number Theory · Mathematics 2019-03-11 Marc Munsch , Igor E. Shparlinski , Kam Hung Yau

The size of a largest independent set of vertices in a given graph $G$ is denoted by $\alpha(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether…

Combinatorics · Mathematics 2017-09-11 Ingo Schiermeyer

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar