Related papers: The perfect matching association scheme
It is significant and challenging to solve eigenvalue problems of partial differential operators when many highly accurate eigenpair approximations are required. The adaptive finite element discretization based parallel orbital-updating…
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…
We describe a recursive algorithm that produces an integral basis for the centre of the Hecke algebra of type A consisting of linear combinations of monomial symmetric polynomials of Jucys--Murphy elements. We also discuss the existence of…
We consider an eigenvalue problem for a discrete analogue of the Hamiltonian of the non-ideal Bose gas with delta-potentials on a circle. It is a two-parameter deformation of the discrete Hamiltonian for joint moments of the partition…
We present a systematic description of the structure of Bose-Einstein condensation (BEC) in the free Bose gas from the viewpoint of the correspondence between the operator-algebraic formulation based on the resolvent algebra and the…
In the present paper we study the following problem: how to construct a coherent orthoalgebra which has only a finite number of elements, but at the same time does not admit a bivaluation (i.e. a morphism with a codomain being an…
We consider the exact solution of a model of correlated particles, which is presented as a system of interacting XX and Fateev-Zamolodchikov chains. This model can also be considered as a generalization of the multiband anisotropic $t-J$…
We investigate the properties of positive definite and positive semi-definite symmetric matrices within the framework of symmetrized tropical algebra, an extension of tropical algebra adapted to ordered valued fields. We focus on the…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
We introduce a novel machine learning based framework for discovering integrable models. Our approach first employs a synchronized ensemble of neural networks to find high-precision numerical solution to the Yang-Baxter equation within a…
The auxiliary functions provide efficient computation of integrals arising at the self-consistent field (SCF) level for molecules using Slater-type bases. This applies both in relativistic and non-relativistic electronic structure theory.…
In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…
Using the analytical expressions for the genuine eigenfunctions $\varphi_{\mu\nu}(z)$ and eigenvalues $E_{\mu,\nu}$, of open, bounded and quasi-bounded finite periodic systems, we derive the eigenfunctions space-inversion symmetry…
Absolute pose estimation is a fundamental problem in computer vision, and it is a typical parameter estimation problem, meaning that efforts to solve it will always suffer from outlier-contaminated data. Conventionally, for a fixed…
An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of…
Keeping in view the ordering ambiguity that arises due to the presence of position-dependent effective mass in the kinetic energy term of the Hamiltonian, a general scheme for obtaining algebraic solutions of quantum mechanical systems with…
We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our first contribution is a simple and efficient algorithm to…
A bottleneck plane perfect matching of a set of $n$ points in $\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\em bottleneck}. The…
A novel orthogonalization-free method together with two specific algorithms are proposed to solve extreme eigenvalue problems. On top of gradient-based algorithms, the proposed algorithms modify the multi-column gradient such that earlier…