522 research outputs found
Unipotent elements forcing irreducibility in linear algebraic groups
Let be a simple algebraic group over an algebraically closed field of
characteristic . We consider connected reductive subgroups of
that contain a given distinguished unipotent element of . A result of
Testerman and Zalesski (Proc. Amer. Math. Soc., 2013) shows that if is a
regular unipotent element, then cannot be contained in a proper parabolic
subgroup of . We generalize their result and show that if has order ,
then except for two known examples which occur in the case ,
the subgroup cannot be contained in a proper parabolic subgroup of . In
the case where has order , we also present further examples arising
from indecomposable tilting modules with quasi-minuscule highest weight.Comment: 33 page
Invariant forms on irreducible modules of simple algebraic groups
Let be a simple linear algebraic group over an algebraically closed field
of characteristic and let be an irreducible rational
-module with highest weight . When is self-dual, a basic
question to ask is whether has a non-degenerate -invariant alternating
bilinear form or a non-degenerate -invariant quadratic form.
If , the answer is well known and easily described in terms of
. In the case where , we know that if is self-dual, it
always has a non-degenerate -invariant alternating bilinear form. However,
determining when has a non-degenerate -invariant quadratic form is a
classical problem that still remains open. We solve the problem in the case
where is of classical type and is a fundamental highest weight
, and in the case where is of type and for . We also give a solution in some specific
cases when is of exceptional type.
As an application of our results, we refine Seitz's description of
maximal subgroups of simple algebraic groups of classical type. One consequence
of this is the following result. If are simple
algebraic groups and is irreducible, then one of the following
holds: (1) is not self-dual; (2) both or neither of the
modules and have a non-degenerate invariant
quadratic form; (3) , , and .Comment: 46 pages; to appear in J. Algebr
Orthogonal irreducible representations of finite solvable groups in odd dimension
We prove that if is a finite irreducible solvable subgroup of an
orthogonal group with odd, then preserves an orthogonal
decomposition of into -spaces. In particular is monomial. This
generalizes a theorem of Rod Gow.Comment: to appear in Bull. Lond. Math. So
Jordan blocks of unipotent elements in some irreducible representations of classical groups in good characteristic
Let be a classical group with natural module over an algebraically
closed field of good characteristic. For every unipotent element of , we
describe the Jordan block sizes of on the irreducible -modules which
occur as composition factors of , , and .
Our description is given in terms of the Jordan block sizes of the tensor
square, exterior square, and the symmetric square of , for which recursive
formulae are known.Comment: to appear in Proc. Amer. Math. So
Adjoint Jordan blocks for simple algebraic groups of type in characteristic two
Let be a simple algebraic group over an algebraically closed field
with Lie algebra . For unipotent elements and nilpotent
elements , the Jordan block sizes of
and are known in most cases. In the cases that remain,
the group is of classical type in bad characteristic, so
and is of type , , or
.
In this paper, we consider the case where is of type and
. As our main result, we determine the Jordan block
sizes of and for all unipotent and nilpotent . In the case where is of adjoint
type, we will also describe the Jordan block sizes on .Comment: 39 page
Fast Monotone Summation over Disjoint Sets
We study the problem of computing an ensemble of multiple sums where the
summands in each sum are indexed by subsets of size of an -element
ground set. More precisely, the task is to compute, for each subset of size
of the ground set, the sum over the values of all subsets of size that are
disjoint from the subset of size . We present an arithmetic circuit that,
without subtraction, solves the problem using arithmetic
gates, all monotone; for constant , this is within the factor
of the optimal. The circuit design is based on viewing the summation as a "set
nucleation" task and using a tree-projection approach to implement the
nucleation. Applications include improved algorithms for counting heaviest
-paths in a weighted graph, computing permanents of rectangular matrices,
and dynamic feature selection in machine learning
- …