Related papers: Algorithmic Polynomial Freiman-Ruzsa Theorems

Using recurrences gotten from the Apagodu-Zeilberger Multivariate Almkvist-Zeilberger algorithm we present a linear-time, and constant-space, algorithm to compute the general mixed moments of the k-variate general normal distribution, with…

We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As…

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat…

We bound the running time of an algorithm that computes the genus-two class polynomials of a primitive quartic CM-field K. This is in fact the first running time bound and even the first proof of correctness of any algorithm that computes…

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…

In 1971, Ruzsa conjectured that if $f:\ \mathbb{N}\rightarrow\mathbb{Z}$ with $f(n+k)\equiv f(n)$ mod $k$ for every $n,k\in\mathbb{N}$ and $f(n)=O(\theta^n)$ with $\theta<e$ then $f$ is a polynomial. In this paper, we investigate the…

Let ${\Bbb F}_2$ be the finite field of two elements, ${\Bbb F}_2^n$ be the vector space of dimension $n$ over ${\Bbb F}_2$. For sets $A,\,B\subseteq{\Bbb F}_2^n$, their sumset is defined as the set of all pairwise sums $a+b$ with $a\in…

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. First we show that if $A \subset \mathbb{Z}$ with $|A+A| \le…

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the…

Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…

In this paper, we study the Vlasov-Maxwell-Boltzmann system without angular cutoff and the Vlasov-Maxwell-Landau/Boltzmann system with polynomial perturbation $F=\mu+f$ near global Maxwellian. In particular, we prove the global existence,…

In this paper we present the techniques for computing cosmological bounces in polynomial $f(R)$ theories, whose order is more than two, for spatially flat FLRW spacetime. In these cases the conformally connected Einstein frame shows up…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

We show how Viennot's combinatorial theory of orthogonal polynomials may be used to generalize some recent results of Sukumar and Hodges on the matrix entries in powers of certain operators in a representation of su(1,1). Our results link…