Related papers: On the Lambek-Moser Theorem
In this paper we show an index theorem for gerbes
We prove some constructive results that on first and maybe even on second glance seem impossible.
There have been controversies among statisticians on (i) what to model and (ii) how to make inferences from models with unobservables. One such controversy concerns the difference between estimation methods for the marginal means not…
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
An technically interesting proof of a known theorem.
We give a proof of the Marker-Steinhorn Theorem which fills a gap in previous proofs of the result.
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
We give a constructive proof of Carpenter's Theorem due to Kadison. Unlike the original proof our approach also yields the real case of this theorem.
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…
In this article using elementary school level Geometry we observe an alternative proof of Pythagorean Theorem from Heron's Formula.
The aim of this paper is to give a precise proof of the completeness of Lamb modes and associated modes. This proof is relatively simple and short but relies on two powerful mathematical theorems. The first one is a theorem on elliptic…
We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.
These informal notes, not intended for publication, provide an approach to the Borsuk--Ulam theorem via Stokes' theorem, in a similar spirit to Lima's proof of the Brouwer fixed point theorem. They are intended to be accessible to anyone…
We give a proof of a Martingale Representation Theorem using the methods of nonstandard analysis.
We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…
We formulate learning guided Automated Theorem Proving as Partial Label Learning, building the first bridge across these fields of research and providing a theoretical framework for dealing with alternative proofs during learning. We use…
Discussion of "Likelihood Inference for Models with Unobservables: Another View" by Youngjo Lee and John A. Nelder [arXiv:1010.0303]
Discussion of "Likelihood Inference for Models with Unobservables: Another View" by Youngjo Lee and John A. Nelder [arXiv:1010.0303]