Related papers: Counting equivalence classes of irreducible repres…

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…

We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

Let A be a finite dimensional algebra over an algebraically closed field with the radical nilpotent of index 2. It is shown that A has finitely many conjugacy classes of left ideals if and only if A is of finite representation type provided…

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…

This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…

The vast majority of real world classification problems are imbalanced, meaning there are far fewer data from the class of interest (the positive class) than from other classes. We propose two machine learning algorithms to handle highly…

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

This paper presents analogous results of Hua [7][8] on numbers of representations of quivers over finite fields which respect nilpotent relations under certain assumptions. A closed formula which counts isomorphism classes of absolutely…