arXiv subjects
Publications and source records attributed to Ido Feldman.
We study the continuous reducibility of isomorphism relations in the space of regresive functions in $\kappa^\kappa$. We show for inaccessible $\kappa$, that if $\mathcal{T}$ is a theory with less than $\kappa$ non-isomorphic models of size $\kappa$ and $\mathcal T'$ is unstable or superstable non-classifiable, then the isomorphism of models of $\mathcal{T}$ is continuous reducible to the isomorphism of models of $\mathcal{T}'$.
The Coupon Collector Problem (CCP) is a well-known combinatorial problem that seeks to estimate the number of random draws required to complete a collection of $n$ distinct coupon types. Various generalizations of this problem have been applied in numerous engineering domains. However, practical applications are often hindered by the computational challenges associated with deriving numerical results for moments and distributions. In this work, we present three algorithms for solving the most general form of the CCP, where coupons are collected under any arbitrary drawing probability, with the objective of obtaining $t$ copies of a subset of $k$ coupons from a total of $n$. The First algorithm provides the base model to compute the expectation, variance, and the second moment of the collection process. The second algorithm utilizes the construction of the base model and computes the same values in polynomial time with respect to $n$ under the uniform drawing distribution, and the third algorithm extends to any general drawing distribution. All algorithms leverage Markov models specifically designed to address computational challenges, ensuring exact computation of the expectation and variance of the collection process. Their implementation uses a dynamic programming approach that follows from the Markov models framework, and their time complexity is analyzed accordingly.
Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of the continuum hypothesis by Inamdar and Rinot. Here we prove that the stronger one may consistently fail. Specifically, starting with a supercompact cardinal and an inaccessible cardinal above it, we devise a notion of forcing consisting of finite working parts and finitely many two types of models as side conditions, to violate this analog of $\mho$ at the second uncountable cardinal.
Motivated by a problem in additive Ramsey theory, we extend Todorcevic's partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then for every Abelian group $G$ of size $\aleph_2$, there exists a coloring $c:G\rightarrow\mathbb Z$ such that for every uncountable $X\subseteq G$ and every integer $k$, there are three distinct elements $x,y,z$ of $X$ such that $c(x+y+z)=k$.