Related papers: Generating sets for coordinate rings of character …
Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…
Let G be a connected reductive affine algebraic group. In this short note we define the "variety of G-characters" of a finitely generated group F and show that the quotient of the G-character variety of F by the action of the trace…
We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…
Given $G$ an algebraic reductive group over an algebraically closed field of characteristic zero and $\Gamma$ a finitely generated group, we provide a stratification of the $G$-character variety of $\Gamma$ in terms of conjugacy classes of…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
Matrix generators for the general and special linear groups, the symplectic groups and the general and special unitary groups over finite fields. For the most part the generators have been obtained by translating Steinberg's generators for…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse…
Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…
In this paper we propose a construction of generic character sheaves on reductive groups over finite local rings at even levels, whose characteristic functions are higher Deligne--Lusztig characters when the parameters are generic. We…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…
The cone of a classical group $G$ is an affine $G\times G$-variety. The aim of this note is to initiate its combinatorial study in the cases when $G$ is the complex orthogonal or symplectic group. The coordinate ring of the cone of $G$ is a…
In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…
The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…
The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…