English
Related papers

Related papers: Galois ring isomorphism problem

200 papers

Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…

Number Theory · Mathematics 2012-05-25 Alexander Lubotzky , Lior Rosenzweig

We develop Hopf-Galois theory for weak Hopf algebras, and recover analogs of classical results for Hopf algebras. Our methods are based on the recently introduced Galois theory for corings. We focus on the situatation where the weak Hopf…

Rings and Algebras · Mathematics 2007-05-23 S. Caenepeel , E. De Groot

We characterize finite Galois extensions $K$ of the field of rational numbers in terms of the rings ${\rm Int}_{\mathbb{Q}}(\mathcal O_K)$, recently introduced by Loper and Werner, consisting of those polynomials which have coefficients in…

Number Theory · Mathematics 2018-09-26 Bahar Heidaryan , Matteo Longo , Giulio Peruginelli

We study Galois embedding problems arising from the 3-torsion of elliptic curves defined over $\mathbb{Q}$, extending the correspondence to all possible images of mod 3 Galois representations; namely,…

Number Theory · Mathematics 2026-05-14 José-A. Gálvez , Joan-C. Lario

In this article, we consider the inverse Galois problem for parameterized differential equations over k((t))(x) with k any field of characteristic zero and use the method of patching over fields due to Harbater and Hartmann. As an…

Commutative Algebra · Mathematics 2015-10-29 Annette Maier

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Group Theory · Mathematics 2026-03-10 Saveliy V. Skresanov

Work of Jean Renault shows that, for topologically principal \'etale groupoids, a diagonal-preserving isomorphism of reduced $C^*$-algebras yields an isomorphism of groupoids. Several authors have proved analogues of this result for ample…

Rings and Algebras · Mathematics 2017-12-19 Benjamin Steinberg

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…

Rings and Algebras · Mathematics 2016-09-07 Steve Seif , Zeljko Sokolovic , Csaba Szabo

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

Symbolic Computation · Computer Science 2016-08-11 Jérémy Berthomieu , Jean-Charles Faugère , Ludovic Perret

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

Cryptography and Security · Computer Science 2017-02-15 Ramón Flores , Delaram Kahrobaei

In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…

Number Theory · Mathematics 2018-06-01 Ekaterina Yurova Axelsson , Andrei Khrennikov

We create plots of algebraic integers in the complex plane, exploring the effect of sizing the integers according to various arithmetic invariants. We focus on Galois theoretic invariants, in particular creating plots which emphasize…

Number Theory · Mathematics 2022-02-24 Gabriel Dorfsman-Hopkins , Shuchang Xu

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

Combinatorics · Mathematics 2007-05-23 Rashit T. Faizullin , Alexander V. Prolubnikov

Let $K$ be a number field and $\mathcal{C}$ a full class of finite groups. We write $K^{\mathcal{C}}/K$ for the maximal pro-$\mathcal{C}$ Galois extension of $K$, and $G_K^{\mathcal{C}}$ for its Galois group. In this paper, we deal with the…

Number Theory · Mathematics 2023-03-07 Ryoji Shimizu

Greaves et al. (2022) extended frames over real or complex numbers to frames over finite fields. In this paper, we study the theory of frames over finite fields by incorporating the Galois inner products introduced by Fan and Zhang (2017),…

Information Theory · Computer Science 2025-07-22 Junmin An , Jon-Lark Kim

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

Number Theory · Mathematics 2020-08-18 Andrei S. Rapinchuk , Igor A. Rapinchuk

Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it…

Data Structures and Algorithms · Computer Science 2015-04-14 Marek Cygan , Jakub Pachocki , Arkadiusz Socała

Suppose O is a complete discrete valuation ring of positive characteristic with perfect residue field. The category of finite flat strict modules was introduced recently by Faltings and appears as an equal characteristic analogue of the…

Number Theory · Mathematics 2007-05-23 Victor Abrashkin

We show that any Lambda-ring, in the sense of Riemann-Roch theory, which is finite etale over the rational numbers and has an integral model as a Lambda-ring is contained in a product of cyclotomic fields. In fact, we show that the category…

K-Theory and Homology · Mathematics 2008-01-16 James Borger , Bart de Smit

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…

Number Theory · Mathematics 2018-12-12 Ilya Mironov , Anton Mityagin , Kobbi Nissim