中文
相关论文

相关论文: Computing polynomials of the Ramanujan $\mathbf{t_…

200 篇论文

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

数论 · 数学 2007-05-23 Shujun Li

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

可精确求解与可积系统 · 物理学 2008-11-26 Andrei A. Kapaev

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…

量子物理 · 物理学 2020-02-27 Iggy van Hoof

In this note, we study the Hilbert-Poincar\'e polynomials for the PBW-graded of simple modules for a simple complex Lie algebra. The computation of their degree can be reduced to modules of fundamental highest weight. We provide these…

表示论 · 数学 2014-10-31 Teodor Backhaus , Lara Bossinger , Christian Desczyk , Ghislain Fourier

In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…

数论 · 数学 2010-03-15 Anthony Flatters

For every prime $p \geq 5$, we compute the $p$-th power of the Ramanujan vector field that arises from the differential relations discovered by Ramanujan for the Eisenstein series $E_2,E_4$ and $E_6$. Our method results in explicit…

数论 · 数学 2026-02-24 Frederico Bianchini

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

数论 · 数学 2017-06-23 Anitha Srinivasan , Pablo Arés

Let $h(-n)$ be the class number of the imaginary quadratic field with discriminant $-n$. We establish an asymtotic formula for correlations involving $h(-n)$ and $h(-n-l)$, over fundamental discriminants that avoid the congruence class…

数论 · 数学 2020-08-07 V. Vinay Kumaraswamy

A formula for the sum of quadratic residues modulus a prime $p=4n-1$ is studied. We relate some terms on this formula with roots of quadratics and provide an exhaustive analysis of new concepts based on these roots. A number of formulas for…

数论 · 数学 2023-01-10 Jorge Garcia

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…

信息论 · 计算机科学 2011-02-11 Jonghoon Ryu , Oscar Y. Takeshita

We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…

数论 · 数学 2020-08-05 Ardavan Afshar

Ramanujan's Master theorem states that, under suitable conditions, the Mellin transform of an alternating power series provides an interpolation formula for the coefficients of this series. Ramanujan applied this theorem to compute several…

经典分析与常微分方程 · 数学 2012-11-02 Gestur Olafsson , Angela Pasquale

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

量子物理 · 物理学 2010-03-19 Daniel M. Kane , Samuel A. Kutin

We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem…

代数几何 · 数学 2010-10-05 Motohico Mulase , Naizhen Zhang

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then there are at least $n$ primes in the interval $(x/2,x]$. For example, Bertrand's postulate is $R_1 = 2$. Ramanujan proved that $R_n$ exists and…

数论 · 数学 2010-10-19 Jonathan Sondow

Ramanujan in his second notebook recorded total of seven $P$--$Q$ modular equations involving theta--function $f(-q)$ with moduli of orders 1, 3, 5 and 15. In this paper, modular equations analogous to those recorded by Ramanujan are…

数论 · 数学 2020-05-12 S. Chandankumar , B. Hemanthkumar

We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$.

数论 · 数学 2007-05-23 Sergei Konyagin , Francesco Pappalardi

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

数论 · 数学 2024-07-09 William Duke

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…

组合数学 · 数学 2007-05-23 Jason Bandlow , Gregg Musiker