English
Related papers

Related papers: On Lev's periodicity conjecture

200 papers

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. In this paper we shall characterise the largest possible sum-free subsets of G…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

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

Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…

Combinatorics · Mathematics 2018-12-24 Keith J. Edwards , Steven D. Noble

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

A family $\mathcal F\subset 2^{[n]}$ is called intersecting if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Peter Frankl…

Combinatorics · Mathematics 2018-07-02 Andrey Kupavskii

The problem of determining maximal ideals in universal affine vertex algebras is difficult for levels beyond admissible, since there are no simple character formulas which can be applied. Here we investigate when certain quotient $\mathcal…

Quantum Algebra · Mathematics 2024-02-23 Drazen Adamovic , Ozren Perse , Ivana Vukorepa

We use the circle method to prove that a density 1 of elements in $\mathbb{F}_q[t]$ are representable as a sum of three cubes of essentially minimal degree from $\mathbb{F}_q[t]$, assuming the Ratios Conjecture and that the characteristic…

Number Theory · Mathematics 2025-09-16 Tim Browning , Jakob Glas , Victor Y. Wang

We prove that any subset $A \subseteq [3]^n$ with $3^{-n}|A| \ge (\log\log\log\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2,…

Combinatorics · Mathematics 2024-11-25 Amey Bhangale , Subhash Khot , Yang P. Liu , Dor Minzer

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. In this paper we consider the following three general questions: (i) What is the size…

Combinatorics · Mathematics 2016-10-20 Robert Hancock , Andrew Treglown

A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal{F} \subseteq 2^{[n]}$ such that $\mathcal{F} \neq…

Combinatorics · Mathematics 2019-03-07 Jonad Pulaj

A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a…

Combinatorics · Mathematics 2020-03-23 Jiaao Li , Yulai Ma , Yongtang Shi , Weifan Wang , Yezhou Wu

A \emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \leq 4$, Pach and T\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which…

Computational Geometry · Computer Science 2016-08-31 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

Number Theory · Mathematics 2026-05-20 Peter J. Campbell

Inspired by the Croot-Lev-Pach breakthrough, Jordan Ellenberg and Dion Gijswijt have recently amazed the combinatorial world by proving that the largest size of a subset of $F_3^n$ with no 3-term arithmetic progressions is exponentially…

Combinatorics · Mathematics 2016-07-08 Doron Zeilberger

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

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

Combinatorics · Mathematics 2017-07-26 Robert Hancock , Andrew Treglown

We address a problem posed by Nathan Kaplan in the 2014 Combinatorial and Additive Number Theory session: finding the largest subset $H \subseteq (\mathbb{Z}/4\mathbb{Z})^n$ with no distinct $x, y, z \in H$ such that $x + y + z \equiv 0…

Combinatorics · Mathematics 2025-09-04 Alfonso Davila Vera

A celebrated theorem of Selberg states that for congruence subgroups of SL(2,Z) there are no exceptional eigenvalues below 3/16. We prove a generalization of Selberg's theorem for infinite index "congruence" subgroups of SL(2,Z).…

Number Theory · Mathematics 2009-12-31 Jean Bourgain , Alex Gamburd , Peter Sarnak

We establish a regularity result for optimal sets of the isoperimetric problem with double density under mild ($\alpha$-)H\"older regularity assumptions on the density functions. Our main Theorem improves some previous results and allows to…

Analysis of PDEs · Mathematics 2023-08-15 Lisa Beck , Eleonora Cinti , Christian Seis

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

Combinatorics · Mathematics 2019-02-22 Ching Wong
‹ Prev 1 4 5 6 7 8 10 Next ›