Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1501.01914

Some New Results on Binary Relations

Roy S. Freedman
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted. Relations generalize functions: do similar results exist for relations? This paper proves several new results concerning binary relations. For finite sets, we derive formulas for the number of right total, right unique, left total, and left unique relations. We also provide formulas that count the number of relations that are both right unique and left unique; right unique and right total; and left unique and left total. We conclude by discussing the probability that a relation selected at random is right unique or right total.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roy S. Freedman. 2015-01-08. Some New Results on Binary Relations. https://arxiv.org/abs/1501.01914

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

KEEP EXPLORING

Related papers

arXiv2026

Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric

We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $Δ$; our results hold without any further structural assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum (1995) proved an optimal $O(n\log{n})$ mixing-time bound for Glauber dynamics whenever $k>2Δ$ where $Δ$ is the maximum degree of the input graph. This bound was improved by Vigoda (1999) to $k>(11/6)Δ$ using a "flip" dynamics which recolors (small) maximal two-colored components in each step. Vigoda's result was the best known for general graphs for 20 years until Chen et al. (2019) established optimal mixing of the flip dynamics for $k>(11/6-\varepsilon)Δ$ where $\varepsilon\approx 10^{-5}$. We present the first substantial improvement over these results. We prove an optimal mixing-time bound of $O(n\log{n})$ for the flip dynamics when $Δ\geq125$ and $k\geq1.809Δ$. This yields, through recent spectral independence results, an optimal $O(n\log{n})$ mixing time for the Glauber dynamics for every fixed $Δ\geq125$ in the same range of $k/Δ$. Our proof utilizes path coupling with a simple weighted Hamming distance for "unblocked" neighbors.

cs.DM↗
arXiv2026

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM↗