Related papers: Approximations to the Kruskal-Katona theorem

We find some extensions of the Kraft-Russell Generic Equivalence Theorem and using it we obtain a simple proof of a result of Dubouloz and Kishimoto.

In this note, we present a simple directed graph proof of Sharkovsky's theorem.

We study \L o\'s's theorem in a choiceless context. We introduce some variants of \L o\'s's theorem. These variants seem weaker than \L o\'s's theorem, but we prove that these are equivalent to \L o\'s's theorem.

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We show the pointwise version of the Ste\v{c}kin theorem on approximation by de la Vall\'ee-Poussin means. The result on norm approximation is also derived.

We show that a simple and straightforward rational approximation to the Thomas-Fermi equation provides the slope at origin with unprecedented accuracy and that relatively small Pad\'e approximants are far more accurate than more elaborate…

We show that the existence of a weakly compact cardinal over the Zermelo-Fraenkel's set theory is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

A complete p-adic Khintchine type theorem for approximation by p-adic algebraic numbers is established.

Given a family $S$ of $k$--subsets of $[n]$, its lower shadow $\Delta(S)$ is the family of $(k-1)$--subsets which are contained in at least one set in $S$. The celebrated Kruskal--Katona theorem gives the minimum cardinality of $\Delta(S)$…

We obtain some results related to Romanoff's theorem.

We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

We proove a Bloch's theorem in an almost complex projective plane.

We prove Schlichting's theorem for approximate subgroups: if $\mathcal{X}$ is a uniform family of commensurable approximate subgroups in some ambient group, then there exists an invariant approximate subgroup commensurable with…

Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

We prove some constructive results that on first and maybe even on second glance seem impossible.

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

In this short paper we review and extract some features of the Fredholm Alternative problem .

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…