Related papers: Avoiding a star of three-term arthmetic progressio…

The derived category of a Gorenstein triangular matrix algebra $A$ admits an unbounded ladder, which is of period $3$ if $A = T_2(B)$. Also, a left recollement of triangulated categories with Serre functors sits in a ladder of period $1$;…

We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of…

Several recent papers have considered the problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to rings of integers in quadratic number fields…

We introduce a new notion of sparsification, called \emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a strong sparsification algorithm for 1-in-3-SAT. The…

Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…

In this paper, we study the rainbow Erd\H{o}s-Rothschild problem with respect to $k$-term arithmetic progressions. For a set of positive integers $S \subseteq [n]$, an $r$-coloring of $S$ is \emph{rainbow $k$-AP-free} if it contains no…

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional…

We show that more than two generations of quarks and leptons are required to have an anomaly free discrete R-symmetry larger than R-parity, provided that the supersymmetric Standard Model can be minimally embedded into a grand unified…

We use Andrew Baker's analysis of the cofiber of the endomorphism of the $p$-adic elliptic spectrum ($p>3$) defined by multiplication by the `Hasse invariant' $E_{p-1}$ to present its completion away from the locus of ordinary elliptic…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…

Szemer\'edi's theorem implies that there are $2^{o(n)}$ subsets of $[n]$ which do not contain a $k$-term arithmetic progression. A sparse analogue of this statement was obtained by Balogh, Morris, and Samotij, using the hypergraph container…

We give upper and lower bounds for the largest integer not representable as positive linear combination of three given integers, disproving an upper bound conjectured by Beck, Einstein and Zacks.

Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In…

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset $A\subseteq\mathbb F_p$ with $p$ prime and $|A|<0.0045p$, (i) if $|A+A|<2.59|A|-3$ and $|A|>100$, then $A$ is contained in an arithmetic…

We study the $L^p$-convergence of Fourier expansions in terms of non-symmetric Heckman-Opdam polynomials of type $A_1$. Using kernel estimates and duality arguments, we prove that the partial sums converge in $ L^p([-\pi,\pi],dm_k)$ for…

In this paper we critique Keum-Bae Cho's proof that $\mathrm{P} \subsetneq \mathrm{NP}$. This proof relates instances of 3-SAT to indistinguishable binomial decision trees and claims that no polynomial-time algorithm can solve 3-SAT…