Related papers: Generating sets for coordinate rings of character …

Let $\CC$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster-tilting object $T$. Under a constructibility condition we prove the existence of a set $\mathcal G^T(\CC)$ of generic values of the cluster character associated to…

We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…

A complex irreducible character of a finite group G is said to be p-constant, for some prime p dividing the order of G, if it takes constant value at the set of p-singular elements of G. In this paper we classify irreducible p-constant…

We study a family of subrings, indexed by the natural numbers, of the mod-p cohomology of a finite group G. These subrings are based on a family of v_n-periodic complex oriented cohomology theories and are constructed as rings of…

Let $G$ be a finite group and, for a given complex character $\chi$ of $G$, let ${\mathbb{Q}}(\chi)$ denote the field extension of ${\mathbb{Q}}$ obtained by adjoining all the values $\chi(g)$, for $g\in G$. The group $G$ is called…

Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…

We show the existence of a unitriangular basic set for unipotent blocks simple reductive groups of classical type in bad characteristic with some exceptions. Then,we introduce an algorithm to count irreducible unipotent Brauer characters…

Let G be a reductive connected group over the algebraic closure of a finite field. In this paper we give the classification of character sheaves on G in categorical terms (as a categorical centre). Previously such a classification was known…

We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…

We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…

It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Linear codes are widely employed in communication systems, consumer electronics, and storage devices. All linear codes over finite fields can be generated by a generator matrix. Due to this, the generator matrix approach is called a…

In this short note we prove a finite generation result for the coordinate ring of certain affine group schemes over a discrete valuation ring. This may be used to simplify the use of results of Prasad and Yu on quasi-reductive groups by…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…