English
Related papers

Related papers: Some necessary conditions for compatibility of gro…

200 papers

We propose to construct the finite modular groups from the quotient of two principal congruence subgroups as $\Gamma(N')/\Gamma(N")$, and the modular group $SL(2,\mathbb{Z})$ is extended to a principal congruence subgroup $\Gamma(N')$. The…

High Energy Physics - Phenomenology · Physics 2021-11-17 Cai-Chang Li , Xiang-Gan Liu , Gui-Jun Ding

In this paper we show that for a connected compact Lie group to be acceptable it is necessary and sufficient that its derived subgroup is isomorphic to a direct product of the groups $\SU(n)$, $\Sp(n)$, $\SO(2n+1)$, $\G_2$, $\SO(4)$. We…

Group Theory · Mathematics 2021-08-26 Jun Yu

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Group Theory · Mathematics 2007-05-23 Martin R. Bridson

A combinatorial group-theoretic hypothesis is presented that serves as a necessary and sufficient condition for a union of connected Cockcroft two-complexes to be Cockcroft. This hypothesis has a component that can be expressed in terms of…

Group Theory · Mathematics 2009-09-25 William A. Bogley

We show how the condition of isochronicity can be studied for two dimensional systems in the renormalization group (RG) context. We find a necessary condition for the isochronicity of the Cherkas and another class of cubic systems. Our…

Chaotic Dynamics · Physics 2015-05-30 Amartya Sarkar , J. K. Bhattacharjee

We prove spectral analogues of the classical strong multiplicity one theorem for newforms. Let $\Gamma_1$ and $\Gamma_2$ be uniform lattices in a semisimple group $G$. Suppose all but finitely many irreducible unitary representations (resp.…

Representation Theory · Mathematics 2010-09-06 Chandrasheel Bhagwat , C. S. Rajan

We study the probability of a given element, in the commutator subgroup of a group, to be equal to a commutator of two randomly chosen group elements, and compute explicit formulas for calculating this probability for some interesting…

Group Theory · Mathematics 2018-07-10 Rajat K. Nath , Manoj K. Yadav

A pair $(C, D)$ of group codes over group algebra $R[G]$ is called a linear complementary pair (LCP) if $C \oplus D =R[G]$, where $R$ is a finite principal ideal ring, and $G$ is a finite group. We provide a necessary and sufficient…

Information Theory · Computer Science 2020-12-25 Hualu Liu , Xiusheng Liu

Suppose that $G$ is a finite group and $H$ is a nilpotent subgroup of $G$. If a character of $H$ induces an irreducible character of $G$, then the generalized Fitting subgroup of $G$ is nilpotent.

Representation Theory · Mathematics 2019-02-27 Zoltan Halasi , Attila Maroti , Gabriel Navarro , Pham Huu Tiep

We determine the number of elements of order two in the group of normalized units V(F_2G) of the group algebra F_2G of a 2-group of maximal class over the field F_2 of two elements. As a consequence for the 2-groups G and H of maximal class…

Rings and Algebras · Mathematics 2007-05-23 Zs. Balogh , A. Bovdi

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

Group Theory · Mathematics 2007-05-23 Roger Alperin , Benson Farb

Given a submonoid $H$ of $\mathbb N^k$, we give some characterizations of the minimum $r\in \mathbb N^+$ such that $H$ is isomorphic to a submonoid of $\mathbb N^r$. In the context of submonoids of $\mathbb N$, we prove that if two…

Commutative Algebra · Mathematics 2019-01-11 Jerson Borja

Let $R$ be a ring, let $G$ be an amenable group and let $R\ast G$ be a crossed product. The goal of this paper is to construct, starting with a suitable additive function $L$ on the category of left modules over $R$, an additive function on…

Rings and Algebras · Mathematics 2017-10-24 Simone Virili

We prove that a connected 2-dimensional orbifold with finitely generated and infinite orbifold fundamental group is good. We also describe all the good 2-dimensional orbifolds with finite orbifold fundamental groups

Geometric Topology · Mathematics 2020-05-25 S K Roushon

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Computational Complexity · Computer Science 2020-10-23 Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski , Armin Weiß

Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a…

Logic · Mathematics 2025-11-20 Atticus Stonestrom

We determine under which conditions three bivariate copulas are compatible, viz. they are the bivariate marginals of the same trivariate copula, and, then, construct the class of these copulas. In particular, the upper and lower bounds for…

Statistics Theory · Mathematics 2009-03-22 Fabrizio Durante , Erich Peter Klement , José Juan Quesada-Molina

The aim of this paper is to give a condition to topological conjugacy of invariant flows in an Lie group $G$ which its Lie algebra $\mathfrak{g}$ is associative algebra or semisimple. In fact, we show that if two dynamical system on $G$ are…

Dynamical Systems · Mathematics 2016-07-12 Alexandre J. Santana , Simão N. Stelmastchuk

A finite group $G$ is said to satisfy $C_\pi$ for a set of primes $\pi$, if $G$ possesses exactly one class of conjugate $\pi$-Hall subgroups. In the paper we obtain a criterion for a finite group $G$ to satisfy $C_\pi$ in terms of a normal…

Group Theory · Mathematics 2010-08-17 D. O. Revin , E. P. Vdovin

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…