Search arXivSearch

arXiv · 2608.12910

Enumeration of measurable functions between finite measurable spaces

Abstract

Let \(X\) and \(Y\) be finite sets with \(|X|=n\), \(|Y|=m\), equipped with sigma algebras \(\mathcal A\) and \(\mathcal B\). For arbitrary sigma algebras \(\mathcal A\) on \(X\) and \(\mathcal B\) on \(Y\), we enumerate measurable functions \(f\colon X\to Y\). When \(\mathcal B\) is discrete, the number of pairs \((\mathcal A,f)\) is the Touchard polynomial \(T_n(m)=\sum_k S(n,k)m^k\). For general \(\mathcal B\) with atom sizes \(b_1,\dots,b_r\), the number of pairs \((\mathcal A,f)\) over all sigma algebras \(\mathcal A\) on \(X\) is the complete Bell polynomial \(N_{\mathcal B}(n)\) in the power sums \(p_a=\sum_j b_j^a\), with exponential generating function \(\exp(\sum_j(e^{b_jx}-1))\). This specialises to the Touchard polynomial in the discrete case and is maximised by the trivial codomain sigma algebra. We further show that \(N_{\mathcal B}(n)=\mathbb E[Z^n]\) for a compound Poisson random variable \(Z\), and we discuss basic asymptotic growth of \(N_{\mathcal B}(n)\).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D. Kinoti Gikunda, J. Kiprop Tanui, Benard Kivunge. 2026-08-13. Enumeration of measurable functions between finite measurable spaces. https://arxiv.org/abs/2608.12910

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO