Related papers: The perfect matching association scheme
In many problems of quantum chaos the calculation of sums of products of periodic orbit contributions is required. A general method of computation of these sums is proposed for generic integrable models where the summation over periodic…
We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
We show that taking the set of primitive idempotents of commutative association schemes is a functor from the category of commutative association schemes with surjective morphisms to the category of finite sets with surjective partial…
In this paper we introduce an algorithm for determining the orbital elements and individual masses of visual binaries. The algorithm uses an optimal point, which minimizes a specific function describing the average length between the…
We introduce a notion of compact association schemes, which serves as a compact analogue of classical (finite) association schemes. Our definition is formulated in a way that closely parallels the finite case, naturally admits a…
In this article we determine feasible parameter sets for (what could potentially be) commutative association schemes with noncyclotomic eigenvalues that are of smallest possible rank and order. A feasible parameter set for a commutative…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
This paper concerns a class of orbital integrals in Lie algebras over p-adic fields. The values of these orbital integrals at the unit element in the Hecke algebra count points on varieties over finite fields. The construction, which is…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…
Construction of hybrid atomic orbitals is proposed as the approximate common eigen states of finite first moment matrices. Their hybridization and orientation can be a-priori tunned as per their anticipated neighbourhood. Their Wannier…
We employ a discrete integral-reflection representation of the double affine Hecke algebra of type $C^\vee C$ at the critical level q=1, to endow the open finite $q$-boson system with integrable boundary interactions at the lattice ends. It…
We present a new adaptive method for electronic structure calculations based on novel fast algorithms for reduction of multivariate mixtures. In our calculations, spatial orbitals are maintained as Gaussian mixtures whose terms are selected…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…