Linear read-once and related Boolean functions
Vadim Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai, Yu. Zolotykh

TL;DR
This paper characterizes linear read-once Boolean functions as those with exactly n+1 extremal points, explores their relation to read-once and Chow functions, and disproves a conjecture about their minimal specification number.
Contribution
It provides a characterization of linear read-once functions via extremal points and minimal forbidden subfunctions, and challenges a previous conjecture on their specification number.
Findings
Linear read-once functions have exactly n+1 extremal points.
The class of linear read-once functions is the intersection of read-once and Chow functions.
A threshold non-linear read-once function with minimal specification number n+1 is constructed.
Abstract
It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The class of linear read-once functions is known to be the intersection of the classes of read-once and threshold functions. Generalizing this result we show that the class of linear read-once functions is the intersection of read-once and Chow functions. We also find the set of minimal read-once functions which are not linear read-once and the set of minimal threshold functions which are not linear read-once. In other words, we characterize the class of linear read-once functions by means of minimal forbidden subfunctions within the universe of read-once and the universe of threshold functions. Within the universe of threshold functions the importance of…
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
TopicsCoding theory and cryptography · Commutative Algebra and Its Applications · Polynomial and algebraic computation
