Linear transformations of monotone functions on the discrete cube

Nathan Keller, Haran Pilpel

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

For a function f : {0, 1}n → R and an invertible linear transformation L ∈ G Ln (2), we consider the function L f : {0, 1}n → R defined by L f (x) = f (L x). We raise two conjectures: First, we conjecture that if f is Boolean and monotone then I (L f) ≥ I (f), where I (f) is the total influence of f. Second, we conjecture that if both f and L (f) are monotone, then f = L (f) (up to a permutation of the coordinates). We prove the second conjecture in the case where L is upper triangular.

Original languageEnglish
Pages (from-to)4210-4214
Number of pages5
JournalDiscrete Mathematics
Volume309
Issue number12
DOIs
StatePublished - 28 Jun 2009
Externally publishedYes

Bibliographical note

Funding Information:
First author is supported by the Adams Fellowship Program of the Israeli Academy of Sciences and Humanities. Second author is supported by the Giora Yoel Yashinsky Memorial Scholarship.

Funding

First author is supported by the Adams Fellowship Program of the Israeli Academy of Sciences and Humanities. Second author is supported by the Giora Yoel Yashinsky Memorial Scholarship.

FundersFunder number
Giora Yoel Yashinsky Memorial Scholarship
Israeli Academy of Sciences and Humanities

    Keywords

    • Boolean functions
    • Discrete Fourier analysis
    • Fourier-Walsh expansion
    • Influences

    Fingerprint

    Dive into the research topics of 'Linear transformations of monotone functions on the discrete cube'. Together they form a unique fingerprint.

    Cite this