Related papers: Exact solution for generalized pairing
We introduce the notion of almost finite dimensionality of algebras and study its connection with the classical finiteness conditions.
Exactly-solvable Hamiltonians that can be diagonalized using relatively simple unitary transformations are of great use in quantum computing. They can be employed for decomposition of interacting Hamiltonians either in Trotter-Suzuki…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of…
A general formalism to solve nonlinear differential equations is given. Solutions are found and reduced to those of second order nonlinear differential equations in one variable. The approach is uniformized in the geometry and solves…
The principal innovative idea in this paper is to transform the original complex nonlinear modeling problem into a combination of linear problem and very simple nonlinear problems. The key step is the generalized linearization of nonlinear…
The analysis of data sometimes requires fitting many free parameters in a theory to a large number of data points. Questions naturally arise about the compatibility of specific subsets of the data, such as those from a particular experiment…
This paper investigates finite-dimensional representations of PT-symmetric Hamiltonians. In doing so, it clarifies some of the claims made in earlier papers on PT-symmetric quantum mechanics. In particular, it is shown here that there are…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…
We give an explicit formula for the Deligne pairing for a proper and flat morphisms $f:X\to S$ of schemes, in terms of the determinant of cohomology. The whole construction is justified by an analogy with the intersection theory on…
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
Extending the work of Freese, we further develop the theory of generalized trigonometric functions. In particular, we study to what extent the notion of polar form for the complex numbers may be generalized to arbitrary associative…
This paper explores the solution of Fredholm-like equations with infinite dimensional solution spaces. We set out to find a method for determining a particular solution to a Fredholm-like equation subject to a given constraint. The…
A Hamiltonian formulation of generic many-body systems with balanced loss and gain is presented. It is shown that a Hamiltonian formulation is possible only if the balancing of loss and gain terms occur in a pairwise fashion. It is also…
We develop a general axiomatic theory of algebraic pairs, which simultaneously generalizes several algebraic structures, in order to bypass negation as much as feasible. We investigate several classical theorems and notions in this setting…
There has been increasing interest in studying the Richardson model from which one can derive the exact solution for certain pairing Hamiltonians. However, it is still a numerical challenge to solve the nonlinear equations involved. In this…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
We consider spaces for which there is a notion of harmonicity for complex valued functions defined on them. For instance, this is the case of Riemannian manifolds on one hand, and (metric) graphs on the other hand. We observe that it is…