Related papers: A short proof of Combinatorial Nullstellensatz

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

In this note, we give a simple proof of the pointwise BMO estimate for Poisson's equation. Then the Calder\'{o}n-Zygmund estimate follows by the interpolation and duality.

We give a general method for producing various effective Null and Positivstellens\"atze, and getting new Positivstellens\"atze in algebraically closed valued fields and ordered groups. These various effective Nullstellens\"atze produce…

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

We present bounds for the sparseness and for the degrees of the polynomials in the Nullstellensatz. Our bounds depend mainly on the unmixed volume of the input polynomial system. The degree bounds can substantially improve the known ones…

In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

We will give a simple proof of the ambiguous class number formula.

We provide a proof and a counterexample to two conjectures made by N. Kuznetsov.

By using the properties of the uniformly distributed sequences of real numbers on $(0,1)$, a short proof of a certain version of Kolmogorov strong law of large numbers is presented which essentially differs from Kolmogorov's original proof.

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…

The purpose of the paper is to present an short proof of the Chuang's inequality.

An technically interesting proof of a known theorem.

We study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…

We present a simple proof of monotonicity for cooperative systems of linear ordinary differential equations, without having recourse to approximation by strongly cooperative systems.

We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

We consider the discrete analogue of a fractional integral operator on the Heisenberg group, for which we are able to prove nearly sharp results by means of a simple argument of a combinatorial nature.

We survey the classical results of the Dirichlet Approximation Theorem.

The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs…