English
Related papers

Related papers: Orders of Finite Reductive Monoids

200 papers

In this paper, we establish two types of upper bounds on the vanishing order of Jacobi forms at infinity. The first type is for classical Jacobi forms, which is optimal in a certain sense. The second type is for Jacobi forms of lattice…

Number Theory · Mathematics 2025-06-23 Jialin Li , Haowu Wang

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

Let $H$ be an additively written monoid and let $\mathcal{P}_{0}(H)$ denote the reduced power monoid of $H$, that is, the monoid consisting of all subsets of $H$ containing $0$ with set addition as operation. Following work of Tringali, Wen…

Combinatorics · Mathematics 2025-10-21 Balint Rago

This paper has two main parts. Firstly, we give a classification of the $\ell$-blocks of finite special linear and unitary groups $SL_n(\epsilon q)$ in the non-defining characteristic $\ell\ge 3$. Secondly, we describe how the…

Representation Theory · Mathematics 2019-01-18 Zhicheng Feng

We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of…

Combinatorics · Mathematics 2025-11-13 Jean-Luc Baril , Nathanaël Hassler , Sergey Kirgizov

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…

Group Theory · Mathematics 2021-12-02 Victor Fadinger , Qinghai Zhong

In this short note we prove that any irreducible algebraic monoid whose unit group is an affine algebraic group is affine.

Algebraic Geometry · Mathematics 2007-05-23 Alvaro Rittatore

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

Group Theory · Mathematics 2021-12-01 Derek Holt , Gareth Tracey

We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…

Commutative Algebra · Mathematics 2022-08-03 Pedro A. García-Sánchez , Andrés Herrera-Poyatos

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}

Number Theory · Mathematics 2026-02-27 Roman Popovych

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Group Theory · Mathematics 2016-10-25 Spencer Gerhardt

If in a given rank $r$, there is an irreducible complex local system with torsion determinant and quasi-unipotent monodromies at infinity on a smooth quasi-projective variety, then for every prime number $\ell$, there is an absolutely…

Algebraic Geometry · Mathematics 2023-02-22 Johan de Jong , Hélène Esnault

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

Number Theory · Mathematics 2025-10-16 Joachim König

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Number Theory · Mathematics 2018-11-21 Domingo Gómez-Pérez , László Mérai , Igor E. Shparlinski

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Rings and Algebras · Mathematics 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

In this paper we classify the irreducible quasifinite highest weight modules over the orthogonal and symplectic types Lie subalgebras of the Lie algebra of the matrix quantum pseudo differential operators. We also realize them in terms of…

Mathematical Physics · Physics 2017-03-21 Karina Batistelli , Carina Boyallian

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

Number Theory · Mathematics 2011-10-18 Benjamin Girard

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

Combinatorics · Mathematics 2025-02-04 Emiliano Liwski , Fatemeh Mohammadi