Related papers: Macdonald polynomials at t = 0 through twisted mul…
Quantization of the parameters of machine learning models, such as deep neural networks, requires solving constrained optimization problems, where the constraint set is formed by the Cartesian product of many simple discrete sets. For such…
Inspired by long-standing open problems in algebraic combinatorics, we show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries. In particular, we focus on the construction of simple mathematical…
We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\mathbb{R}^d$. This task is known to have complexity $d^{\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components,…
For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…
Developments in algorithms over the past decade suggest that there is a new computational approach to a class of quantum field theories. This approach is based on rewriting the partition function in a representation similar to the…
In the last decade, sequential Monte-Carlo methods (SMC) emerged as a key tool in computational statistics. These algorithms approximate a sequence of distributions by a sequence of weighted empirical measures associated to a weighted…
We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…
We consider matrix quantum mechanics with multiple bosonic matrices, including those obtained from dimensional reduction of Yang-Mills theories. Using the matrix bootstrap, we study simple observables like $\langle \mathop{tr} X^2 \rangle$…
The Macdonald process is a stochastic process on the collection of partitions that is a $(q,t)$-deformed generalization of the Schur process. In this paper, we approach the Macdonald process identifying the space of symmetric functions with…
In this work we consider the {\em analog bipartite spin-glass} (or {\em real-valued restricted Boltzmann machine} in a neural network jargon), whose variables (those quenched as well as those dynamical) share standard Gaussian…
We develop a quantum-classical hybrid algorithm for function optimization that is particularly useful in the training of neural networks since it makes use of particular aspects of high-dimensional energy landscapes. Due to a recent…
Model quantization has become essential for efficient large language model deployment, yet existing approaches involve clear trade-offs: methods such as GPTQ and AWQ achieve practical compression but are lossy, while lossless techniques…
We present a detailed discussion of the collinear subtraction terms needed to establish a massive variable-flavour-number scheme for the one-particle inclusive production of heavy quarks in hadronic collisions. The subtraction terms are…
The Fast Multipole Method (FMM) for the Poisson equation is extended to the case of non-axisymmetric problems in an axisymmetric domain, described by cylindrical coordinates. The method is based on a Fourier decomposition of the source into…
A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…
We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…
The Macdonald polynomials can be obtained by acting on the constant 1 with creation operators. Three different expressions for these operators are derived, one from the other, in a rather succint way. When the last of these expressions is…
New sequences of discrete orthogonal polynomials associated with the modified Bessel function $K_\mu(z)$ or Macdonald function are considered. The corresponding weight function is $\lambda^k \rho_{k+\nu+1}(t)/ k!$, where $\ k \in…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
We study certain $q$-difference raising operators for Macdonald polynomials (of type $A_{n-1}$) which are originated from the $q$-difference-reflection operators introduced in our previous paper. These operators can be regarded as a…