-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
44 lines (44 loc) · 2.21 KB
/
index.html
File metadata and controls
44 lines (44 loc) · 2.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<style type="text/css">
section {
margin: 50px;
}
section#description {
font-size: 1.2em;
}
div {
margin: 10px 10px 10px 14px;
}
a.pagelink {
margin-right: 30px;
}
</style>
<title></title>
</head>
<body>
<section id="description">
<p>
The two pages below display my current candidate for the algorithm for computing annihilators and associated varieties for the groups SO(p,q) and Sp(n,ℝ).
This algorithm is still experimental.
It may not be correct in all aspects.
I welcome feedback. Please contact me at devra.johnson at verizon.net.
</p>
<p>
There is a block of representations for SO(p,p+1), and one for SO(p,p), which are not covered by this algorithm.
Instead, you would use the algorithm for their dual representations.
For that, see the <a href="https://devragj.github.io/TypeBCD/SppqAlgorithm.html" target="_blank">Sp(p,q) Algorithm</a> and the <a href="https://devragj.github.io/TypeBCD/SOStar2nAlgorithm.html" target="_blank">SO*(2n) Algorithm</a>.
</p>
</section>
<section>
<div>
<a class="pagelink" href="SOpqEvenAlgorithm.html">SO(p,q) Even Algorithm</a>
</div>
<div>
<a class="pagelink" href="SOpqOddSpnRAlgorithm.html">SO(p,q) Odd Sp(n,ℝ) Algorithm</a>
</div>
</section>
</body>
</html>