Related papers: Note on refined topological vertex, Jack polynomia…

In this paper, we introduce a tensor neural network based machine learning method for solving the elliptic partial differential equations with random coefficients in a bounded physical domain. With the help of tensor product structure, we…

We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their…

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…

We derive explicit formulas for the eigenfunctions and eigenvalues of the elliptic Calogero-Sutherland model as infinite series, to all orders and for arbitrary particle numbers and coupling parameters. The eigenfunctions obtained provide…

In investigation of boundary-value problems for certain partial differential equations arising in applied mathematics, we often need to study the solution of system of partial differential equations satisfied by hypergeometric functions and…

Vector-valued Jack polynomials associated to the symmetric group ${\mathfrak S}_N$ are polynomials with multiplicities in an irreducible module of ${\mathfrak S}_N$ and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators…

We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…

We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…

We derive a number of local identities of arbitrary rank involving Jacobi elliptic functions and use them to obtain several new results. First, we present an alternative, simpler derivation of the cyclic identities discovered by us…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

We use a new method to study the Laplace-Beltrami type operator on the Fock space of symmetric functions, and as an example of our explicit computation we show that the Jack symmetric functions are the only family of eigenvectors of the…

We derive an infinite set of recursion formulae for Nekrasov instanton partition function for linear quiver U(N) supersymmetric gauge theories in 4D. They have a structure of a deformed version of W_{1+\infty} algebra which is called SH^c…

In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…

The paper presents a method to compute the Jacobi's elliptic function \texttt{sn} on the period parallelogram. For fixed $m$ it requires first to compute the complete elliptic integrals $K=K(m)$ and $K'=K(1-m).$ The Newton method is used to…

We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.

We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three…

We present an explicit formula for the expected value of a product of several independent symplectically invariant matrices in which the trace and real part function may be applied, possibly to different subexpressions. This takes the form…

We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…

For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm…