A Brody curve, a.k.a. normal curve, is a holomorphic map f from the complex line C to the complex projective space P such that the family of its translations {z 7→ f(z + a) : a ∈ C} is normal. We prove that Brody curves omitting n hyperplanes in general position have growth order at most one, normal type. This generalizes a result of Clunie and Hayman who proved it for n =

This paper explores the abstract domain of grids, a domain that is able to represent sets of equally spaced points and hyperplanes over an n-dimensional vector space. Such a domain is useful for the static analysis of the patterns of distribution of the values program variables can take. We present the domain, its representation and the basic operations on grids necessary to define the abstract...

In this survey we deal with the location of hyperplanes in n{ dimensional normed spaces, i.e., we present all known results and a unifying approach to the so-called median hyperplane problem in Minkowski spaces. We describe how to nd a hyperplane H minimizing the weighted sum f(H) of distances to a given, nite set of demand points. In robust statistics and operations research such an optimal hy...

Twin Support Vector Machines (TWSVMs) have emerged an efficient alternative to Support Vector Machines (SVM) for learning from imbalanced datasets. The TWSVM learns two non-parallel classifying hyperplanes by solving a couple of smaller sized problems. However, it is unsuitable for large datasets, as it involves matrix operations. In this paper, we discuss a Twin Neural Network (Twin NN) archit...

A hyperplane arrangement is a polyhedral cell complex where the relative position of each cell of the arrangement and the composing hyperplanes are summarized by a sign vector computable in polynomial time. This tool from computational geometry enables the development of a fast and efficient algorithm that translates the composition of hybrid systems into a piecewise affine model. The tool prov...

We consider logarithmic vector fields parametrized by finite collections of weighted hyperplanes. For a finite collection of weighted hyperplanes in a two-dimensional vector space, it is known that the set of such vector fields is a free module of rank two whose basis elements are homogeneous. We give an algorithm to construct a homogeneous basis for the module.

An arrangement of hyperplanes in E'' is a "plaid" provided its hyperplanes form no multiple flats of intersection and lie in parallel families that are in general position. We develop some geometrically natural formulas for the number of r-faces that are formed by such an arrangement.

Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate for the exact solution onto that space to get a new estimate. Many vairants of Kaczmarz algorithms are proposed on how to choose better hyperplanes. Using t...

In this paper we will extend two known location problems from Euclidean n-space to all n-dimensional normed spaces, n¿ 2. Let X be a "nite set of weighted points whose a2ne hull is n-dimensional. Our "rst objective is to "nd a hyperplane minimizing (among all hyperplanes) the sum of weighted distances with respect to X. Such a hyperplane is called a median hyperplane with respect to X, and we w...