中文
相关论文

相关论文: Factoring Hecke polynomials modulo a prime

200 篇论文

Given a monoid $H$ (written multiplicatively), the family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all non-empty finite subsets of $H$ containing the identity element $1_H$ is itself a monoid, called the reduced finitary power monoid of $H$,…

环与代数 · 数学 2025-09-09 Laura Cossu , Salvatore Tringali

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

表示论 · 数学 2010-12-03 Jinkui Wan

We define Hilbert-Siegel modular forms and Hecke "operators" acting on them. As with Hilbert modular forms, these linear transformations are not linear operators until we consider a direct product of spaces of modular forms (with varying…

数论 · 数学 2007-10-24 Suzanne Caulk , Lynne H. Walling

We define an exact functor $F_{n,k}$ from the category of Harish-Chandra modules for $GL(n,R)$ to the category of finite-dimensional representations for the degenerate affine Hecke algebra for $gl(k)$. Under certain natural hypotheses, we…

表示论 · 数学 2009-03-06 Dan Ciubotaru , Peter E. Trapa

We show that the systems of prime-to-$p$ Hecke eigenvalues arising from automorphic forms$\pmod p$ for a good prime $p$ associated to an algebraic group $G/\mathbb Q$ of Hodge type are the same as those arising from algebraic modular…

数论 · 数学 2021-05-18 Yasuhiro Terakado , Chia-Fu Yu

We study the case of Hermite subdivision operators satisfying a spectral condition of order greater than their size. We show that this can be characterized by operator factorizations involving Taylor operators and difference factorizations…

数值分析 · 数学 2020-06-23 Caroline Moosmüller , Tomas Sauer

The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…

符号计算 · 计算机科学 2026-04-30 Raphaël Pagès

We show that the systems of Hecke eigenvalues occurring in the spaces of Siegel modular forms (mod p) of fixed dimension g, fixed level N, and varying weight, are the same as the systems occurring in the spaces of Siegel cusp forms with the…

数论 · 数学 2007-05-23 Alexandru Ghitza

We define Hecke operators on vector valued modular forms transforming with the Weil representation associated to a discriminant form. We describe the properties of the corresponding algebra of Hecke operators and study the action on modular…

数论 · 数学 2007-05-23 Jan H. Bruinier , Oliver Stein

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

数论 · 数学 2008-10-31 Jordi Guardia , Jesus Montes , Enric Nart

Let p be a prime number. We classify all smooth irreducible mod-p representations of the unramified unitary group U(1,1)(Q_p^2/Q_p) in two variables. We then investigate Langlands parameters in characteristic p associated to…

表示论 · 数学 2015-12-11 Karol Koziol

Applying Baxter's method of the Q-operator to the set of Sekiguchi's commuting partial differential operators we show that Jack polynomials P(x_1,...,x_n) are eigenfunctions of a one-parameter family of integral operators Q_z. The operators…

经典分析与常微分方程 · 数学 2015-11-13 Vadim B. Kuznetsov , Vladimir V. Mangazeev , Evgeny K. Sklyanin

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

数论 · 数学 2007-05-23 Zhi-Wei Sun

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

符号计算 · 计算机科学 2024-09-17 James H. Davenport

We introduce a new deterministic factoring algorithm, which could be described in the cryptographically fashionable term of "factoring with hints": we show that, given the knowledge of the factorisations of $O(N^{1/3+\epsilon})$ terms…

数论 · 数学 2017-08-09 Francesco Sica

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

交换代数 · 数学 2018-10-03 Giulio Peruginelli

We investigate the distribution of $\alpha p$ modulo one in quadratic number fields $\mathbb{K}$ with class number one, where $p$ is restricted to prime elements in the ring of integers of $\mathbb{K}$. Here we improve the relevant exponent…

数论 · 数学 2023-08-28 Stephan Baier , Dwaipayan Mazumder , Marc Technau

Many known models, which generally use a factorization hypothesis, give a poor account of the decays B into J/psi + K(*). Usually there is a free overall factor, which is fit to the data, so that tests of the models rely upon ratios. The…

高能物理 - 唯象学 · 物理学 2009-09-25 Carl E. Carlson , J. Milana

A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…

离散数学 · 计算机科学 2016-02-23 Charles Sauerbier
‹ 上一页 1 8 9 10 下一页 ›