English
Related papers

Related papers: The complexity of the Lie module

200 papers

We give a lower bound of the Loewy length of the projective cover of the trivial module for the group algebra $kG$ of a finite group $G$ of Lie type defined over a finite field of odd characteristic $p$, where $k$ is an arbitrary field of…

Representation Theory · Mathematics 2017-02-14 Shigeo Koshitani , Jürgen Müller

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

Group Theory · Mathematics 2026-01-06 D. L. Flannery , A. E. Zalesski

We study modular Galois representations mod $p^m$. We show that there are three progressively weaker notions of modularity for a Galois representation mod $p^m$: we have named these `strongly', `weakly', and `dc-weakly' modular. Here, `dc'…

Number Theory · Mathematics 2012-05-28 Imin Chen , Ian Kiming , Gabor Wiese

The polynomial which determine the simplicity of the Kac modules for the restricted Lie superalgebra gl(m,n) is completely determined by a characteristic free approach. Its application on the nonrestricted representation is investigated.

Representation Theory · Mathematics 2016-03-15 Chaowen Zhang

A complex Lie supergroup can be described as a real Lie supergroup with integrable almost complex structure. The necessary and sufficient conditions on an almost complex structure on a real Lie supergroup for defining a complex Lie…

Complex Variables · Mathematics 2015-05-29 Matthias Kalus

We classify unitary highest weight modules with a given integral infinitesimal character for the real Lie algebras $\mathfrak{su}(p,q)$ and $\mathfrak{so}^*(2n)$. We treat both regular and singular cases. For $\mathfrak{su}(p,q)$ we…

Representation Theory · Mathematics 2026-04-23 Pavle Pandžić , Ana Prlić , Vladimír Souček , Vít Tuček

This article gives the structure of all projective indecomposable modules in blocks with non-cyclic defect group for $n\leq 11$, and almost all in the case of $n=12$, leaving four simple modules for $p=2$ and one simple module for $p=3$.

Representation Theory · Mathematics 2016-05-18 David A. Craven

The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, $$ where $0\le…

Number Theory · Mathematics 2016-03-15 Zhihua Niu , Zhixiong Chen , Xiaoni Du

The main purpose of this paper is to study the finite-dimensional solvable Lie algebras described in its title, which we call {\em minimal non-${\mathcal N}$}. To facilitate this we investigate solvable Lie algebras of nilpotent length $k$,…

Rings and Algebras · Mathematics 2016-08-25 David A. Towers

A study is made of real Lie algebras admitting compatible complex and product structures, including numerous 4-dimensional examples. If g is a Lie algebra with such a structure then its complexification has a hypercomplex structure. It is…

Differential Geometry · Mathematics 2007-05-23 Adrian Andrada , Simon Salamon

We give upper bounds for the number of irreducible representations of dimension at most n for a compact semisimple Lie group. In particular, we prove that there are at most n irreducible representations of dimension at most n for a simple…

Representation Theory · Mathematics 2010-03-17 Robert Guralnick , Michael Larsen , Corey Manack

We present the MEoP problem that decides the existence of solutions to certain modular equations over prime numbers and show how this separates the complexity class NP from its subclass P

Computational Complexity · Computer Science 2016-09-27 Marius Constantin Ionescu

The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…

Formal Languages and Automata Theory · Computer Science 2019-03-15 Émilie Charlier , Célia Cisternino , Adeline Massuir

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Algebraic Geometry · Mathematics 2016-12-23 Nardo Gimenez , Guillermo Matera

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…

Number Theory · Mathematics 2018-12-12 Ilya Mironov , Anton Mityagin , Kobbi Nissim

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

In 1994, Kac and Wakimoto suggested a generalization of Bernstein and Leites character formula for basic Lie superalgebras, and the natural question was raised: to which simple highest weight modules does it apply? In this paper, we prove a…

Representation Theory · Mathematics 2016-06-21 Michael Chmutov , Crystal Hoyt , Shifra Reif

For each integer $t>0$ and each complex simple Lie algebra $\mathfrak{g}$, we determine the least dimension of an irreducible highest weight representation of $\mathfrak{g}$ whose highest weight has height $t$. As a corollary, we classify…

Representation Theory · Mathematics 2016-03-11 Daniel Goldstein , Robert Guralnick , Richard Stong

Let M be a maximal subalgebra of the Lie algebra L. A subalgebra C of L is said to be a completion for M if C is not contained in M but every proper subalgebra of C that is an ideal of L is contained in M. The set I(M) of all completions of…

Rings and Algebras · Mathematics 2010-06-30 David A. Towers

We compute the Frobenius complexity for the determinantal ring of prime characteristic $p$ obtained by modding out the $2 \times 2$ minors of an $m \times n$ matrix of indeterminates, where $m > n \ge 2$. We also show that, as $p \to…

Commutative Algebra · Mathematics 2015-10-15 Florian Enescu , Yongwei Yao
‹ Prev 1 3 4 5 6 7 10 Next ›