Related papers: Partially complete sufficient statistics are joint…
We find the Ramsey number of a cycle vs. a complete graph when the order of the cycle is at least 4 times as large as the order of the complete graph. This partially confirms a conjecture of Erd\H{o}s, Faudree, Rousseau, and Schelp made in…
We present a proof of Chow's theorem using two results of Errett Bishop retated to volumes and limits of analytic varieties. We think this approach suggested a long time ago in the beautiful book by Gabriel Stolzenberg, is very attractive…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
A family of probability distributions (i.e. a statistical model) is said to be sufficient for another, if there exists a transition matrix transforming the probability distributions in the former to the probability distributions in the…
We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…
We study the problem of testing composite hypotheses versus composite alternatives, using a convex duality approach. In contrast to classical results obtained by Krafft and Witting (Z. Wahrsch. Verw. Gebiete 7 (1967) 289--302), where…
We give a definition for the notion of statistics in the lattice-theoretical (or propositional) formulation of quantum mechanics of Birchoff, von Neumann and Piron. We show that this formalism is compatible only with two types of…
We illustrate the potential applications in machine learning of the Christoffel function, or more precisely, its empirical counterpart associated with a counting measure uniformly supported on a finite set of points. Firstly, we provide a…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced…
Stanley (1986) showed how a finite partially ordered set gives rise to two polytopes, called the order polytope and chain polytope, which have the same Ehrhart polynomial despite being quite different combinatorially. We generalize his…
Nearly three decades from his celebrated result, we study a modern refinement and strengthening of Kopperman's full metrisabilty of all topological spaces. Within this new theory of \emph{V-spaces}, developed by Flagg and Weiss, we…
For many years, at least since McCarthy and Hayes (1969), writers have lamented, and attempted to compensate for, the alleged fact that we often do not have adequate statistical knowledge for governing the uncertainty of belief, for making…
We prove Asymptotic Completeness of one dimensional NLS with long range nonlinearities. We also prove existence and expansion of asymptotic solutions with large data at infinity.
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
We address the following state comparison problem: is it possible to design an experiment enabling us to unambiguously decide (based on the observed outcome statistics) on the sameness or difference of two unknown state preparations without…
In this note we introduce the concept of a quasi-finite complex. Next, we show that for a given countable and locally finite CW complex L the following conditions are equivalent: (i) L is quasi-finite. (ii) There exists a [L]-invertible…
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete. This is a fundamental problem in general, and of particular interest for Bayesian networks. Recently,…
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…