On finite embedding problems with abelian kernels
نویسندگان
چکیده
Given a Hilbertian field k and finite set S of Krull valuations , we show that every split embedding problem G → Gal ( L / ) over with abelian kernel has solution F such v ∈ is totally in . Two applications are then given. Firstly, solve non-constant variant the Beckmann–Black for solvable groups: given non-trivial group Galois extension shown to occur as specialization at some t 0 E T ⊈ ‾ Secondly, contribute inverse theory division rings, by showing that, ring H automorphism σ order, all semiabelian groups skew fractions twisted polynomial [ ]
منابع مشابه
Matrix embedding in finite abelian group
Matrix embedding (ME) is a well-known steganographic scheme that can improve the embedding efficiency of steganography. In ME, the sender and recipient agree on a matrix in advance, and the message will be embedded into the cover data according to the matrix. In this paper, we propose a general framework for ME based on covering sequence (CS) of finite abelian group. By the proposed approach, t...
متن کاملEmbedding Problems and Finite Quotients
We give a condition on a family of solutions of quotients of an embedding problem which implies the embedding problem has a solution. This shows, in particular, that to solve an embedding problem associated to the maximal extension of a number field unramified outside a fixed finite set of places, it suffices to find a solution for each finite quotient of the embedding problem. This statement i...
متن کاملOn some computational problems in finite abelian groups
We present new algorithms for computing orders of elements, discrete logarithms, and structures of finite abelian groups. We estimate the computational complexity and storage requirements, and we explicitly determine the O-constants and Ω-constants. We implemented the algorithms for class groups of imaginary quadratic orders and present a selection of our experimental results. Our algorithms ar...
متن کاملFinite p-groups with few non-linear irreducible character kernels
Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملBinary Embedding with Additive Homogeneous Kernels
Binary embedding transforms vectors in Euclidean space into the vertices of Hamming space such that Hamming distance between binary codes reflects a particular distance metric. In machine learning, the similarity metrics induced by Mercer kernels are frequently used, leading to the development of binary embedding with Mercer kernels (BE-MK) where the approximate nearest neighbor search is perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2021.12.026