|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[geometry]] and [[combinatorics]], an '''arrangement of hyperplanes''' is a finite set ''A'' of [[hyperplane]]s in a [[linear space|linear]], [[affine geometry|affine]], or [[projective geometry|projective]] space ''S''.
| | A lagging computer is truly annoying and will be quite a headache. Almost each individual who uses a computer faces this issue several time or the other. If the computer equally suffers from the same problem, there are it hard to continue working as normal. In such a situation, the thought, "what could I do to make my PC run quicker?" is repeated and infuriating. There's a solution, still!<br><br>Registry is not moreover significant to fast computer boot up, and crucial to the performance of a computer. If you have a registry error, you can face blue screen, freezing or even crash. It's required to frequently clean up the invalid, missing, junk registry keys to keep the computer healthy and running quick.<br><br>With the Internet, the risk to the registry is more and windows XP error messages would appear frequently. Why? The malicious wares like viruses, Trojans, spy-wares, ad wares, and the like gets recorded too. Cookies are best examples. We reach save passwords, plus stuff, appropriate? That is a simple illustration of the register functioning.<br><br>Fixing tcpip.sys blue screen is simple to do with registry repair software.Trying to fix windows blue screen error on the own is challenging because in the event you remove or damage the registry it could result severe damage to a computer. The registry should be cleaned plus all erroneous and incomplete info removed to stop blue screen mistakes from occurring.The benefit of registry repair software is not limited to simply getting rid of the blue screen on startup.We might be surprised at the greater and more improved speed plus performance of your computer program after registry cleaning is done. Registry cleaning can definitely develop the computer's functioning abilities, specifically when you choose a certain registry repair software which is really efficient.<br><br>In a word, to accelerate windows XP, Vista business, it's very significant to disable certain business goods plus clean and optimize the registry. You are able to follow the steps above to disable unnecessary programs. To optimize the registry, I suggest you employ a [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities] software. Because it is pretty dangerous for we to edit the registry by yourself.<br><br>Files with the DOC extension are moreover susceptible to viruses, yet this can be solved by advantageous antivirus programs. Another issue is that .doc files could be corrupted, unreadable or damaged due to spyware, adware, and malware. These instances might avoid consumers from properly opening DOC files. This is whenever powerful registry products become worthwhile.<br><br>It is critical which we remove obsolete registry entries from a program on a regular basis, if you need a system to run quicker, which is. If you don't keep a registry clean, a time comes when a program usually stop working altogether. Next, a only option will be to reformat your hard drive and start over!<br><br>Registry cleaners have been tailored to fix all the broken files inside your system, allowing your computer to read any file it wants, when it wants. They work by scanning by the registry and checking each registry file. If the cleaner sees it is corrupt, then it can replace it automatically. |
| Questions about a hyperplane arrangement ''A'' generally concern geometrical, topological, or other properties of the '''complement''', ''M''(''A''), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice.
| |
| The '''intersection [[semilattice]]''' of ''A'', written ''L''(''A''), is the set of all [[Euclidean subspace|subspaces]] that are obtained by intersecting some of the hyperplanes; among these subspaces are ''S'' itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc. (excluding, in the affine case, the empty set). These subspaces are called the '''flats''' of ''A''. ''L''(''A'') is partially ordered by ''reverse inclusion''.
| |
| | |
| If the whole space ''S'' is 2-dimensional, the hyperplanes are [[line (mathematics)|line]]s; such an arrangement is often called an '''[[arrangement of lines]]'''. Historically, real arrangements of lines were the first arrangements investigated. If ''S'' is 3-dimensional one has an '''arrangement of planes'''.
| |
| | |
| == General theory ==
| |
| === The intersection semilattice and the matroid ===
| |
| | |
| The intersection semilattice ''L''(''A'') is a meet semilattice and more specifically is a [[geometric semilattice]].
| |
| If the arrangement is linear or projective, or if the intersection of all hyperplanes is nonempty, the intersection lattice is a [[geometric lattice]].
| |
| (This is why the semilattice must be ordered by reverse inclusion—rather than by inclusion, which might seem more natural but would not yield a geometric (semi)lattice.)
| |
| | |
| When ''L''(''A'') is a lattice, the [[matroid]] of ''A'', written ''M''(''A''), has ''A'' for its ground set and has rank function ''r''(''S'') := codim(''I''), where ''S'' is any subset of ''A'' and ''I'' is the intersection of the hyperplanes in ''S''. In general, when ''L''(''A'') is a semilattice, there is an analogous matroid-like structure that might be called a [[semimatroid]], which is a generalization of a matroid (and has the same relationship to the intersection semilattice as does the matroid to the lattice in the lattice case), but is not a matroid if ''L''(''A'') is not a lattice.
| |
| | |
| === Polynomials ===
| |
| | |
| For a subset ''B'' of ''A'', let us define ''f''(''B'') := the intersection of the hyperplanes in ''B''; this is ''S'' if ''B'' is empty.
| |
| The '''characteristic polynomial of''' ''A'', written ''p<sub>A</sub>''(''y''), can be defined by
| |
| | |
| :<math>p_A(y) := \sum_B (-1)^{|B|}y^{\dim f(B)},</math>
| |
| | |
| summed over all subsets ''B'' of ''A'' except, in the affine case, subsets whose intersection is empty. (The dimension of the empty set is defined to be −1.) This polynomial helps to solve some basic questions; see below.
| |
| Another polynomial associated with ''A'' is the '''Whitney-number polynomial''' ''w<sub>A</sub>''(''x'', ''y''), defined by
| |
| | |
| :<math>w_A(x,y) := \sum_B x^{n-\dim f(B)} \sum_C (-1)^{|C-B|}y^{\dim f(C)},</math>
| |
| | |
| summed over ''B'' ⊆ ''C'' ⊆ ''A'' such that ''f''(''B'') is nonempty.
| |
| | |
| Being a geometric lattice or semilattice, ''L''(''A'') has a characteristic polynomial, ''p''<sub>''L''(''A'')</sub>(''y''), which has an extensive theory (see [[Matroid#Characteristic_polynomial|matroid]]). Thus it is good to know that ''p''<sub>''A''</sub>(''y'') = ''y''<sup>''i''</sup> ''p''<sub>''L''(''A'')</sub>(''y''), where ''i'' is the smallest dimension of any flat, except that in the projective case it equals ''y''<sup>''i'' + 1</sup>''p''<sub>''L''(''A'')</sub>(''y'').
| |
| The Whitney-number polynomial of ''A'' is similarly related to that of ''L''(''A''). | |
| (The empty set is excluded from the semilattice in the affine case specifically so that these relationships will be valid.)
| |
| | |
| === The Orlik–Solomon algebra ===
| |
| | |
| The intersection semilattice determines another combinatorial invariant of the arrangement, the [[Orlik–Solomon algebra]]. To define it, fix a commutative subring ''K'' of the base field, and form the exterior algebra ''E'' of the vector space
| |
| :<math>\bigoplus_{H \in A} K e_H </math>
| |
| generated by the hyperplanes.
| |
| A [[chain complex]] structure is defined on ''E'' with the usual boundary operator <math>\partial</math>.
| |
| The Orlik-Solomon algebra is then the quotient of ''E'' by the [[Ideal (ring theory)|ideal]] generated by elements of the form <math>e_{H_1} \wedge \cdots \wedge e_{H_p}</math> (where <math>H_1, \dots, H_p</math> have an empty intersection) and by boundaries of elements of the same form for which <math>H_1 \cap \cdots \cap H_p</math> has [[codimension]] less than ''p''.
| |
| | |
| == Real arrangements ==
| |
| | |
| In [[real number|real]] [[affine space]], the complement is disconnected: it is made up of separate pieces called '''cells''' or '''regions''' or '''chambers''', each of which is either a bounded region that is a [[Convex polygon|convex]] [[polytope]], or an unbounded region that is a convex [[polyhedron#General|polyhedral]] region which goes off to infinity. | |
| Each flat of ''A'' is also divided into pieces by the hyperplanes that do not contain the flat; these pieces are called the '''faces''' of ''A''.
| |
| The regions are faces because the whole space is a flat.
| |
| The faces of codimension 1 may be called the '''facets''' of ''A''.
| |
| The '''face semilattice''' of an arrangement is the set of all faces, ordered by ''inclusion''. Adding an extra top element to the face semilattice gives the '''face lattice'''.
| |
| | |
| In two dimensions (i.e., in the real affine [[plane (mathematics)|plane]]) each region is a convex [[polygon]] (if it is bounded) or a convex polygonal region which goes off to infinity.
| |
| * As an example, if the arrangement consists of three parallel lines, the intersection semilattice consists of the plane and the three lines, but not the empty set. There are four regions, none of them bounded.
| |
| * If we add a line crossing the three parallels, then the intersection semilattice consists of the plane, the four lines, and the three points of intersection. There are eight regions, still none of them bounded.
| |
| * If we add one more line, parallel to the last, then there are 12 regions, of which two are bounded [[parallelogram]]s.
| |
| | |
| A typical problem about an arrangement in ''n''-dimensional real space is to say how many regions there are, or how many faces of dimension 4, or how many bounded regions. These questions can be answered just from the intersection semilattice. For instance, two basic theorems are that the number of regions of an affine arrangement equals (−1)<sup>''n''</sup>''p''<sub>''A''</sub>(−1) and the number of bounded regions equals (−1)<sup>''n''</sub>p<sub>''A''</sub>(1). Similarly, the number of ''k''-dimensional faces or bounded faces can be read off as the coefficient of ''x''<sup>''n''−''k''</sup> in (−1)<sup>''n''</sup> w<sub>''A''</sub> (−''x'', −1) or (−1)<sup>''n''</sup>''w''<sub>''A''</sub>(−''x'', 1).
| |
| | |
| {{harvtxt|Meiser|1993}} designed a fast algorithm to determine the face of an arrangement of hyperplanes containing an input point.
| |
| | |
| Another question about an arrangement in real space is to decide how many regions are [[simplex|simplices]] (the ''n''-dimensional generalization of [[triangle]]s and [[tetrahedron|tetrahedra]]). This cannot be answered based solely on the intersection semilattice. The [[McMullen problem]] asks for the smallest arrangement of a given dimension in general position in [[real projective space]] for which there does not exist a cell touched by all hyperplanes. | |
| | |
| A real linear arrangement has, besides its face semilattice, a '''[[poset]] of regions''', a different one for each region. This poset is formed by choosing an arbitrary base region, ''B''<sub>0</sub>, and associating with each region ''R'' the set ''S''(''R'') consisting of the hyperplanes that separate ''R'' from ''B''. The regions are partially ordered so that ''R''<sub>1</sub> ≥ ''R''<sub>2</sub> if ''S''(''R''<sub>1</sub>, ''R'') contains ''S''(''R''<sub>2</sub>, ''R''). In the special case when the hyperplanes arise from a [[root system]], the resulting poset is the corresponding [[Weyl group]] with the weak Bruhat order. In general, the poset of regions is [[ranked poset|ranked]] by the number of separating hyperplanes and its [[Incidence algebra|Möbius function]] has been computed {{harv|Edelman|1984}}.
| |
| | |
| ==Complex arrangements==
| |
| | |
| In [[complex number|complex]] affine space (which is hard to visualize because even the complex affine plane has four real dimensions), the complement is connected (all one piece) with holes where the hyperplanes were removed.
| |
| | |
| A typical problem about an arrangement in complex space is to describe the holes.
| |
| | |
| The basic theorem about complex arrangements is that the [[cohomology]] of the complement ''M''(''A'') is completely determined by the intersection semilattice. To be precise, the cohomology ring of ''M''(''A'') (with integer coefficients) is [[isomorphic]] to the Orlik-Solomon algebra on '''Z'''.
| |
| | |
| The isomorphism can be described rather explicitly, and gives a presentation of the cohomology in terms of generators and relations, where generators are represented (in the [[de Rham cohomology]]) as logarithmic [[differential form]]s
| |
| | |
| :<math>\frac{1}{2\pi i}\frac{d\alpha}{\alpha}.</math>
| |
| | |
| with <math>\alpha</math> any linear form defining the generic hyperplane of the arrangement.
| |
| | |
| ==Technicalities==
| |
| | |
| Sometimes it is convenient to allow the '''degenerate hyperplane''', which is the whole space ''S'', to belong to an arrangement. If ''A'' contains the degenerate hyperplane, then it has no regions because the complement is empty. However, it still has flats, an intersection semilattice, and faces. The preceding discussion assumes the degenerate hyperplane is not in the arrangement.
| |
| | |
| Sometimes one wants to allow repeated hyperplanes in the arrangement. We did not consider this possibility in the preceding discussion, but it makes no material difference.
| |
| | |
| ==See also==
| |
| *[[Supersoluble arrangement]]
| |
| | |
| ==References==
| |
| *{{Springer|id=A/a110700|title=Arrangement of hyperplanes}}
| |
| *{{citation
| |
| | last = Edelman | first = Paul H.
| |
| | doi = 10.2307/1999150
| |
| | issue = 2
| |
| | journal = [[Transactions of the American Mathematical Society]]
| |
| | pages = 617–631
| |
| | title = A partial order on the regions of ℝ<sup>''n''</sup> dissected by hyperplanes
| |
| | volume = 283
| |
| | year = 1984
| |
| | mr = 0737888
| |
| | jstor = 1999150}}.
| |
| *{{citation
| |
| | last = Meiser | first = S.
| |
| | doi = 10.1006/inco.1993.1057
| |
| | issue = 2
| |
| | journal = Information and Computation
| |
| | pages = 286–303
| |
| | title = Point location in arrangements of hyperplanes
| |
| | volume = 106
| |
| | year = 1993
| |
| | mr = 1241314}}.
| |
| *{{citation
| |
| | last1 = Orlik | first1 = Peter
| |
| | last2 = Terao | first2 = Hiroaki
| |
| | location = Berlin
| |
| | publisher = Springer-Verlag
| |
| | series = Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]
| |
| | title = Arrangements of Hyperplanes
| |
| | volume = 300
| |
| | year = 1992
| |
| | mr = 1217488}}.
| |
| *{{cite book|last = Stanley|first=Richard|title=Enumerative Combinatorics|volume=1|chapter=3.11 Hyperplane Arrangements|edition=2nd|ISBN=1107602629|year=2011|publisher=Cambridge University Press}}
| |
| *{{citation
| |
| | last = Zaslavsky | first = Thomas
| |
| | issue = No. 154
| |
| | location = Providence, R.I.
| |
| | publisher = [[American Mathematical Society]]
| |
| | journal = Memoirs of the American Mathematical Society
| |
| | title = Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
| |
| | year = 1975
| |
| | mr = 0357135}}.
| |
| | |
| [[Category:Discrete geometry]]
| |
| [[Category:Combinatorics]]
| |
| [[Category:Oriented matroids]]
| |
A lagging computer is truly annoying and will be quite a headache. Almost each individual who uses a computer faces this issue several time or the other. If the computer equally suffers from the same problem, there are it hard to continue working as normal. In such a situation, the thought, "what could I do to make my PC run quicker?" is repeated and infuriating. There's a solution, still!
Registry is not moreover significant to fast computer boot up, and crucial to the performance of a computer. If you have a registry error, you can face blue screen, freezing or even crash. It's required to frequently clean up the invalid, missing, junk registry keys to keep the computer healthy and running quick.
With the Internet, the risk to the registry is more and windows XP error messages would appear frequently. Why? The malicious wares like viruses, Trojans, spy-wares, ad wares, and the like gets recorded too. Cookies are best examples. We reach save passwords, plus stuff, appropriate? That is a simple illustration of the register functioning.
Fixing tcpip.sys blue screen is simple to do with registry repair software.Trying to fix windows blue screen error on the own is challenging because in the event you remove or damage the registry it could result severe damage to a computer. The registry should be cleaned plus all erroneous and incomplete info removed to stop blue screen mistakes from occurring.The benefit of registry repair software is not limited to simply getting rid of the blue screen on startup.We might be surprised at the greater and more improved speed plus performance of your computer program after registry cleaning is done. Registry cleaning can definitely develop the computer's functioning abilities, specifically when you choose a certain registry repair software which is really efficient.
In a word, to accelerate windows XP, Vista business, it's very significant to disable certain business goods plus clean and optimize the registry. You are able to follow the steps above to disable unnecessary programs. To optimize the registry, I suggest you employ a tuneup utilities software. Because it is pretty dangerous for we to edit the registry by yourself.
Files with the DOC extension are moreover susceptible to viruses, yet this can be solved by advantageous antivirus programs. Another issue is that .doc files could be corrupted, unreadable or damaged due to spyware, adware, and malware. These instances might avoid consumers from properly opening DOC files. This is whenever powerful registry products become worthwhile.
It is critical which we remove obsolete registry entries from a program on a regular basis, if you need a system to run quicker, which is. If you don't keep a registry clean, a time comes when a program usually stop working altogether. Next, a only option will be to reformat your hard drive and start over!
Registry cleaners have been tailored to fix all the broken files inside your system, allowing your computer to read any file it wants, when it wants. They work by scanning by the registry and checking each registry file. If the cleaner sees it is corrupt, then it can replace it automatically.