Related papers: Box products in nilpotent normal form theory: The …

We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…

In the present article we study the form factors of quantum integrable lattice models solvable by the separation of variables (SoV) method. It was recently shown that these models admit universal determinant representations for the scalar…

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor…

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

We construct knot invariants categorifying the quantum knot variants for all representations of quantum groups. We show that these invariants coincide with previous invariants defined by Khovanov for sl_2 and sl_3 and by Mazorchuk-Stroppel…

The normal form theory for polynomial vector fields is extended to those for $C^\infty$ vector fields vanishing at the origin. Explicit formulas for the $C^\infty$ normal form and the near identity transformation which brings a vector field…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

Integrating a product of linear forms over the unit simplex can be done in polynomial time if the number of variables n is fixed (V. Baldoni et al., 2011). In this note, we highlight that this problem is equivalent to obtaining the…

We show for $n,k\geq1$, and an $n$-dimensional complex vector space $V$ that if an element $A\in\text{End}(V)[[z]]$ has constant term similar to a Jordan block, then there exists a polynomial gauge transformation $g$ such that the first $k$…

In this article, we start to recall the inversion formula for the convolution with the Box spline. The equivariant cohomology and the equivariant K-theory with respect to a compact torus G of various spaces associated to a linear action of…

A perturbative expansion of knot invariants is derived using quantum cluster algebras. By interpreting the $R$-matrix of $U_q(\mathfrak{sl}_2)$ as a cluster transformation and introducing an auxiliary parameter $\epsilon$, we derive a…

We introduce a sl_2-invariant family of nonlinear vector fields with a non-semisimple triple zero singularity. In this paper we are concerned with characterization and normal form classification of these vector fields. We show that the…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

Linear (or differential) cryptanalysis may seem dull topics for a mathematician: they are about super simple invariants characterized by say a word on n=64 bits with very few bits at 1, the space of possible attacks is small, and basic…

It is well-known that a nilpotent n by n matrix B is determined up to conjugacy by a partition of n formed by the sizes of the Jordan blocks of B. We call this partition the Jordan type of B. We obtain partial results on the following…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA integers themselves). Most notably, we factor $n$-bit integers…

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of GL_n(C) on the variety of x-nilpotent complex matrices. We obtain a criterion as to whether the action admits a finite number of orbits and specify a…

A mock Seifert matrix is an integral square matrix representing the Gordon-Litherland form of a pair $(K,F)$, where $K$ is a knot in a thickened surface and $F$ is an unoriented spanning surface for $K$. Using these matrices, we introduce a…