Trace-free SL(2, ℂ)-representations of Montesinos links

2018 ◽  
Vol 27 (08) ◽  
pp. 1850050 ◽  
Author(s):  
Haimiao Chen
Keyword(s):  
Representation Formula ◽  
Conjugacy Classes

Given a link [Formula: see text], a representation [Formula: see text] is trace-free if the image of each meridian has trace zero. We determine the conjugacy classes of trace-free representations when [Formula: see text] is a Montesinos link.

On the symmetric Gelfand pair (ℋn ×ℋn−1,diag(ℋn−1))

2020 ◽  
pp. 2150085
Author(s):  
Omar Tout
Keyword(s):  
Representation Formula ◽  
Conjugacy Classes ◽  
Gelfand Pair ◽  
Induced Representation ◽  
Hyperoctahedral Group ◽  
Multiplicity Free

We show that the [Formula: see text]-conjugacy classes of [Formula: see text] where [Formula: see text] is the hyperoctahedral group on [Formula: see text] elements, are indexed by marked bipartitions of [Formula: see text] This will lead us to prove that [Formula: see text] is a symmetric Gelfand pair and that the induced representation [Formula: see text] is multiplicity free.

scholarly journals Groups with boundedly finite conjugacy classes of commutators

2018 ◽  
Vol 69 (3) ◽  
pp. 1047-1051 ◽  
Author(s):  
Gláucia Dierings ◽  
Pavel Shumyatsky
Keyword(s):  
Conjugacy Classes ◽  
Finite Conjugacy

scholarly journals Connected perimeter of planar sets

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
François Dayrens ◽  
Simon Masnou ◽  
Matteo Novaga ◽  
Marco Pozzetta
Keyword(s):  
Minimization Problem ◽  
Existence Of Solutions ◽  
Lower Semicontinuous ◽  
Representation Formula ◽  
Steiner Trees ◽  
Lower Semicontinuous Envelope ◽  
Simply Connected

AbstractWe introduce a notion of connected perimeter for planar sets defined as the lower semicontinuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is also studied. We prove a representation formula which links the connected perimeter, the classical perimeter, and the length of suitable Steiner trees. We also discuss the application of this notion to the existence of solutions to a nonlocal minimization problem with connectedness constraint.

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

scholarly journals Composition Identities of Chebyshev Polynomials, via 2 × 2 Matrix Powers

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 746
Author(s):  
Primo Brandi ◽  
Paolo Emilio Ricci
Keyword(s):  
Chebyshev Polynomials ◽  
Representation Formula ◽  
Complex Matrices ◽  
Lucas Polynomials ◽  
Standard Composition

Starting from a representation formula for 2 × 2 non-singular complex matrices in terms of 2nd kind Chebyshev polynomials, a link is observed between the 1st kind Chebyshev polinomials and traces of matrix powers. Then, the standard composition of matrix powers is used in order to derive composition identities of 2nd and 1st kind Chebyshev polynomials. Before concluding the paper, the possibility to extend this procedure to the multivariate Chebyshev and Lucas polynomials is touched on.

scholarly journals A classification of spherical conjugacy classes

2016 ◽  
Vol 285 (1) ◽  
pp. 63-91
Author(s):  
Mauro Costantini
Keyword(s):  
Conjugacy Classes

A NOTE ON THE NUMBER OF ZEROS IN THE COLUMNS OF THE CHARACTER TABLE OF A GROUP

2012 ◽  
Vol 12 (02) ◽  
pp. 1250150 ◽  
Author(s):  
JINSHAN ZHANG ◽  
ZHENCAI SHEN ◽  
SHULIN WU
Keyword(s):  
Finite Groups ◽  
Irreducible Character ◽  
Conjugacy Classes ◽  
Character Table ◽  
Number Of Zeros

The finite groups in which every irreducible character vanishes on at most three conjugacy classes were characterized [J. Group Theory13 (2010) 799–819]. Dually, we investigate the finite groups whose columns contain a small number of zeros in the character table.

scholarly journals Reality properties of conjugacy classes in algebraic groups

2008 ◽  
Vol 165 (1) ◽  
pp. 1-27 ◽  
Author(s):  
Anupam Singh ◽  
Maneesh Thakur
Keyword(s):  
Algebraic Groups ◽  
Conjugacy Classes
Sign in / Sign up

Export Citation Format

Share Document