Related papers: About the Kronecker Theorem

General acceptance of a mathematical proposition $P$ as a theorem requires convincing evidence that a proof of $P$ exists. But what constitutes "convincing evidence?" I will argue that, given the types of evidence that are currently…

It is argued that Goedel's incompleteness theorem should be seen as self-evident, rather than unexpected or surprising.

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also…

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

The aim of this article is to give a new proof of Cohen-Gabber theorem in the equal characteristic $p>0$ case.

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.

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

We give counterexamples to Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients.

We give in the present work a new methodology that allows to give isoperimetric proofs, for Kneser's Theorem and Kemperman's structure Theory and most sophisticated results of this type. As an illustration we present a new proof of Kneser's…

In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.

We give some Korovkin-type theorems on convergence and estimates of rates of approximations of nets of functions, satisfying suitable axioms, whose particular cases are filter/ideal convergence, almost convergence and triangular…

G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…

Two generalizations of Hagge's theorems are described. In the first we consider what happens when one moves from the orthocentre to a general point. What one loses by doing so is the indirect similarity and hence one loses the centre of…

Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…

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.

We give a minimal counterexample for a conjecture of Ross and Yong (2015) which proposes a K-Kohnert rule for Grothendieck polynomials. We conjecture a revised version of this rule. We then prove both rules hold in the $321$-avoiding case.

The aim of this chapter is to present an introduction and also an overview of some of the most relevant results concerning positivity energy theorems in General Relativity. These theorems provide the answer to a long standing problem that…

This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.

The FKG theorem says that the POSITIVE LATTICE CONDITION, an easily checkable hypothesis which holds for many natural families of events, implies POSITIVE ASSOCIATION, a very useful property. Thus there is a natural and useful theory of…