Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Discrete Laplace operator
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== ADE classification == {{further|ADE classification}} Certain equations involving the discrete Laplacian only have solutions on the simply-laced [[Dynkin diagram]]s (all edges multiplicity 1), and are an example of the [[ADE classification]]. Specifically, the only positive solutions to the homogeneous equation: :<math>\Delta \phi = \phi,</math> in words, :"Twice any label is the sum of the labels on adjacent vertices," are on the extended (affine) ADE Dynkin diagrams, of which there are 2 infinite families (A and D) and 3 exceptions (E). The resulting numbering is unique up to scale, and if the smallest value is set at 1, the other numbers are integers, ranging up to 6. The ordinary ADE graphs are the only graphs that admit a positive labeling with the following property: :Twice any label minus two is the sum of the labels on adjacent vertices. In terms of the Laplacian, the positive solutions to the inhomogeneous equation: :<math>\Delta \phi = \phi - 2.</math> The resulting numbering is unique (scale is specified by the "2"), and consists of integers; for E<sub>8</sub> they range from 58 to 270, and have been observed as early as 1968.<ref name="Bourbaki"> {{citation | author-link = Nicolas Bourbaki | first = Nicolas | last = Bourbaki |orig-date = 1968 | title = Groupes et algebres de Lie: Chapters 4β6 |series=Elements of Mathematics | publisher = Springer |isbn=978-3-540-69171-6 |url={{GBurl|FU5WeeFoDY4C|pg=PR7}} |translator-first=Andrew |translator-last=Pressley |year=2002}} </ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)