Related papers: A constructive algorithm for the Cartan decomposit…

Let $G$ be a simple cubic 2-connected plane graph. For every $2$-factor $X$ of $G$ having $n$-components there exists a simple hamiltonian plane graph $J \subset G^{2}$ such that $|E(J)|= |E(G)| + 2n -2$ and $\Delta(J) \leqslant 5$.

The algebra of holomorphic polynomial Sp_{2n}-invariants of k complex 2n by 2n matrices (under diagonal conjugation action) is generated by the traces of words in these matrices and their symplectic adjoints. No concrete minimal generating…

We consider the quantum inverse scattering method for several mixed integrable models based on the rational SU(N) R-matrix with general toroidal boundary conditions. This includes systems whose Hilbert spaces are invariant by the discrete…

The K\"otter-Nielsen-H{\o}holdt algorithm is a popular way to construct the bivariate interpolation polynomial in the Guruswami-Sudan decoding algorithm for Reed-Solomon codes. In this paper, we show how one can use Divide & Conquer…

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…

The Gauss decomposition of quantum groups and supergroups are considered. The main attention is paid to the R-matrix formulation of the Gauss decomposition and its properties as well as its relation to the contraction procedure. Duality…

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

We realize the simple Lie superalgebra G(3) as supersymmetry of various geometric structures, most importantly super-versions of the Hilbert-Cartan equation (SHC) and Cartan's involutive PDE system that exhibit G(2) symmetry. We provide the…

The decomposition of the spinor bundle of the spin Grassmann manifolds $G_{m,n}=SO(m+n)/SO(m)\times SO(n)$ into irreducible representations of $\mathfrak{so}(m)\oplus\mathfrak{so}(n)$ is presented. A universal construction is developed and…

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine…

A new technique is proposed for the solution of the Riemann-Hilbert problem with the Chebotarev-Khrapkov matrix coefficient $G(t)=\alpha_1(t)I+\alpha_2(t)Q(t)$, $\alpha_1(t), \alpha_2(t)\in H(L)$, $Q(t)$ is a $2\times 2$ zero-trace…

We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$ where $D$ is a real or unitary $n \times n$ diagonal matrix and $U, V \in\mathbb{C}^{n \times k}$. The proposed algorithm for the real case…

We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Given an positive integer $k$, let $n:=\binom{k+1}{2}$. In 2012, during a talk at UCLA, Jan Saxl conjectured that all irreducible representations of the symmetric group $S_n$ occur in the decomposition of the tensor square of the…

It is well-known that the SU(2) quantum Racah coefficients or the Wigner $6j$ symbols have a closed form expression which enables the evaluation of any knot or link polynomials in SU(2) Chern-Simons field theory. Using isotopy equivalence…

We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

We compute the matrix elements of $SO(3)$ in any finite-dimensional irreducible representation of $sl_3$. They are expressed in terms of a double sum of products of Krawtchouk and Racah polynomials which generalize the Griffiths-Krawtchouk…