Related papers: Absolute order in general linear groups

In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

The classical result, due to Jordan, Burnside, Dickson, says that every normal subgroup of $GL(n, K)$ ($K$ - a field, $n \geq 3$) which is not contained in the center, contains $SL(n, K)$. A. Rosenberg gave description of normal subgroups…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…

Let $G\subset\GL(V)$ be a complex reductive group. Let $G'$ denote $\{\phi\in\GL(V)\mid p\circ\phi=p\text{for all} p\in\C[V]^G\}$. We show that, in general, $G'=G$. In case $G$ is the adjoint group of a simple Lie algebra $\lieg$, we show…

The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. If $\Omega$ is a non-empty subset of the set of natural numbers, $h(\Omega)$ stands for the number of isomorphism classes of finite groups $G$ with…

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

An order is a commutative ring that as an abelian group is finitely generated and free. A commutative ring is reduced if it has no non-zero nilpotent elements. In this paper we use a new tool, namely, the fact that every reduced order has a…

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

We produce full strong exceptional collections consisting of vector bundles on the geometric invariant theory quotient of certain linear actions of a split reductive group $G$ of rank two. The vector bundles correspond to irreducible…

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the…

A group element is called generalized torsion if a finite product of its conjugates is equal to the identity. We show that in a finitely generated abelian-by-finite group, an element is generalized torsion if and only if its image in the…

For each subgroup of GL_2(F_p) or order divisible by p, generated by (pseudo-)reflections, we compute the ideals of stable and generalized invariants. These groups and these ideals are related to the cohomology of compact Lie groups,…

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

I consider general reflection coefficients for arbitrary one-dimensional whole line differential or difference operators of order $2$. These reflection coefficients are semicontinuous functions of the operator: their absolute value can only…