Related papers: Approximations to the Kruskal-Katona theorem

Inspired by the Kruskal-Katona theorem a minimization problem is studied, where the role of the shadow is replaced by the image of the action of the monoid of increasing functions. One of our main results shows that compressed sets are a…

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.

We present a relative form of the Toponogov comparison theorem.

The Kruskal Katona theorem was proved in the 1960s. In the theorem, we are given an integer $r$ and families of sets $\mathcal{A}\subset \mathbb{N}^{(r)}$ and $\mathcal{B}\subset\mathbb{N}^{(r-1)}$ such that for every $A\in\mathcal{A}$,…

New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…

We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.

This is just a short proof of Kruskal's theorem regarding uniqueness of expressions for tensors, phrased in geometric language.

In this paper, we give a counter-example, in the general case, Kronecker theorem will derive contradiction. Kronecker theorem be correct after removing some conditions.

There are proven few analogues of the Theorem of Moser using The Approximation Theorem of Artin.

Proof systems for the Relativized Propositional Calculus are defined and compared.

A very simple but useful almost sure convergence theorem of probability is given.

In this note, we state various generalisations of the Nakano vanishing theorem under weak positivity assumptions, and compare them with the known results.

We survey the classical results of the Dirichlet Approximation Theorem.

An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

We give an alternate proof of three versions of the theorem on extrapolation of Carleson measures.

We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…

Analogues of Kolmogorov comparison theorems and some of their applications were established.

The issue and proof of Gurzadyan theorem are presented concisely, avoiding tedious and unnecessary calculations that would mask what is essential. The goal is to provide a good mathematical and physical understanding of the theorem, making…