中文
相关论文

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

200 篇论文

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

数论 · 数学 2017-07-11 Doyon Kim

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

数论 · 数学 2013-06-21 Prapanpong Pongsriiam

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

群论 · 数学 2007-05-23 Ganna Kudryavtseva

We present an optimization procedure for a seminal class of positive maps $\tau_{n,k}$ in the algebra of $n \times n$ complex matrices introduced and studied by Tanahasi and Tomiyama, Ando, Nakamura and Osaka. Recently, these maps were…

量子物理 · 物理学 2023-09-19 Anindita Bera , Gniewomir Sarbicki , Dariusz Chruściński

In this paper we included some basic properties for weighted greatest common divisors, and discuss how to speed up computing the weighted greatest common divisor. By ordering the 'weights' we are able to significantly shorten the operations…

综合数学 · 数学 2023-01-24 Orgest Zaka

In this paper, we study the eigenvalues of the GCD matrix $(S_n)$ and the LCM matrix $[S_n]$ defined on $S_n=\{1,2,\ldots,n\}$. We present upper and lower bounds for the smallest and the largest eigenvalues of $(S_n)$ and $[S_n]$ in terms…

数论 · 数学 2014-08-15 Ercan Altınışık , Şerife Büyükköse

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

组合数学 · 数学 2019-05-28 Ramesh Prasad Panda , Kamal Lochan Patra , Binod Kumar Sahoo

We study the number of ways of factoring elements in the complex reflection groups G(r,s,n) as products of reflections. We prove a result that compares factorization numbers in G(r,s,n) to those in the symmetric group on n letters, and we…

群论 · 数学 2021-11-30 Elzbieta Polak , Dustin Ross

This research introduces a gcd-pair in $\mathbb{Z}_n$ which is an unordered pair $\{[a]_n, [b]_n\}$ of elements in $ \mathbb{Z}_n $ such that $0\leq a,b < n$ and the greatest common divisor $\gcd(a,b)$ divides $ n $. The properties of…

组合数学 · 数学 2022-06-07 Wanchai Tapanyo , Tanyaton Tongpikul , Suphansa Kaewpradit

A $(v,k,\lambda)$ difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring $\mathbb{Z}[G]$ satisfies $$D D^{-1} = n + \lambda G,$$ where $n=k-\lambda$. If $D=\sum s_i…

组合数学 · 数学 2022-12-22 Daniel M. Gordon

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log…

数论 · 数学 2021-04-29 Jon Grantham

Given an $n\times n$ matrix $c$ over a unitary ring $R$, the centralizer of $c$ in the full $n\times n$ matrix ring $M_n(R)$ is called a principal centralizer matrix ring, denoted by $S_n(c,R)$. We investigate its structure and prove: $(1)$…

表示论 · 数学 2021-06-22 Changchang Xi , Jinbi Zhang

Here we consider the set $\Sigma_S$ of roots of power series whose coefficients lie in a given set $S$ and how such sets of roots vary as the set $S$ varies. We give an estimate of the depth that complex roots can reach into the disc, offer…

动力系统 · 数学 2025-05-27 Jacob Kewarth

We construct a categorification of the modular data associated with every family of unipotent characters of the spetsial complex reflection group $G(d,1,n)$. The construction of the category follows the decomposition of the Fourier matrix…

量子代数 · 数学 2023-10-04 Abel Lacabanne

In this paper we deal with the problem of computing the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ with $d>1$ and $R$ a finite commutative ring. We completely solve the problem in the case…

环与代数 · 数学 2015-06-01 P. Fortuny , J. M. Grau , A. M. Oller-Marcén , I. F. Rúa

Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…

计算复杂性 · 计算机科学 2014-02-25 Joachim von zur Gathen , Igor E. Shparlinski

Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, omega^dagger H, and S. All of these gates have matrix entries in the ring Z[1/2,i], the smallest subring of the complex numbers containing 1/2 and i.…

量子物理 · 物理学 2021-09-14 Xiaoning Bian , Peter Selinger

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

数论 · 数学 2014-02-03 Li-meng Xia , Caixia Shen

We determine the order of magnitude of H^{(k+1)}(x,\vec{y},2\vec{y}), the number of integers up to x that are divisible by a product d_1...d_k with y_i<d_i\le 2y_i, when the numbers \log y_1,...,\log y_k have the same order of magnitude and…

数论 · 数学 2013-05-29 Dimitris Koukoulopoulos

Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…

计算机科学中的逻辑 · 计算机科学 2025-07-09 Antoine Chambert-Loir , María Inés de Frutos-Fernández