Related papers: Matrix semigroups with constant spectral radius
The authors [3] proved that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and described its monolith. Here we prove that the endomorphism semiring of a commutative inverse semigroup with at least…
We study the restriction to the symmetric group, $\mc{S}_n$ of the adjoint representation of $\mt{GL}_n(\C)$. We determine the irreducible constituents of the space of symmetric as well as the space of skew-symmetric $n\times n$ matrices as…
We study the existence of invariant quadrics for a class of systems of difference equations in ${\mathbb R}^n$ defined by linear fractionals sharing denominator. Such systems can be described in terms of some square matrix $A$ and we prove…
The work of Reid, Chinburg--Hamilton--Long--Reid, Prasad--Rapinchuk, and the author with Reid have demonstrated that geodesics or totally geodesic submanifolds can sometimes be used to determine the commensurability class of an arithmetic…
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…
Let ${\cal M}(S; \Lambda; P)$ denote a Rees $I\times \Lambda$ matrix semigroup without zero over a semigroup $S$, where $I$ is a singleton. If $\theta _S$ denotes the kernel of the right regular representation of a semigroup $S$, then a…
The low-lying spectra of atomic nuclei display diverse behaviors, for example rotational bands, which can be described phenomenologically by simple symmetry groups such as spatial SU(3). This leads to the idea of dynamical symmetry, where…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
The complex representation rings of finite groups are the fundamental class of fusion rings, categorified by the corresponding fusion categories of complex representations. The category of $\mathbb{Z}_+$-modules of finite rank over such a…
We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…
We classify the irreducible unitary modules in category O for the rational Cherednik algebras of type G(r,1,n) and give explicit combinatorial formulas for their graded characters. More precisely, we produce a combinatorial algorithm…
We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…
We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
In this study, we define a brief description of the hyperbolic and elliptic rotational surfaces using a curve and matrices in 4-dimensional semi Euclidean space. That is, we provide different types of rotational matrices, which are the…