Binary functions, degeneracy, and alternating dimaps
G. E. Farr

TL;DR
This paper explores the properties of binary functions, characterising degeneracy and their relation to alternating dimaps, revealing limitations on their binary representations and opening questions for more complex forms.
Contribution
It characterises degenerate elements in binary functions and investigates their connection to Tutte's alternating dimaps, identifying constraints on binary representations.
Findings
Degenerate elements in binary functions are characterised.
Only the simplest alternating dimaps have binary representations of the studied form.
Open question on existence of more sophisticated binary representations for alternating dimaps.
Abstract
This paper continues the study of combinatorial properties of binary functions --- that is, functions such that , where is a finite set. Binary functions have previously been shown to admit families of transforms that generalise duality, including a trinity transform, and families of associated minor operations that generalise deletion and contraction, with both these families parameterised by the complex numbers. Binary function representations exist for graphs (via the indicator functions of their cutset spaces) and indeed arbitrary matroids (as shown by the author previously). In this paper, we characterise degenerate elements --- analogues of loops and coloops --- in binary functions, with respect to any pair of minor operations from our complex-parameterised family. We then apply this to study the relationship between binary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Cellular Automata and Applications
