相关论文: Factorization of power GCD matrices and power LCM …

For positive integers $u$ and $v$, let $L_u=\begin{bmatrix}1 & 0 \\u&1\end{bmatrix}$ and $R_v=\begin{bmatrix}1 & v \\ 0 & 1\end{bmatrix}$. Let $G_{u,v}$ be the group generated by $L_u$ and $R_v$. In a previous paper, the authors determined…

This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…

The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…

In the first chapter, we will present a computation of the square value of the module of L functions associated to a Dirichlet character. This computation suggests to ask if a certain ring of arithmetic multiplicative functions exists and…

Let $G$ be a periodic group, and let $LCM(G)$ be the set of all $x\in G$ such that $o(x^nz)$ divides the least common multiple of $o(x^n)$ and $o(z)$ for all $z$ in $G$ and all integers $n$. In this paper, we prove that the subgroup…

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$, in which two distinct vertices are adjacent if one of them is a power of the other. For an integer $n\geq 2$, let $C_n$ denote the cyclic group…

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

Let $n$ and $s$ be fixed integers such that $n\geq 2$ and $1\leq s\leq \frac{n}{2}$. Let $M_n(\mathbb{K})$ be the ring of all $n\times n$ matrices over a field $\mathbb{K}$. If a map $\delta:M_n(\mathbb{K})\rightarrow M_n(\mathbb{K})$…

Let A=(a_(ij)) be the generic n by n circulant matrix given by a_(ij)=x_(i+j), with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is…

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

Word maps have been studied for matrix groups over a field. We initiate the study of problems related to word maps in the context of the group $\mathrm{GL}_n(\mathscr O_2)$, where $\mathscr O_2$ is a finite local principal ideal ring of…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

For each finite subgroup G of SL(n, C), we introduce the generalized Cartan matrix C_{G} in view of McKay correspondence from the fusion rule of its natural representation. Using group theory, we show that the generalized Cartan matrices…

We study the non-linear extension of integer programming with greatest common divisor constraints of the form $\gcd(f,g) \sim d$, where $f$ and $g$ are linear polynomials, $d$ is a positive integer, and $\sim$ is a relation among $\leq, =,…

We study the set of generalized principal $\mathfrak{g}$-logarithms of any matrix belonging to a connected SVD-closed subgroup $G$ of $U_n$, with Lie algebra $\mathfrak{g}$. This set is a non-empty disjoint union of a finite number of…

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…