Related papers: A note on finite determinacy of matrices

A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…

Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k. The second one is a formula for the…

A finite spin system invariant under a symmetry group G is a very illustrative example of the finite group action on a set of mappings f:X->Y. In the case of spin systems X is a set of spin carriers and Y contains 2s+1 z-components -s<=m<=s…

We show that the change of basis matrices of a set of $m$ bases of a finite vector space is a connected groupoid of order $m^2$. We define a general method to express the elements of change of basis matrices as algebraic expressions using…

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…

A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

In the present article we shown a formula to compute the number of all matrices over the finite field $F$ whit prescribed eigenvalues. Using this formula we obtain one inequality for the number of $(k+1)$-potent elements over finite rings.

In this article we prove a necessary and a sufficient condition for a finite subset of the special linear group to be dominated. These conditions are purely geometric in nature, as they only involve the trace and the eigenvectors of the…

Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

We consider membership problems for rational subsets of the semigroup of $2\times 2$ matrices over $\mathbb{Q}$. For a semigroup $M$, the rational subsets $\mathrm{Rat}(M)$ are defined as the sets accepted by NFAs whose transitions are…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.