Skip to main content
added 281 characters in body
Source Link
T. Amdeberhan
  • 43.2k
  • 5
  • 57
  • 217

Let $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols indexed by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question 1. If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question 2. Fix $k\geq1$. What is the range of values for $\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k})$ if $(a_1,\dots,a_k)\in\mathbb{Z}^k$ runs through all possible $k$-tuples?

For example, when $k=1$ the answer is $\{0,1\}$; when $k=2$ the answer is $\{0,1,2,4\}$.

Let $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols indexed by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

Let $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols indexed by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$

Question 1. If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question 2. Fix $k\geq1$. What is the range of values for $\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k})$ if $(a_1,\dots,a_k)\in\mathbb{Z}^k$ runs through all possible $k$-tuples?

For example, when $k=1$ the answer is $\{0,1\}$; when $k=2$ the answer is $\{0,1,2,4\}$.

deleted 2 characters in body
Source Link
T. Amdeberhan
  • 43.2k
  • 5
  • 57
  • 217

SupposeLet $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols indexindexed by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

Suppose $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols index by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

Let $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols indexed by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$

Source Link
T. Amdeberhan
  • 43.2k
  • 5
  • 57
  • 217

valuation from $\mathbb{Z}^n$ into $\mathbb{Z}$. Easy way?

Suppose $\mathcal{F}:=\{f_a\}_{a\in\mathbb{Z}}$ be a set of symbols index by the integers and satisfying the rules: $$f_a=f_{-a} \qquad \text{and} \qquad f_af_b=f_{a+b}+f_{a-b}.$$ Define a linear operator $\mathcal{L}$ on $\mathcal{F}$ according to $$\mathcal{L}f_a=\begin{cases} 1 \qquad \text{if $a=0$} \\ 0 \qquad \text{otherwise}. \end{cases}$$ For example, $\mathcal{L}f_af_b=\mathcal{L}f_{a+b}+\mathcal{L}f_{a-b}$.

Question If $a_i\in\mathbb{Z}$, then is there a nice formula or an efficient algorithm to compute $$\mathcal{L}(f_{a_1}f_{a_2}\cdots f_{a_k}) \,\,?$$