Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Das, Madhuparna"'
Let $\mathbb{P}$ denote the set of primes and $\mathcal{N}\subset \mathbb{N}$ be a set with arbitrary weights attached to its elements. Set $\mathfrak{p}_{\mathcal{N}}(n)$ to be the restricted partition function which counts partitions of $n$ with al
Externí odkaz:
http://arxiv.org/abs/2212.12489
Autor:
Das, Madhuparna
We give a simple proof of Selberg's central limit theorem for Dirichlet $L$-functions for $q$-aspect by following the method established by Radiwi\l\l\space and Soundararajan.
Comment: Propositions 3 and 4 are incorrect, and so is their proof. T
Comment: Propositions 3 and 4 are incorrect, and so is their proof. T
Externí odkaz:
http://arxiv.org/abs/2105.01251
Autor:
Das, Madhuparna
In this paper, we have proved Selberg's Central Limit Theorem for $GL(3)$ $L$-functions associated with the Hecke-Maass cusp form $f$. Moreover, we have proved the independence of the automorphic $L$-functions.
Comment: Propositions 3 and 4 are
Comment: Propositions 3 and 4 are
Externí odkaz:
http://arxiv.org/abs/2101.02283
Autor:
Das, Madhuparna
We present a proof of Selberg's Central Limit Theorem for automorphic $L$-functions of degree 2 using Radziwi\l\l\space and Soundararajan's method. Additionally, we prove the independence of the automorphic $L$-functions associated with the sequence
Externí odkaz:
http://arxiv.org/abs/2012.10766
Autor:
Das, Madhuparna
In this article, we have surveyed the result of Ze\'ev Rudnick and Peter Sarnak on the Zeros of principal L-function and Random Matrix Theory
Externí odkaz:
http://arxiv.org/abs/2002.00595
Autor:
Das, Madhuparna
The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the answer is `N
Externí odkaz:
http://arxiv.org/abs/1908.10392
Autor:
Das, Madhuparna
In this paper, we have developed an algorithm for the prime searching in $\mathbb{R}^3$. This problem was proposed by M. Das [Arxiv,2019]. This paper is an extension of her work. As we know the distribution of primes will get more irregular as we are
Externí odkaz:
http://arxiv.org/abs/1901.10016
Autor:
Das, Madhuparna
Bertrand's Postulate states about the prime distribution for the real numbers. The generalization of Bertrand's Postulate was proved by Das et al. [Arxiv 2018]. In this paper, we have formalized this idea for the Gaussian primes (or the primes on the
Externí odkaz:
http://arxiv.org/abs/1901.07086
Autor:
Das, Madhuparna
The Gaussian Moat problem asks whether one can walk to infinity in the Gaussian integers using the Gaussian primes as stepping stones and taking bounded length steps or not. In this paper, we have analyzed the Gaussian primes and also developed an al
Externí odkaz:
http://arxiv.org/abs/1901.04549
Autor:
Das, Madhuparna, Paul, Goutam
We theoretically analyze the popular mobile app game `2048' for the first time in $n$-dimensional space. We show that one can reach the maximum value $2^{n_1n_2+1}$ and $2^{\left({\prod_{i=1}^{d} n_i}\right)+1}$ for the two dimensional $n_1\times n_2
Externí odkaz:
http://arxiv.org/abs/1804.07393