English
Related papers

Related papers: Writing representations over minimal fields

200 papers

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Combinatorics · Mathematics 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

Rings and Algebras · Mathematics 2023-06-29 Daniel Gonçalves , Danilo Royer

We obtain minimal dimension matrix representations for each indecomposable five-dimensional Lie algebra over $\R$ and justify in each case that they are minimal. In each case a matrix Lie group is given whose matrix Lie algebra provides the…

Differential Geometry · Mathematics 2014-02-21 Ryad Ghanam , G. Thompson

We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…

Representation Theory · Mathematics 2021-02-26 Martina Balagovic , Harrison Chen

Let O be a complete discrete valuation domain with finite residue field. In this paper we describe the irreducible representations of the groups Aut(M) for any finite O-module M of rank two. The main emphasis is on the interaction between…

Representation Theory · Mathematics 2008-08-21 Uri Onn

For a finite group $G$, the representation dimension is the smallest integer realizable as the degree of a complex faithful representation of $G$. In this article, we compute representation dimension for some $p$-groups, their direct…

Group Theory · Mathematics 2023-08-04 Gurleen Kaur , Amit Kulshrestha , Anupam Singh

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

Group Theory · Mathematics 2009-04-06 Hyun Kyu Kim

Let $F$ be a local non-archimedian field of positive characteristic, $D$ be a skew-field with center $F$ and $ G=D^{\star}$ be the multiplicative group of $D$. The goal of this paper is to provide a canonical decomposition of any complex…

Representation Theory · Mathematics 2019-05-08 David Kazhdan

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

Number Theory · Mathematics 2022-11-03 Chun Yin Hui

Based on the recently proposed character theory of projective representations of finite groups proposed, we generalise several algorithms for computing character tables and matrices of irreducible linear representations to projective…

Representation Theory · Mathematics 2025-05-22 Attila Szabó

The covering of the affine symmetry group, a semidirect product of translations and special linear transformations, in $D \geq 3$ dimensional spacetime is considered. Infinite dimensional spinorial representations on states and fields are…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Djordje Sijacki

We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…

Representation Theory · Mathematics 2026-03-25 Milo Bechtloff Weising

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

Group Theory · Mathematics 2008-12-23 J. O. Button

The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…

Group Theory · Mathematics 2019-08-27 Carmelo Vaccaro

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

Group Theory · Mathematics 2024-07-24 Sheehan Olver

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

Symbolic Computation · Computer Science 2016-05-19 Alin Bostan , Gilles Christol , Philippe Dumas

We obtained some sufficient and necessary conditions of existence of faithful irreducible representations of a soluble group $G$ of finite rank over a field $k$. It was shown that the existence of such representations strongly depends on…

Group Theory · Mathematics 2012-08-14 A. V. Tushev

We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…

Representation Theory · Mathematics 2019-12-20 K. R. Goodearl , B. Huisgen-Zimmermann

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

Group Theory · Mathematics 2014-10-10 Mark Brittenham , Susan Hermiller

In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…

Combinatorics · Mathematics 2007-05-23 Massimiliano Lunelli , Antonio Laface
‹ Prev 1 4 5 6 7 8 10 Next ›