On the notion of essential dimension for algebraic groups

2000 ◽  
Vol 5 (3) ◽  
pp. 265-304 ◽  
Author(s):  
Z. Reichstein
Keyword(s):  
Algebraic Groups ◽  
Essential Dimension

scholarly journals A fiber dimension theorem for essential and canonical dimension

2012 ◽  
Vol 149 (1) ◽  
pp. 148-174 ◽  
Author(s):  
Roland Lötscher
Keyword(s):  
Algebraic Geometry ◽  
Lower Bound ◽  
Finite Type ◽  
Algebraic Groups ◽  
General Version ◽  
Essential Dimension ◽  
Algebraic Stacks ◽  
Algebraic Tori ◽  
Canonical Dimension

AbstractThe well-known fiber dimension theorem in algebraic geometry says that for every morphism f:X→Y of integral schemes of finite type the dimension of every fiber of f is at least dim X−dim Y. This has recently been generalized by Brosnan, Reichstein and Vistoli to certain morphisms of algebraic stacks f:𝒳→𝒴, where the usual dimension is replaced by essential dimension. We will prove a general version for morphisms of categories fibered in groupoids. Moreover, we will prove a variant of this theorem, where essential dimension and canonical dimension are linked. These results let us relate essential dimension to canonical dimension of algebraic groups. In particular, using the recent computation of the essential dimension of algebraic tori by MacDonald, Meyer, Reichstein and the author, we establish a lower bound on the canonical dimension of algebraic tori.

scholarly journals Essential dimension of algebraic groups, including bad characteristic

2016 ◽  
Vol 107 (2) ◽  
pp. 101-119 ◽  
Author(s):  
Skip Garibaldi ◽  
Robert M. Guralnick
Keyword(s):  
Algebraic Groups ◽  
Essential Dimension

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.

Sign in / Sign up

Export Citation Format

Share Document