Related papers: Freiman's theorem in finite fields via extremal se…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

In this work, families of kinks are analytically identified in multifield theories with either polynomial or deformed sine-Gordon-type potentials. The underlying procedure not only allows us to obtain analytical solutions for these models,…

In this paper the authors study set expansion in finite fields. Fourier analytic proofs are given for several results recently obtained by Solymosi, Vinh and Vu using spectral graph theory. In addition, several generalizations of these…

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…

We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected.…

We prove an effective version of a theorem of Dufresnoy: For any set of 2n+1 hyperplanes in general position in n-dimensional complex projective space, we find an explicit constant K such that for every holomorphic map f from the unit disc…

Let $A \subseteq F_2^n$ be a set with $|2A| = K|A|$. We prove that if (1) for at least a fraction $1-K^{-9}$ of all $s \in 2A$, the set $(A+s) \cap A$ has size at most $L\cdot|A|/K$, or (2) for at least a fraction $K^{-L}$ of all $s \in…

The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…

The main purpose of the following article is to give a proof of Y. Kawamata's celebrated subadjunction theorem in the spirit of our previous work on Bergman kernels. We will use two main ingredients : an $\displaystyle L^{2\over…

The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Let $k$ be a non-archimedean complete field. We prove a substitute for the reduced fiber theorem (of Bosch, L\"utkebohmert and Raynaud) that holds for every morphism $Y\to X$ flat and with geometrically reduced fibers between $k$-affinoid…

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

Some of the most important results in prediction theory and time series analysis when finitely many values are removed from or added to its infinite past have been obtained using difficult and diverse techniques ranging from duality in…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

A foliation $(M,\mathcal{F})$ is said to be $2$--calibrated if it admits a closed 2-form $\omega$ making each leaf symplectic. By using approximately holomorphic techniques, a sequence $W_k$ of $2$--calibrated submanifolds of…