Algebraic groups with a distinguished conjugacy class

1995 ◽  
Vol 7 (7) ◽  
Author(s):  
Maria Rosaria Enea
Keyword(s):  
Conjugacy Class ◽  
Algebraic Groups

scholarly journals CONJUGACY OF CARTER SUBGROUPS IN GROUPS OF FINITE MORLEY RANK

2008 ◽  
Vol 08 (01) ◽  
pp. 41-92 ◽  
Author(s):  
OLIVIER FRÉCON
Keyword(s):  
Conjugacy Class ◽  
Algebraic Groups ◽  
Simple Groups ◽  
Morley Rank ◽  
Minimal Counterexample ◽  
Finite Morley Rank ◽  
Cartan Subgroups

The Cherlin–Zil'ber Conjecture states that all simple groups of finite Morley rank are algebraic. We prove that any minimal counterexample to this conjecture has a unique conjugacy class of Carter subgroups, which are analogous to Cartan subgroups in algebraic groups.

PERSPECTIVES OF ELLIPTICAL CRYPTOGRAPHY TO ENSURE THE INTEGRITY AND CONFIDENTIALITY OF INFORMATION

2019 ◽  
Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR
Keyword(s):  
Information Systems ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Computational Efficiency ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Algebraic Groups ◽  
Schnorr Signature ◽  
Stability Of Algorithms

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.

Cohomology of Arithmetic Subgroups of Algebraic Groups: II

1968 ◽  
Vol 87 (2) ◽  
pp. 279 ◽  
Author(s):  
M. S. Raghunathan
Keyword(s):  
Algebraic Groups

scholarly journals An Algebraic Brascamp–Lieb Inequality

2021 ◽  
Author(s):  
Jennifer Duncan
Keyword(s):  
General Class ◽  
Recent Progress ◽  
Algebraic Groups ◽  
Hölder’S Inequality ◽  
Duke Math ◽  
Rational Maps ◽  
Affine Invariant ◽  
Linear Maps ◽  
Nonlinear Maps ◽  
Funct Anal

AbstractThe Brascamp–Lieb inequalities are a very general class of classical multilinear inequalities, well-known examples of which being Hölder’s inequality, Young’s convolution inequality, and the Loomis–Whitney inequality. Conventionally, a Brascamp–Lieb inequality is defined as a multilinear Lebesgue bound on the product of the pullbacks of a collection of functions $$f_j\in L^{q_j}(\mathbb {R}^{n_j})$$ f j ∈ L q j ( R n j ) , for $$j=1,\ldots ,m$$ j = 1 , … , m , under some corresponding linear maps $$B_j$$ B j . This regime is now fairly well understood (Bennett et al. in Geom Funct Anal 17(5):1343–1415, 2008), and moving forward there has been interest in nonlinear generalisations, where $$B_j$$ B j is now taken to belong to some suitable class of nonlinear maps. While there has been great recent progress on the question of local nonlinear Brascamp–Lieb inequalities (Bennett et al. in Duke Math J 169(17):3291–3338, 2020), there has been relatively little regarding global results; this paper represents some progress along this line of enquiry. We prove a global nonlinear Brascamp–Lieb inequality for ‘quasialgebraic’ maps, a class that encompasses polynomial and rational maps, as a consequence of the multilinear Kakeya-type inequalities of Zhang and Zorin-Kranich. We incorporate a natural affine-invariant weight that both compensates for local degeneracies and yields a constant with minimal dependence on the underlying maps. We then show that this inequality generalises Young’s convolution inequality on algebraic groups with suboptimal constant.

scholarly journals A NONDEGENERATE EXCHANGE MOVE ALWAYS PRODUCES INFINITELY MANY NONCONJUGATE BRAIDS

2019 ◽  
pp. 1-4
Author(s):  
TETSUYA ITO
Keyword(s):  
Conjugacy Class

We show that if a link $L$ has a closed $n$ -braid representative admitting a nondegenerate exchange move, an exchange move that does not obviously preserve the conjugacy class, $L$ has infinitely many nonconjugate closed $n$ -braid representatives.

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)$ .

Sign in / Sign up

Export Citation Format

Share Document