Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Chu, Hung V."'
It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto intervals or in other words, consecutive terms of $\mathbb{N}$. In this pape
Externí odkaz:
http://arxiv.org/abs/2310.16947
Autor:
Chu, Hung V., King, Dylan, Luntzlara, Noah, Martinez, Thomas C., Miller, Steven J., Shao, Lily, Sun, Chenyang, Xu, Victor
Given a finite set of integers $A$, its sumset is $A+A:= \{a_i+a_j \mid a_i,a_j\in A\}$. We examine $|A+A|$ as a random variable, where $A\subset I_n = [0,n-1]$, the set of integers from 0 to $n-1$, so that each element of $I_n$ is in $A$ with a fixe
Externí odkaz:
http://arxiv.org/abs/2005.07981
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such partitions
Externí odkaz:
http://arxiv.org/abs/2004.08316