English
Related papers

Related papers: Jordan--Landau theorem for matrices over finite fi…

200 papers

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups $Gl_n(F_q)$ for all n, which we…

Combinatorics · Mathematics 2021-06-23 Adithya Balachandran , Nir Gadish , Andrew Huang , Siwen Sun

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and let $\mathbb{K}_{C}[[x_{1},...,x_{e}]]$ be the ring of formal power series in several variables with exponents in a line free cone $C$. We consider irreducible…

Algebraic Geometry · Mathematics 2021-05-11 Ali Abbas , Abdallah Assi

Picking permutations at random, the expected number of k-cycles is known to be 1/k and is, in particular, independent of the size of the permuted set. This short note gives similar size-independent statistics of finite general linear…

Combinatorics · Mathematics 2019-10-29 Nir Gadish

We study the algebraic properties of Generalized Laguerre polynomials for negative integral values of a given parameter which is $L_{n}^{(-1-n-r)}(x)= \sum\limits_{j=0}^{n} \binom{n-j+r}{n-j} \frac{x^{j}}{j!}$ for integers $r\geq 0, n\geq…

Number Theory · Mathematics 2019-01-07 Ankita Jindal , Shanta Laishram , Ritumoni Sarma

Let $G$ be a simple algebraic group over the algebraic closure of $GF(p)$ ($p$ prime), and let $G(q)$ denote a corresponding finite group of Lie type over $GF(q)$, where $q$ is a power of $p$. Let $X$ be an irreducible subvariety of $G^r$…

Group Theory · Mathematics 2018-10-04 Robert M. Guralnick , Martin W. Liebeck , Frank Lübeck , Aner Shalev

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…

Number Theory · Mathematics 2015-05-28 Jason P. Bell , Stanley N. Burris , Karen Yeats

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

Combinatorics · Mathematics 2011-02-10 Mario Garcia Armas , Sudhir R. Ghorpade , Samrith Ram

We establish an irreducibility property for the characters of finite dimensional, irreducible representations of simple Lie algebras (or simple algebraic groups) over the complex numbers, i.e., that the characters of irreducible…

Representation Theory · Mathematics 2011-10-25 C. S. Rajan

We give another proof of a theorem of D. Prasad (Theorem 2, \textit{Israel J. Math.} 2016), which is also a classical result of Littlewood--Richardson (Theorem VI, \textit{Q. J. Math.} 1934). For integers $m,n \ge 2$, this result calculates…

Representation Theory · Mathematics 2026-04-07 Chayan Karmakar

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

Number Theory · Mathematics 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Number Theory · Mathematics 2016-03-04 Michael E. Zieve

Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that…

Information Theory · Computer Science 2017-10-24 Yansheng Wu , Qin Yue , Shuqin Fan

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

Commutative Algebra · Mathematics 2021-05-14 Devendra Prasad

We study the category O of representations over a shifted Yangian. This category has a tensor product structure and contains distinguished modules, the positive prefundamental modules and the negative prefundamental modules. Motivated by…

Quantum Algebra · Mathematics 2024-10-30 David Hernandez , Huafeng Zhang

An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…

Combinatorics · Mathematics 2017-10-03 Richard Anstee , Jeffrey Dawson , Linyuan Lu , Attila Sali

This paper describes the expected characteristic polynomial of the commutator of randomly rotated matrices, in the context of the finite free probability theory initiated by Marcus, Spielman, and Srivastava. The key technical features are…

Combinatorics · Mathematics 2022-09-02 Jacob Campbell