Related papers: Jordan Triple Disystems
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
This note adds to the recent spate of derivations of the probabilistic apparatus of finite-dimensional quantum theory from various axiomatic packages. We offer two different axiomatic packages that lead easily to the Jordan algebraic…
An associative algebra with a generalized derivation is called an AsGDer triple. We introduce the operad that encodes AsGDer triples, and prove it is a Koszul operad. Using its Koszul dual cooperad, we introduce the homotopy version of…
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{\omega+3}a+n^4a^2+n^\omega\log(1/\epsilon))$ time algorithm for finding an…
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…
A common computational approach for polynomial optimization problems (POPs) is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the variables in the POP are required to be nonnegative, these SDP problems typically…
Jordan as well as related triple systems have been used to find several solutions of the Yang-Baxter equation, which are of rational as well as trigonometric type.
Velasquez and Felipe recently introduced quasi-Jordan algebras based on the product $a \triangleleft b = \tfrac12 ( a \dashv b + b \vdash a )$ in an associative dialgebra with operations $\dashv$ and $\vdash$. We determine the polynomial…
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where the literals are rooted triples, is there a rooted binary…
In this paper we study systems of autonomous algebraic ODEs in several differential indeterminates. We develop a notion of algebraic dimension of such systems by considering them as algebraic systems. Afterwards we apply differential…
Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
In this paper we prove the generalized Kaplansky conjecture for the Jordan algebras of the type $J_n$ in particular for self adjoint $2\times 2$ matrices over $\R$, over $\C$, $\HH$ and $\Oct$. In fact, we prove that the image of…
When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…
In this paper we prove an asymptotically sharp Bernstein-type inequality for polynomials on analytic Jordan arcs. Also a general statement on mapping of a domain bounded by finitely many Jordan curves onto a complement to a system of the…
We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…