We study the S-integral points on the complement of a union of hyperplanes in projective space, where S is a finite set of places of a number field k. In the classical case where S consists of the set of archimedean places of k, we completely characterize, in terms of the hyperplanes and the field k, when the (S-)integral points are not Zariski-dense.

In this paper we describe how methods of concept (classi cation) learning can be used to solve constraint satisfaction problems in the spatial domain, for example if a set of numerical constraints de nes a complicated region in the physical or feature (parameter) space. In this case it is in general not easy or even not possible to nd explicit boundary descriptions by some kind of formula manip...

We propose a recursive algorithm for clustering trajectories lying in multiple moving hyperplanes. Starting from a given or random initial condition, we use normalized gradient descent to update the coefficients of a time varying polynomial whose degree is the number of hyperplanes and whose derivatives at a trajectory give an estimate of the vector normal to the hyperplane containing that traj...

In [11] all locally subquadrangular hyperplanes of finite symplectic and Hermitian dual polar spaces were determined with the aid of counting arguments and divisibility properties of integers. In the present note we extend this classification to the infinite case. We prove that symplectic dual polar spaces and certain Hermitian dual polar spaces cannot have locally subquadrangular hyperplanes i...

A celebrated technique for finding near neighbors for the angular distance involves using a set of random hyperplanes to partition the space into hash regions [Charikar, STOC 2002]. Experiments later showed that using a set of orthogonal hyperplanes, thereby partitioning the space into the Voronoi regions induced by a hypercube, leads to even better results [Terasawa and Tanaka, WADS 2007]. How...

In this paper we investigate the combinatorial complexity of an algorithm to determine the geometry and the topology related to an arrangement of hyperplanes in multi-dimensional Euclidean space from the “probing” on the arrangement. The “probing” by a flat means the operation from which we can obtain the intersection of the flat and the arrangement. For a finite set H of hyperplanes in Ed, we ...

In the paper [8], we introduced the notions of pseudo-hyperplane and pseudoembedding of a point-line geometry and proved that every generalized quadrangle of order (s, t), 2 ≤ s <∞, has faithful pseudo-embeddings. The present paper focuses on generalized quadrangles of order (3, t). Using the computer algebra system GAP [12] and invoking some theoretical relationships between pseudo-hyperplanes...

After a review on asymptotic flatness, a general discussion of asymptotic weak and strong Poincaré charges in metric gravity is given with special emphasis on the boundary conditions needed to define the proper Hamiltonian gauge transformations and to get a differentiable Dirac Hamiltonian. Lapse and shift functions are parametrized in a way which allows to identify their asymptotic parts with ...

For analysing k-variate data sets, Randles (1989) considered hyperplanes going through k− 1 data points and the origin. He then introduced an empirical angular distance between two k-variate data vectors based on the number of hyperplanes (the so-called interdirections) that separate these two points, and proposed a multivariate sign test based on those interdirections. In this paper, we presen...

Let ∆ be a symplectic dual polar space DW (2n−1, K) or a Hermitian dual polar space DH(2n − 1, K, θ), n ≥ 2. We define a class of hyperplanes of ∆ arising from its Grassmann-embedding and discuss several properties of these hyperplanes. The construction of these hyperplanes allows us to prove that there exists an ovoid of the Hermitian dual polar space DH(2n−1, K, θ) arising from its Grassmann-...