Related papers: A $q$-Robinson-Schensted-Knuth Algorithm and a $q$…
We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
We present a novel $Q$-learning algorithm tailored to solve distributionally robust Markov decision problems where the corresponding ambiguity set of transition probabilities for the underlying Markov decision process is a Wasserstein ball…
Drawing an analogy to the paradigm of quasi-elastic neutron scattering, we present a general approach for quantitatively investigating the spatiotemporal dependence of structural anisotropy relaxation in deformed polymers by using…
Addendum: The generalized Box-M\"uller algorithm provides a methodology for generating q-Gaussian random variates. The parameter $-\infty<q\leq3$ is related to the shape of the tail decay; $q<1$ for compact-support including parabola…
The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial…
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent…
One of spectacular results in mathematical physics is the expression of Racah matrices for symmetric representations of the quantum group $SU_q(2)$ through the Askey-Wilson polynomials, associated with the $q$-hypergeometric functions…
In this paper, a novel adaptive finite element method is proposed to solve the Kohn-Sham equation based on the moving mesh (nonnested mesh) adaptive technique and the augmented subspace method. Different from the classical self-consistent…
Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…
The need to reason about uncertainty in large, complex, and multi-modal datasets has become increasingly common across modern scientific environments. The ability to transform samples from one distribution $P$ to another distribution $Q$…
The eigenvalue problem of quantum many-body systems is a fundamental and challenging subject in condensed matter physics, since the dimension of the Hilbert space (and hence the required computational memory and time) grows exponentially as…
We investigate the spontaneous parity-time (PT )-symmetry breaking and spectral properties of a PT symmetric quantum kicked rotor under resonance conditions. At resonance, the QKR reduces to a finite-dimensional system. In the localized…
We develop a unified scaling framework for the end-position distributions of tethered polymers confined in finite cylindrical geometries. Two observables are analysed: the longitudinal distribution P(x), along the confinement axis, and the…
We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…
Using the Berele/Remmel/Kerov/Vershik variation of the Robinson-Schensted-Knuth correspondence, we study the cycle and increasing subsequence structure after various methods of shuffling. One consequence is a cycle index for shuffles like:…
We describe stochastic Newton and stochastic quasi-Newton approaches to efficiently solve large linear least-squares problems where the very large data sets present a significant computational burden (e.g., the size may exceed computer…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
We propose a new approach to conjugation-invariant random permutations. Namely, we explain how to construct uniform permutations in given conjugacy classes from certain point processes in the plane. This enables the use of geometric tools…
In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…