The trace properties of the sample paths of su ciently regular generalized random elds are studied. In particular, nice localisation properties are shown in the case of hyperplanes. Using techniques of Euclidean quantum eld theory a constructive description of the conditional expectation values with respect to some Gibbs measures describing Euclidean quantum eld theory models and the -algebras ...

In this paper, we formulate and investigate the following problem: given integers d, k and r where k > r ≥ 1, d ≥ 2, and a prime power q, arrange d hyperplanes on Fq to maximize the number of r-dimensional subspaces of Fq each of which belongs to at least one of the hyperplanes. The problem is motivated by the need to give tighter bounds for an error-tolerant pooling design based on finite vect...

The Shi arrangement Sn is the arrangement of affine hyperplanes in R n of the form xi−xj = 0 or 1, for 1 ≤ i < j ≤ n. It dissects R n into (n+1) regions, as was first proved by Shi. We give a simple bijective proof of this result. Our bijection generalizes easily to any subarrangement of Sn containing the hyperplanes xi − xj = 0 and to the extended Shi arrangements.

Let ∆ be a dual polar space of rank n ≥ 4, H be a hyperplane of ∆ and Γ := ∆\H be the complement of H in ∆. We shall prove that, if all lines of ∆ have more than 3 points, then Γ is simply connected. Then we show how this theorem can be exploited to prove that certain families of hyperplanes of dual polar spaces, or all hyperplanes of certain dual polar spaces, arise from embeddings.

Basic properties of finite subsets of the integer lattice Z are investigated from the point of view of geometric tomography. Results obtained concern the Minkowski addition of convex lattice sets and polyominoes, discrete X-rays and the discrete and continuous covariogram, the determination of symmetric convex lattice sets from the cardinality of their projections on hyperplanes, and a discrete...

It is NP complete to recognize whether two sets of points in general space can be separated by two hyperplanes It is NP complete to recognize whether two sets of points in the plane can be separated with k lines For every xed k in any xed dimension it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes

From the above definition, we have the following geometrical interpretation of the dual lattice. For any vector x, the set of all points whose inner product with x is integer forms a set of hyperplanes perpendicular to x and separated by distance 1/‖x‖. Hence, any vector x in a lattice Λ imposes the constraint that all points in Λ∗ lie in one of the hyperplanes defined by x. See the next figure...