Related papers: A bound for Dickson's lemma

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…

Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…

We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…

Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.

We study the pigeonhole principle for $\Sigma_2$-definable injections with domain twice as large as the codomain, and the weak K\"onig lemma for $\Delta^0_2$-definable trees in which every level has at least half of the possible nodes. We…

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

The two-colour Ramsey number $R(m,n)$ is the least natural number $p$ such that any graph of order $p$ must contain either a clique of size $m$ or an independent set of size $n$. We exhibit a method for computing upper bounds for $R(m,n)$…

Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…

In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

We propose to study the restriction conjecture using decoupling theorems and two-ends Furstenberg inequalities. Specifically, we pose a two-ends Furstenberg conjecture, which implies the restriction conjecture. As evidence, we prove this…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…

This paper concerns Hopf's boundary point lemma, in certain $C^{1,Dini}$-type domains, for a class of singular/degenerate PDE-s, including $p$-Laplacian. Using geometric properties of levels sets for harmonic functions in convex rings, we…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

We use an upper bound on Jacobsthal's function to complete a proof of a known density result. Apart from the bound on Jacobsthal's function used here, the proof we are completing uses only elementary methods and Dirichlet's theorem on the…