English
Related papers

Related papers: On solution-free sets for simultaneous diagonal po…

200 papers

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

Combinatorics · Mathematics 2022-01-26 Mohammad Golshani , Saharon Shelah

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…

Statistics Theory · Mathematics 2007-06-13 Fadoua Balabdaoui , Jon A. Wellner

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Dynamical Systems · Mathematics 2021-12-09 Karma Dajani , Niels Langeveld

Let $(C,\underline{w})$ be a polarized nodal reducible curve. In this paper we consider coherent systems of type $(r,d,k)$ on $C$ with $k < r$. We prove that the moduli spaces of $(\underline{w},\alpha)$-stable coherent systems stabilize…

Algebraic Geometry · Mathematics 2022-02-10 Sonia Brivio , Filippo F. Favale

This paper is devoted to logarithmic Hardy-Littlewood-Sobolev inequalities in the two-dimensional Euclidean space, in presence of an external potential with logarithmic growth. The coupling with the potential introduces a new parameter,…

Analysis of PDEs · Mathematics 2019-12-25 Jean Dolbeault , Xingyu Li

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

Combinatorics · Mathematics 2007-05-23 Victor Batyrev

We consider solutions of the competitive elliptic system \[ \left\{ \begin{array}{ll} -\Delta u_i = - \sum_{j \neq i} u_i u_j^2 & \text{in $\mathbb{R}^N$} \\ u_i >0 & \text{in $\mathbb{R}^N$} \end{array}\right. \qquad i=1,\dots,k. \] We are…

Analysis of PDEs · Mathematics 2015-04-30 Nicola Soave , Susanna Terracini

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Number Theory · Mathematics 2015-06-16 Kevin O'Bryant

One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…

Number Theory · Mathematics 2025-09-30 Sarah Peluse

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

Group Theory · Mathematics 2017-11-22 C. J. Ashcroft , Colva M. Roney-Dougal

The zero sets of harmonic polynomials play a crucial role in the study of the free boundary regularity problem for harmonic measure. In order to understand the fine structure of these free boundaries a detailed study of the singular points…

Classical Analysis and ODEs · Mathematics 2018-03-16 Matthew Badger , Max Engelstein , Tatiana Toro

Suppose $A$ is a subset of $\{1, \dotsc, N\}$ which does not contain any configurations of the form $x,x+\lfloor n^c \rfloor$ where $n \neq 0$ and $1<c<\frac{6}{5}$. We show that the density of $A$ relative to the first $N$ integers is…

Number Theory · Mathematics 2024-11-19 Maximilian O'Keeffe

The Hardy-Littlewood majorant problem asks whether L^p norms of functions on the circle grow if one replaces their Fourier coefficients with their absolute values. This is clear if p is an even integer, but false if p is any other number.…

Classical Analysis and ODEs · Mathematics 2007-05-23 G. Mockenhaupt , W. Schlag

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…

Number Theory · Mathematics 2022-08-09 Abhishek Jha

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

Combinatorics · Mathematics 2026-04-24 Ben Green , Terence Tao , Tamar Ziegler

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

Dynamical Systems · Mathematics 2019-08-06 Sebastián Donoso , Anh N. Le , Joel Moreira , Wenbo Sun

We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…

Probability · Mathematics 2016-05-03 Vladimir I. Bogachev , Egor D. Kosov , Georgii I. Zelenov

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

Probability · Mathematics 2014-02-06 Bénédicte Haas , Robin Stephenson

Let $F(X)= \prod_{i=1}^k(a_iX+b_i)$ be a polynomial with $a_i, b_i$ being integers. Suppose the discriminant of $F$ is non-zero and $F$ is admissible. Given any natural number $N$, let $S(F,N)$ denotes those integers less than or equal to…

Number Theory · Mathematics 2014-04-01 Gyan Prakash

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is…

Combinatorics · Mathematics 2016-05-11 József Balogh , Hong Liu , Maryam Sharifzadeh