相关论文: Testing a Crucial Assumption
It is proven an analogue of The Theorem of Moser according to an iterative normalization procedure depending on Generalized Fischer Decompositions.
We ask questions generalizing uniform versions of conjectures of Mordell and Lang and combining them with the Morton--Silverman conjecture on preperiodic points. We prove a few results relating different versions of such questions.
Several results about the union-closed sets conjecture are presented.
We establish an equivalent condition to the validity of the Collatz conjecture, using elementary methods. We derive some conclusions and show several examples of our results. We also offer a variety of exercises, problems and conjectures.
An overview is presented of the experimental talks given at the XXXVIIth Rencontres de Moriond QCD session.
Outlier hypothesis testing is studied in a universal setting. Multiple sequences of observations are collected, a small subset of which are outliers. A sequence is considered an outlier if the observations in that sequence are distributed…
We describe a proof of the Central Limit Theorem that has been formally verified in the Isabelle proof assistant. Our formalization builds upon and extends Isabelle's libraries for analysis and measure-theoretic probability. The proof of…
We study a two-species bidirectional exclusion process, and a single species variant, which is motivated by the motion of organelles and vesicles along microtubules. Specifically, we are interested in the clustering of the particles and…
Many tasks aim to measure machine reading comprehension (MRC), often focusing on question types presumed to be difficult. Rarely, however, do task designers start by considering what systems should in fact comprehend. In this paper we make…
Likelihood ratio tests are intuitively appealing. Nevertheless, a number of examples are known in which they perform very poorly. The present paper discusses a large class of situations in which this is the case, and analyzes just how…
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
This technical report investigates Kripke-style modal type theories, both simply typed and dependently typed. We examine basic meta-theories of the type theories, develop their substitution calculi, and give normalization by evaluation…
Let a real-analytic manifold $M$ formally (holomorphically) equivalent to the following model…
We theoretically introduce and experimentally demonstrate the realization of a nonclassicality test that allows for arbitrarily low detection efficiency without invoking any extra assumptions as independence of the devices. Our test and its…
Ratios of universal enumerable semimeasures corresponding to hypotheses are investigated as a solution for statistical composite hypotheses testing if an unbounded amount of computation time can be assumed. Influence testing for discrete…
Given a probability measure on the unit disk, we study the problem of deciding whether, for some threshold probability, this measure is supported near a real algebraic variety of given dimension and bounded degree. We call this "testing the…
In this survey paper we discuss some tools and methods which are of use in quasi-Monte Carlo (QMC) theory. We group them in chapters on Numerical Analysis, Harmonic Analysis, Algebra and Number Theory, and Probability Theory. We do not…
We propose a new powerful family of tests of univariate normality. These tests are based on an initial value problem in the space of characteristic functions originating from the fixed point property of the normal distribution in the zero…
I raise some doubts concerning a protocol recently applied in an experiment (Walborn et al, Nature) to measure entanglement. The protocol is much simpler than other known entanglement-verification methods, but, I argue, needs assumptions…
Approximations to the Kruskal-Katona theorem are stated and proven. These approximations are weaker than the theorem, but much easier to work with numerically.