Related papers: On Cartwright's theorem
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
In this paper we study random iterated function systems. Our main result gives sufficient conditions for an analogue of a well known theorem due to Khintchine from Diophantine approximation to hold almost surely for stochastically…
We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…
We present an axiomatization of Conway theories which yields,as a corollary, a very concise axiomatization of iteration theories satisfying the functorial implication for base morphisms.
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…
We introduce and study $\alpha$-embedded sets and apply them to generalize the Kuratowski Extension Theorem.
We derive the spin-statistics theorem in both relativistic and non-relativistic first-quantized form, extending considerably the earlier proofs. Our derivation is based on the representation theories of the groups SU (2) and SL(2,C), latter…
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…
We introduce the notion of characteristic function of a quaternionic matrix, whose roots are the left eigenvalues. We prove that for all $2\times 2$ matrices and for $3\times 3$ matrices having some zero entry outside the diagonal there is…
We review how some multianalytic inner functions of the Beurling type theorem are associated to row contractions following works of G.Popescu. Motivated by a result on weak Markov dilations, we define a notion of characteristic function for…
We survey some of the stratification theorems concerning exponential sums over finite fields, especially those due to Katz-Laumon and Fouvry-Katz, as well as some of their applications. Moreover, motivated partly by recent work of Bonolis,…
An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…
We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
Approximation theory has long been concerned with the development of positive linear operators that effectively approximate classes of functions. Among the most well-known results in this area are Korovkin-type approximation theorems, which…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
A class theorem is presented and proved: the complex Fourier transforms of a certain class of exponential functions have all their zeros on the real line. A class of basis functions is first considered, and the class is then extended via…
We give a characterization of stratified totally real sets that admit Carleman approximation by entire functions. As an application we show that the product of two stratified totally real Carleman continua is a Carleman continuum.
We introduce the concept of cloning for classes of observables and classify cloning machines for qubit systems according to the number of parameters needed to describe the class under investigation. A no-cloning theorem for observables is…