Littlewood–Offord problem
id:
littlewood-offord-problem-288-11609902
title:
Littlewood–Offord problem
text:
In mathematical field of combinatorial geometry, the Littlewood–Offord problem is the problem of determining the number of subsums of a set of vectors that fall in a given convex set. More formally, if V is a vector space of dimension d, the problem is to determine, given a finite subset of vectors S and a convex subset A, the number of subsets of S whose summation is in A. The first upper bound for this problem was proven in 1938 by John Edensor Littlewood and A. Cyril Offord. This Littlewood–O
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Littlewood%E2%80%93Offord_problem
date created:
date modified:
2023-11-08T12:09:43Z
main entity:
{"identifier":"Q6653181","url":"https://www.wikidata.org/entity/Q6653181"}
image:
fields total:
13
integrity:
13