Related papers: On the limits of comparing subset sizes within $\m…
We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…
Consider a fair lottery over the natural numbers in which the selected number is removed. This lottery is iterated countably infinite times, with a known ratio of iterations to natural numbers. Removed numbers are not replaced. The natural…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
With the advent of galaxy surveys which provide large samples of galaxies or galaxy clusters over a volume comparable to the horizon size (SDSS-III, HETDEX, Euclid, JDEM, LSST, Pan-STARRS, CIP etc.) or mass-selected large cluster samples…
Several different versions of the theory of numerosities have been introduced in the literature. Here, we unify these approaches in a consistent frame through the notion of set of labels, relating numerosities with the Kiesler field of…
Inspired by recent questions of Nathanson, we show that for any infinite abelian group $G$ and any integers $m_1, \ldots, m_H$, there exist finite subsets $A,B \subseteq G$ such that $|hA|-|hB|=m_h$ for each $1 \leq h \leq H$. We also…
This paper proposes a new method for similarity analysis and, consequently, a new algorithm for clustering different types of random attributes, both numerical and nominal. However, in order for nominal attributes to be clustered, their…
An alternative mathematics based on qualitative plurality of finiteness is developed to make non-standard mathematics independent of infinite set theory. The vague concept "accessibility" is used coherently within finite set theory whose…
We define several notions of a limit point on sequences with domain a barrier in $[\omega]^{<\omega}$ focusing on the two dimensional case $[\omega]^2$. By exploring some natural candidates, we show that countable compactness has a number…
In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…
An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…
We characterize the class of RFD $C^*$-algebras as those containing a dense subset of elements that attain their norm under a finite-dimensional representation. We show further that this subset is the whole space precisely when every…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…
A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural…
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…
We obtain some sufficient conditions for the Central Limit Theorem for the random processes (fields) with values in the separable part of Holder space in the modern terms of majorizing (minorizing) measures, belonging to X.Fernique and…