English
Related papers

Related papers: On one problem of Gowers

200 papers

Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…

Combinatorics · Mathematics 2019-03-05 Wiebke Bedenknecht , Guilherme Oliveira Mota , Christian Reiher , Mathias Schacht

We prove that for a symmetric, strictly log-convex density on the real line, there are four possible types of perimeter-minimizing triple bubbles. This extends the work of Bongiovanni et al., which shows that there are two possible types of…

Metric Geometry · Mathematics 2020-11-05 Nat Sothanaphan

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Number Theory · Mathematics 2021-01-06 Sarah Peluse

Let \Gamma(n,p) denote the binomial model of a random triangular group. We show that there exist constants c, C > 0 such that if p <= c/n^2, then a.a.s. \Gamma(n,p) is free and if p >= C log n/n^2 then a.a.s. \Gamma(n,p) has Kazhdan's…

Group Theory · Mathematics 2019-02-20 Sylwia Antoniuk , Tomasz Łuczak , Jacek Świcatkowski

For an element in $BS(1,n) = \langle t,a | tat^{-1} = a^n \rangle$ written in the normal form $t^{-u}a^vt^w$ with $u,w \geq 0$ and $v \in \mathbb{Z}$, we exhibit a geodesic word representing the element and give a formula for its word…

Group Theory · Mathematics 2020-06-26 Jennifer Taback , Alden Walker

We give a new equivalent restatement and a new proof in terms of trios to the classical Kneser's theorem. In the finite case, our restatement takes the following, particularly symmetric shape: if $A$, $B$, and $C$ are subsets of a finite…

Number Theory · Mathematics 2016-02-09 David J. Grynkiewicz , Vsevolod F. Lev

It is shown that there is a constant A and a density one subset S of the positive integers, such that for all q in S there is some 1<=p<q, (p, q)=1, so that p/q has all its partial quotients bounded by A.

Number Theory · Mathematics 2013-07-15 Jean Bourgain , Alex Kontorovich

We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer $k\geq 2$ and every set $A$ of words over $k$ satisfying \[\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0\] there exist a…

Combinatorics · Mathematics 2015-09-22 Pandelis Dodos , Vassilis Kanellopoulos , Konstantinos Tyros

In this paper, we prove that a natural candidate for a homogeneous norm on a graded Lie algebra of any length satisfies the triangle inequality which answers Moskowitz's question.

General Mathematics · Mathematics 2024-07-03 Songpon Sriwongsa , Keng Wiboonton

Letting $\delta_1(n,m)$ be the density of the set of integers with exactly one divisor in $(n,m)$, Erd\H{o}s wondered if $\delta_1(n,m)$ is unimodular for fixed $n$. We prove this is false in general, as the sequence $(\delta_1(n,m))$ has…

Number Theory · Mathematics 2025-01-20 Stijn Cambie

We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…

Computational Geometry · Computer Science 2012-12-12 Jean Cardinal , Kolja Knauer , Piotr Micek , Torsten Ueckerdt

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

Combinatorics · Mathematics 2007-05-23 Terence Tao

Let $k\geq 2$ be a square-free integer. We prove that the number of square-free integers $m\in [1,N]$ such that $(k,m)=1$ and $\mathbb{Q}(\sqrt[3]{k^2m})$ is monogenic is $\gg N^{1/3}$ and $\ll N/(\log N)^{1/3-\epsilon}$ for any…

Number Theory · Mathematics 2020-09-08 Zafer Selcuk Aygin , Khoa D. Nguyen

We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph…

Computational Complexity · Computer Science 2013-06-28 Manuel Sorge

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

Number Theory · Mathematics 2016-09-07 Pieter Moree

Let $d_S$ denote the arithmetic density of a subset $S \subseteq \mathbb N$. We derive a power series in $q\in \mathbb C$, $|q|<1$, with co\"efficients related to integer partitions and integer compositions, that yields $1/d_S$ in the limit…

Number Theory · Mathematics 2022-08-29 Robert Schneider , Andrew V. Sills

Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e^{c(\log N)^c} for densities \alpha > (\log N)^{-2 +…

Number Theory · Mathematics 2013-10-10 Kevin Henriot

We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\lfloor n^2/4 \rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.

Combinatorics · Mathematics 2015-06-11 Ervin Győri , Balázs Keszegh

The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\"odl showed that, with high probability, $G(n,p)$ contains…

Combinatorics · Mathematics 2026-04-29 Xinbu Cheng , Hong Liu , Lanchao Wang , Zhifei Yan

We confirm the list from \cite{MSS} of values $D$ for which the high-density hard-core model on $\mathbb{Z}^2$ with exceptional distance $D$ has infinitely many extremal Gibbs states. As a byproduct, we prove that for all $D>0$ there exists…

Metric Geometry · Mathematics 2020-06-25 Dmitry Krachun