Related papers: A Riemann-Hilbert problem for skew-orthogonal poly…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
This note supplements the work of Gomez-Ullate, Kamran and Milson on the X_(1)-Laguerre polynomials which are orthogonal in a weighted Hilbert function space on the positive half-line of the real line. These polynomials are generated by a…
We study the Dirichlet problem for semilinear equations on general open sets with measure data on the right-hand side and irregular boundary data. For this purpose we develop the classical method of orthogonal projection. We treat in a…
In this work we propose a discretisation method for the Reissner--Mindlin plate bending problem in primitive variables that supports general polygonal meshes and arbitrary order. The method is inspired by a two-dimensional discrete de Rham…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
In recent years, the proximal gradient method and its variants have been generalized to Riemannian manifolds for solving optimization problems with an additively separable structure, i.e., $f + h$, where $f$ is continuously differentiable,…
In this survey, we review the properties of minimal spectral $k$-partitions in the two-dimensional case and revisit their connections with Pleijel's Theorem. We focus on the large $k$ problem (and the hexagonal conjecture) in connection…
We perform a resurgence analysis of the perturbative partition functions of orientifolded conifolds and obtain the full nonperturbative partition functions in terms of multiple sine functions. We derive the unoriented Donaldson--Thomas…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
In this paper we use the Riemann-Hilbert problem, with jumps supported on appropriate curves in the complex plane, for matrix biorthogonal polynomials and apply it to find Sylvester systems of differential equations for the orthogonal…
Building upon the recent works of Bertola; Fasondini, Olver and Xu, we define a class of orthogonal polynomials on elliptic curves and establish a corresponding Riemann-Hilbert framework. We then focus on the special case, defined by a…
We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…
Riemannian optimization is concerned with problems, where the independent variable lies on a smooth manifold. There is a number of problems from numerical linear algebra that fall into this category, where the manifold is usually specified…
In this paper, we consider the Neumann problem for a class of Hessian quotient equations involving a gradient term on the right-hand side in Euclidean space. More precisely, we derive the interior gradient estimates for the $(\Lambda,…
We consider the asymptotic behaviour of the second-order correlation function of the characteristic polynomial of a real symmetric random matrix. Our main result is that the existing result for a random matrix from the Gaussian Orthogonal…
Two families of d-orthogonal polynomials related to su(2) are identified and studied. The algebraic setting allows their full characterization (explicit expressions, recurrence relations, difference equations, generating functions, etc.) of…
Exact eigenvalue correlation functions are computed for large $N$ hermitian one-matrix models with eigenvalues distributed in two symmetric cuts. An asymptotic form for orthogonal polynomials for arbitrary polynomial potentials that support…
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and…
Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…
We carry out the asymptotic analysis as $n \to \infty$ of a class of orthogonal polynomials $p_{n}(z)$ of degree $n$, defined with respect to the planar measure \begin{equation*} d\mu(z) = (1-|z|^{2})^{\alpha-1}|z-x|^{\gamma}\mathbf{1}_{|z|…