Related papers: A Concise Formula for Generalized Two-Qubit Hilber…
The Heisenberg algebra is first deformed with the set of parameters ${q, l, \lambda}$ to generate a new family of generalized coherent states. In this framework, the matrix elements of relevant operators are exactly computed. A proof on…
Gaussian processes are probabilistic models that are commonly used as functional priors in machine learning. Due to their probabilistic nature, they can be used to capture the prior information on the statistics of noise, smoothness of the…
Motivated by the expectation that relativistic symmetries might acquire quantum features in Quantum Gravity, we take the first steps towards a theory of ''Doubly'' Quantum Mechanics, a modification of Quantum Mechanics in which the…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
We give a convergence proof for the approximation by sparse collocation of Hilbert-space-valued functions depending on countably many Gaussian random variables. Such functions appear as solutions of elliptic PDEs with lognormal diffusion…
Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but…
A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres--Horodecki positive partial transpose…
Let $Hilb ^{p(t)}(P^n)$ be the Hilbert scheme of closed subschemes of $P^n$ with Hilbert polynomial $p(t) \in Q[t]$, and let $W:= \overline{W(\underline{b};\underline{a};r)}$ be the closure of the locus in $Hilb ^{p(t)}(P^n)$ of…
Humbert confluent hypergeometric functions of two variables arise in many problems of mathematical physics and applied analysis, yet their behavior with respect to parameters has not been systematically studied. In this paper we investigate…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
Let $F(n,k)$ be a hypergeometric function that may be expressed so that $n$ appears within initial arguments of inverted Pochhammer symbols, as in factors of the form $\frac{1}{(n)_{k}}$. Only in exceptional cases is $F(n, k)$ such that…
This paper presents new examples of elementary and non-elementary irreducible components of the Hilbert scheme of points and its nested variants. The results are achieved via a careful analysis of the deformations of a class of finite…
An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…
In 2021, the first author and Kalita obtained two general hypergeometric formulas for sums involving certain rising factorials to prove some supercongruence conjectures of Guo related to (B.2) and (C.2). In this paper, we further generalize…
The $\alpha$- decay half-lives of the superheavy nuclei are systematically studied using different versions of proximity potential and a exact method to calculate Coulomb potential between spherical and deformed nuclei in the framework of…
We consider the quantum analog of the generalized Zernike systems given by the Hamiltonian: $$\hat{\mathcal{H}}_N =\hat{p}_1^2+\hat{p}_2^2+\sum_{k=1}^N \gamma_k (\hat{q}_1 \hat{p}_1+\hat{q}_2 \hat{p}_2)^k ,$$ with canonical operators…
The particle-particle random phase approximation (pp-RPA) has been shown to be capable of describing double, Rydberg, and charge transfer excitations, for which the conventional time-dependent density functional theory (TDDFT) might not be…
The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…