Re: A family of inequalities of degree 3

In news:<45e1e09f@xxxxxxxxxxxxx> schrieb Thomas Mautsch:
[ ... ]
I got the impression that S itself might be a polyhedron;
but I forgot
that *every* closed convex set can be represented
as the intersection of countably many hyperplanes...
^^^^^^^^^^^

Yet another proof that my postings are too long to be read. ;-(
I meant "closed half-spaces", not "hyperplanes". :-(
.

Relevant Pages

  • Re: Secret sharing algorithm with chosen keys
    ... That was the exact scheme I was going to propose, ... Take the N random keys and interpret them as ... N-dimensional hyperplanes; except for rare degenerate cases, ... first N-T coordinates of the intersection point, ...
    (sci.crypt)
  • Re: Simple queries on intersection of hypersurfaces
    ... Imagining that it may be a four-dimensional surface of a ... Would the zone of intersection be a 4-1 dimensional object by definition ... a 3-sphere is a sphere. ... for example, parallel hyperplanes do not intersect ...
    (sci.math)
  • Re: Simple queries on intersection of hypersurfaces
    ... Imagining that it may be a four-dimensional surface of a ... Would the zone of intersection be a 4-1 dimensional object by definition ... a 3-sphere is a sphere. ... for example, parallel hyperplanes do not intersect ...
    (sci.math)