English
Related papers

Related papers: Counting equivalence classes of irreducible repres…

200 papers

We observe that a finitely generated algebraic algebra R (over a field) is finite dimensional if and only if the associated graded ring grR is right noetherian, if and only if grR has right Krull dimension, if and only if grR satisfies a…

Rings and Algebras · Mathematics 2017-08-14 Edward S. Letzter

We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors…

Number Theory · Mathematics 2019-09-10 Soumya Bhattacharya

We discuss the homological algebra of representation theory of finite dimensional algebras and finite groups. We present various methods for the construction and the study of equivalences of derived categories: local group theory, geometry…

Representation Theory · Mathematics 2007-05-23 Raphael Rouquier

In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…

Logic in Computer Science · Computer Science 2010-06-28 Ali Akbar Safilian , Farzad Didehvar

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

This paper contains a complete description of classes of the unitary equivalence of the admissible representations of infinite-dimensional classic matrix groups paper.

funct-an · Mathematics 2008-02-03 N. I. Nessonov

An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression…

Discrete Mathematics · Computer Science 2026-01-26 Ivan Stošić , Ivan Damnjanović , Žarko Ranđelović

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

Representation Theory · Mathematics 2010-12-03 Jinkui Wan

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Number Theory · Mathematics 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

Group Theory · Mathematics 2017-02-10 Bettina Eick

An algorithm is described to compute the canonical basis of an irreducible module over a quantized enveloping algebra of a finite-dimensional semisimple Lie algebra. The algorithm works for modules that are constructed as a submodule of a…

Quantum Algebra · Mathematics 2007-05-23 W. A. de Graaf

Let $U_n(q)$ be the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. In this paper, we present constructions of large degree ordinary irreducible representations of $U_n(q)$ where $n\geq 7$, and then…

Representation Theory · Mathematics 2013-08-07 Tung Le

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

The objective of this paper is to determine the finite dimensional, indecomposable representations of the algebra that is generated by two complex structures over the real numbers. Since the generators satisfy relations that are similar to…

Representation Theory · Mathematics 2008-04-24 Steven Gindi

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

Computational Complexity · Computer Science 2018-10-01 Noson S. Yanofsky

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Logic · Mathematics 2023-04-17 Alec Fox

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…

Classical Analysis and ODEs · Mathematics 2010-01-19 Ivan Tsyfra , Tomasz Czyzycki

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

Quantum Physics · Physics 2019-07-01 Heinz-Jürgen Schmidt