Lower Bounds for Essential Dimensions in Characteristic 2 via Orthogonal Representations
نویسنده
چکیده
We give a lower bound for the essential dimension of a split simple algebraic group of “adjoint” type over a field of characteristic 2. We also compute the essential dimension of orthogonal and special orthogonal groups in characteristic 2.
منابع مشابه
Strong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملLower bounds for essential dimensions via orthogonal representations
Let us first recall what is the essential dimension of a functor, cf. [BR 97] and [R 00]. Let k be a field, and let F be a functor from the category of field extensions of k into the category of sets. Let F/k be an extension and let ξ be an element of F(F ). If E is a field with k ⊂ E ⊂ F we say that ξ comes from E if it belongs to the image of F(E) → F(F ). The essential dimension ed (ξ) of ξ ...
متن کاملBuckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملNew construction of mutually unbiased bases in square dimensions
We show that k = w + 2 mutually unbiased bases can be constructed in any square dimension d = s provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k, s)-nets (which can be constructed from w mutually orthogonal Latin squares of order s and vice versa) and generalized Hadamard matrices of size s. Using known lower bound...
متن کاملA Better Heuristic for Orthogonal Graph Drawings
16 We end this paper by mentioning some open problems and directions for further research: Valiant proved that a grid-area of (n 2) is necessary for drawing non-planar graphs, since the crossing number can be (n 2) 26]. However, the involved constants are very small. For planar graphs (crossing number 0) a drawing with grid-area O(n log 2 n) is possible 14, 26], and the best known lower bound i...
متن کامل