نتایج جستجو برای: decision hyperplanes

تعداد نتایج: 350631  

Journal: :Discrete Mathematics 1999
Christos A. Athanasiadis Svante Linusson

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.

Journal: :Discrete Mathematics 2009
Ilaria Cardinali Bart De Bruyn Antonio Pasini

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.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم اجتماعی و اقتصادی 1389

abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...

Journal: :Discrete & Computational Geometry 2005
Richard J. Gardner Paolo Gronchi Chuanming Zong

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...

Journal: :Discrete & Computational Geometry 1988
Nimrod Megiddo

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

2005
Oded Regev Gillat Kol

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...

1999
Seiki Mori

The Nevanlinna defect relation and other results on the Nevanlinna theory assert that each meromorphic mapping f of C into P(C) has few deficient hyperplanes in P(C) . However, it seems to me that meromorphic mappings with a deficient hyperplane must be very few. In this paper, we show that for an arbitrary given transcendental meromorphic mapping f (which may be linearly degenerate), we can el...

1996
Jonathan Wiens

The paper is devoted to computation of the cohomology of the complex of logarithmic differential forms with coefficients in rational functions whose poles are located on the union of several hyperplanes of a linear space over a field of characteristic zero. The main result asserts that for a vast class of hyperplane arrangements, including all free and generic arrangements, the cohomology algeb...

2014
Alireza Salehi Mohammad Izadikhah

The production possibility set (PPS) is defined as the set of all inputs and outputs of a system in which inputs can produce outputs. In data envelopment analysis (DEA), identification of the strong defining hyperplanes of the empirical production possibility set (PPS) is important, because they can be used for determining rates of change of outputs with change in inputs. Also, efficient hyperp...

2008
Michael Dom Somnath Sikdar

We study an NP-complete geometric covering problem called d-Dimensional Rectangle Stabbing, where, given a set of axis-parallel d-dimensional hyperrectangles, a set of axis-parallel (d − 1)-dimensional hyperplanes and a positive integer k, the question is whether one can select at most k of the hyperplanes such that every hyperrectangle is intersected by at least one of these hyperplanes. This ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید