English
Related papers

Related papers: An algorithm to compute Selmer groups via resoluti…

200 papers

As well known that it is no way to do the abstract harmonic analysis on the non connected Lie groups. The goal of this paper is to draw the attention of Mathematicians to solve this problem. therefore let R be the group of nonzero real…

Mathematical Physics · Physics 2016-06-13 Kahar El-Hussein

The standard approach to evaluate Hecke eigenvalues of a Siegel modular eigenform F is to determine a large number of Fourier coefficients of F and then compute the Hecke action on those coefficients. We present a new method based on the…

Number Theory · Mathematics 2019-02-13 Owen Colman , Alexandru Ghitza , Nathan C. Ryan

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

Number Theory · Mathematics 2018-02-19 Andreas-Stephan Elsenhans , Jürgen Klüners

In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…

Number Theory · Mathematics 2018-10-30 Alexandre Gélin

In this paper, we explicitly compute the semisimplifications of all Jacquet modules of irreducible representations with generic L-parameters of p-adic split odd special orthogonal groups or symplectic groups. Our computation represents them…

Representation Theory · Mathematics 2018-12-18 Hiraku Atobe

We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…

Number Theory · Mathematics 2014-09-19 Martin Raum

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

Data Structures and Algorithms · Computer Science 2014-12-02 David J. Rosenbaum

We suggest a simple definition for categorification of modules over rings and illustrate it by categorifying integral Specht modules over the symmetric group and its Hecke algebra via the action of translation functors on some subcategories…

Representation Theory · Mathematics 2008-03-06 Mikhail Khovanov , Volodymyr Mazorchuk , Catharina Stroppel

The goal of this paper is to develop a group-theoretic algorithm, to reconstruct a number field (together with its maximal m-step solvable ex- tension for some positive integer m \geq 3) from the maximal m+9-step solv- able quotient of its…

Number Theory · Mathematics 2025-11-10 Yu Mao , Mohamed Saidi

One of the basic questions in number theory is to determine semi-simple l-adic representations of the absolute Galois group of a number field. In this paper, we discuss the question for two dimensional representations over a totally real…

Number Theory · Mathematics 2007-05-23 K. Fujiwara

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…

Algebraic Topology · Mathematics 2022-10-26 Saugata Basu , Negin Karisani

We study the middle convolution of local systems on the punctured affine line in the setting of singular cohomology and in the setting of \'etale cohomology. We derive a formula to compute the topological monodromy of the middle convolution…

Number Theory · Mathematics 2007-05-23 Michael Dettweiler

We study equivariant Hermitian K-theory for representations of symplectic groups, especially $\mathrm{SL}_2$. The results are used to establish an Atiyah-Segal completion theorem for Hermitian $K$-theory and symplectic groups.

K-Theory and Homology · Mathematics 2025-11-05 Jens Hornbostel , Herman Rohrbach , Marcus Zibrowius

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

Group Theory · Mathematics 2019-12-06 Francis Buekenhout , Dimitri Leemans , Philippe Tranchida

The regular subgroup determining an induced Hopf Galois structure for a Galois extension $L/K$ is obtained as the direct product of the corresponding regular groups of the inducing subextensions. We describe here the associated Hopf algebra…

Number Theory · Mathematics 2022-02-22 Daniel Gil-Muñoz , Anna Rio

A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…

General Relativity and Quantum Cosmology · Physics 2009-10-28 E. S. Cheb-Terrab , L. G. S. Duarte , L. A. C. P. da Mota

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

Algebraic Geometry · Mathematics 2007-05-23 Saugata Basu

We raise the question of the realizability of permutation modules in the context of Kahn's realizability problem for abstract groups and the $G$-Moore space problem. Specifically, given a finite group $G$, we consider a collection…

Algebraic Topology · Mathematics 2024-02-14 Cristina Costoya , Rafael Gomes , Antonio Viruel

Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…

Number Theory · Mathematics 2008-05-16 Anton Deitmar

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

Group Theory · Mathematics 2026-05-25 A. S. Detinko , D. L. Flannery , A. Hulpke
‹ Prev 1 8 9 10 Next ›