OurBigBook
About
$
Donate
Sign in
Sign up
Growth bound for signs of m-term linear combinations
ID: growth-bound-for-signs-of-m-term-linear-combinations
Top articles
Latest articles
New article in topic
Show body
Body
0
Growth bound for signs of m-term linear combinations
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
For
f
=
∑
j
=
1
m
α
j
g
j
with
g
j
drawn from
a
binary class
G
, fixing
(
g
1
,
…
,
g
m
)
leaves an
m
-dimensional linear
sign
class. Consequently
s
(
sgn
F
,
n
)
≤
(
n
+
1
)
m
∣
G
∣
m
(1)
when
G
is finite, and in general
s
(
sgn
F
,
n
)
≤
(
n
+
1
)
m
s
(
G
,
n
)
m
.
(2)
Total
articles
:
1
New to
topics
?
Read the docs here!