English

Quadratic rotation symmetric Boolean functions

Combinatorics 2023-04-26 v1 Information Theory math.IT Number Theory

Abstract

Let (0,a1,,ad1)n(0, a_1, \ldots, a_{d-1})_n denote the function fn(x0,x1,,xn1)f_n(x_0, x_1, \ldots, x_{n-1}) of degree dd in nn variables generated by the monomial x0xa1xad1x_0x_{a_1} \cdots x_{a_{d-1}} and having the property that fnf_n is invariant under cyclic permutations of the variables. Such a function fnf_n is called monomial rotation symmetric (MRS). Much of this paper extends the work on quadratic MRS functions in a 20202020 paper of the authors to the case of binomial RS functions, that is sums of two quadratic MRS functions. There are also some results for the sum of any number of quadratic MRS functions.

Keywords

Cite

@article{arxiv.2304.12734,
  title  = {Quadratic rotation symmetric Boolean functions},
  author = {Alexandru Chirvasitu and Thomas W. Cusick},
  journal= {arXiv preprint arXiv:2304.12734},
  year   = {2023}
}

Comments

20 pages + references

R2 v1 2026-06-28T10:17:02.614Z