Related papers: On a geometric method for the identifiability of f…
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…
In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…
Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…
An inverse problem of finding an obstacle and the boundary condition on its surface from the fixed-energy scattering data is studied. A new method is developed for a proof of the uniqueness results. The method does not use the discreteness…
Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
We define lower triangular tensors, and show that all diagonal entries of such a tensor are eigenvalues of that tensor. We then define lower triangular sub-symmetric tensors, and show that the number of independent entries of a lower…
Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}^r f_i^2$ where $\mathrm{deg} f_i=d/2$. The minimal number of summands $r$ is called the $2$-rank of $f$, so that the polynomials having…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
Hilbert-Schmidt (HS) decompositions are employed for analyzing systems of n-qubits, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary transformations (PTU) for one qubit from the whole…
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…
We study Hamiltonian and symplectic tensor structures in the T-product algebra. We define T-Hamiltonian and T-symplectic tensors and characterize them through their Fourier-domain slices. For T-Hamiltonian tensors we establish the standard…
Given a nonzero integer $d$, we know by Hermite's Theorem that there exist only finitely many cubic number fields of discriminant $d$. However, it can happen that two non-isomorphic cubic fields have the same discriminant. It is thus…
The Eigendecomposition of quadratic forms (symmetric matrices) guaranteed by the spectral theorem is a foundational result in applied mathematics. Motivated by a shared structure found in inferential problems of recent interest---namely…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
The Separation of Variables theory for the Hamilton-Jacobi equation is 'by definition' related to the use of special kinds of coordinates, for example Jacobi coordinates on the ellipsoid or St\"ackel systems in the Euclidean space. However,…
Third-order tensors are widely used as a mathematical tool for modeling physical properties of media in solid state physics. In most cases, they arise as constitutive tensors of proportionality between basic physics quantities. The…
Compositional verification algorithms are well-studied in the context of model checking. Properly selecting components for verification is important for efficiency, yet has received comparatively less attention. In this paper, we address…
Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…