On Boolean Functions Defined on Bracket Sequences

DOI10.47443/DML.2022.209MaRDI QIDQ5889978zbMATH OpenOpenAlexFDO

Authors Norbert Hegyvári

Publication date 28 April 2023

Published in Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/dml.2022.209

zbMATH Keywords

additive combinatoricsbasic Fourier analysisBoolean cubebracket sequences

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75)

Recommendations

• Boolean functions derived from pseudorandom binary sequences
• On the Boolean functions without upper bijunctive analogues
• Publication:3029060
• On a combinatorial conjecture of Tu and Deng
• On the independence of Boolean functions

Cites work

• A quantitative form of the Erdős-Birch theorem
• Analysis of Boolean Functions
• Hegyvári's theorem on complete sequences. II
• scientific article; zbMATH DE number 914352 (Why is no real title available?)
• Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
• On subset sums of pseudo-recursive sequences
• Some remarks on a problem of Erdős and Graham

Cited in

(1)

• scientific article; zbMATH DE number 3394051 (Why is no real title available?)

This page was built for publication: On Boolean Functions Defined on Bracket Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889978)