Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.17153

The Enumeration of Binary Relations

Mamadou Sadialiou Bah
View original source ↗Read source document ↗Export metadata ↓

Abstract

Binary relations between finite sets N and X, families of subsets, and lattice homomorphisms from P(N) to P(X) are three faces of the same object. This self-contained monograph, merging and substantially expanding the author's ICTP preprint IC/97/180 (1997) and a 2026 companion note, enumerates every combinatorial type (arbitrary, injective, surjective, on either side), both raw and up to the actions of the symmetric groups S_N, S_X, and S_N x S_X, via the Cauchy-Frobenius-Burnside lemma. The generating functions of all counts are then determined, revealing e^{z+w+zw}, Bell numbers, Euler's partition product, and the quasi-polynomiality of the hardest, two-sided column of the table. All prerequisite tools -- elementary counting, group actions, Stirling and Bell numbers, formal power series, and Mobius inversion on the Boolean lattice -- are developed from first principles, making the book accessible after a first course in algebra and combinatorics. A documented correction to Theorem B of the 1997 preprint is included; all formulas have been verified by symbolic computation and brute-force enumeration.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Mamadou Sadialiou Bah. 2026-07-19. The Enumeration of Binary Relations. https://arxiv.org/abs/2607.17153

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗