相关论文: Quotients of polynomial rings and regular t-balanc…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
This paper investigates the structure of $K_2$-groups for certain quotient rings of the integral group ring $\mathbb{Z}[G]$. Let $G$ be a finite abelian $p$-group with $p$-rank $r$, let $\Gamma$ be the maximal $\mathbb{Z}$-order of…
Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…
In this paper, we study cohomology rings and cohomological pairings over Abelian symplectic quotients of special Hamiltonian tori manifolds. The Hamiltonian group actions appear in quantum information theory where the tori are maximal tori…
We investigate monomial labellings on cell complexes, giving a minimal cellular resolution of the ideal generated by these monomials, and such that the associated quotient ring is Cohen-Macaulay. We introduce a notion of such a labelling…
We study an integration theory in circle equivariant cohomology in order to prove a theorem relating the cohomology ring of a hyperkahler quotient to the cohomology ring of the quotient by a maximal abelian subgroup, analogous to a theorem…
We study clean group rings and also the group rings whose every element is a sum of two units. We also prove that if R is an Abelian exchange ring and G is a locally finite group, then the group ring RG has stable range one.
We give a proof, using so-called fusion rings and q-deformations of Brauer algebras that the representation ring of an orthogonal or symplectic group can be obtained as a quotient of a ring Gr(O(\infinity)). This is obtained here as a…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
Cayley maps are combinatorial structures built upon Cayley graphs on a group. As such the original group embeds in their group of automorphisms, and one can ask in which situation the two coincide (one then calls the Cayley map a mapical…
This paper studies the quotient geometry of bounded or fixed-rank correlation matrices. We establish a bijection between the set of bounded-rank correlation matrices and a quotient set of a spherical product manifold by an orthogonal group.…
Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…
We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…
It is shown that every abelian regular Lie group is a quotient of its Lie algebra via the exponential mapping.
A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The \textit{mixed Cayley graph} $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and…
By using the links between generalized roundness, negative type inequalities and equivariant Hilbert space compressions, we obtain that the generalized roundness of the usual Cayley graph of finitely generated free groups and free abelian…
In this paper, we study the Bergman metric of a finite ball quotient $\mathbb{B}^n/\Gamma$, where $\Gamma \subseteq \mathrm{Aut}(\mathbb{B}^n)$ is a finite, fixed point free, abelian group. We prove that this metric is K\"ahler--Einstein if…
The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…