相关论文: Poisson reduction
This brief note, written for non-specialists, aims at drawing an introductive overview of the multiverse issue.
The ideas here are a continuation of a previous article. Some of the applications of the main ideas in the previous article are explained, along with some limitations of the general ideas. There are situations where additional hypotheses…
In recent years, the asymptotic normality of some famous combinatorial sequences has been the subject of extensive study. However, the methods used to prove the asymptotic normality of various combinatorial sequences differ significantly.…
The paper is mostly a survey on recent results in Diophantine approximation, with emphasis on properties of exponents measuring various notions of Diophantine <approximation.
The paper is devoted to the introduction of natural deduction systems for some weak subintuitionistic logics, along with proofs of normalization theorems for these systems.
They run our lives, if you believe the hype in the news, but there is no precise definition of "algorithms" which is generally accepted by the mathematicians, logicians and computer scientists who create and study them. My main aims here…
Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar…
This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…
We present a new, analytic, Poisson likelihood derived, technique to account for the statistical uncertainties inherent in simulation samples of limited size. This method has better coverage properties than other techniques, is valid for…
This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). The signal-independent…
A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.
We develop a general procedure for reduction along strong Dirac maps, which are a broad generalization of Poisson momentum maps. We recover a large number of familiar constructions in Poisson and quasi-Poisson geometry, and we introduce new…
This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…
This paper establishes expectation and variance asymptotics for statistics of the Poisson--Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include…
Bayesian, classical, and extended maximum likelihood approaches to estimation of upper limits in experiments with small numbers of signal events are surveyed. The discussion covers only experiments whose outcomes are well described by a…
This paper is meant as a contribution to the often debated subject of how to combine data which appear to be in mutual disagreement. As a practical example, the epsilon-prime/epsilon determinations have been considered.
In the present paper we demonstrate the results of a statistical analysis of some characteristics of precipitation events and propose a kind of a theoretical explanation of the proposed models in terms of mixed Poisson and mixed exponential…
Experimental and observational studies often lead to spurious association between the outcome and independent variables describing the intervention, because of confounding to third-party factors. Even in randomized clinical trials,…
This is an appendix to our paper "An update of the Hirsch Conjecture" (arXiv:0907.1186), containing proofs of some of the results and comments that were omitted in it.
Given a function based on the computation of an NP machine, can one in general eliminate some solutions? That is, can one in general decrease the ambiguity? This simple question remains, even after extensive study by many researchers over…