Related papers: Power-product matrix: nonsingularity, sparsity and…
Let X be a smooth algebraic curve of genus g>=2. A stable vector bundle over X of degree d, rank n with at least k sections is called a Brill-Noether bundle of type (n,d,k). By tensoring coherent systems, we prove that most of the known…
In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…
With $\{X_i\}$ independent $N \times N$ standard Gaussian random matrices, the probability $p_{N,N}^{P_m}$ that all eigenvalues are real for the matrix product $P_m = X_m X_{m-1} \cdots X_1$ is expressed in terms of an $N/2 \times N/2$ ($N$…
This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear…
We consider integrable category $\mathcal{O}$ representations of Borcherds--Kac--Moody algebras whose Cartan matrix is finite dimensional, and determine the necessary and sufficient conditions for which the tensor product of irreducible…
We study the tensor product $V$ of any number of "elementary" irreducible modules over the Yangian of the general linear Lie algebra. An elementary module is determined by a skew Young diagram and by a complex parameter, and contains a…
We describe the group of $\mathbb Z$-linear automorphisms of the ring of integers of a number field $K$ that preserve the set $V_{K,k}$ of $k$th power-free integers: every such map is the composition of a field automorphism and the…
We show that if (X,T) is a topological dynamical system with is deterministic in the sense of Kamiski, Siemaszko and Szymaski then T^{-1} and the product system need not be determinstic in this sense. However if the product system is…
In this paper we deal with the problem of computing the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ with $d>1$ and $R$ a finite commutative ring. We completely solve the problem in the case…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…
A non-redundant integer cone generator (NICG) of dimension $d$ is a set $S$ of vectors from $\{0,1\}^d$ whose vector sum cannot be generated as a positive integer linear combination of a proper subset of $S$. The largest possible…
We prove that for every nowhere dense class of graphs $\mathcal{C}$, positive integer $d$, and $\varepsilon>0$, the following holds: in every $n$-vertex graph $G$ from $\mathcal{C}$ one can find two disjoint vertex subsets $A,B\subseteq…
Let k be a field, n a positive integer, X a generic nxn matrix over k (i.e., a matrix (x_{ij}) of n^2 independent indeterminates over the polynomial ring k[x_{ij}]), and adj(X) its classical adjoint. It is shown that if char k=0 and n is…
A 2-step nilpotent Lie algebra n is called nonsingular if ad(X): n --> [n,n] is onto for any X not in [n,n]. We explore nonsingular algebras in several directions, including the classification problem (isomorphism invariants), the existence…
Finding a good way to model probability densities is key to probabilistic inference. An ideal model should be able to concisely approximate any probability while being also compatible with two main operations: multiplications of two models…
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…
One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, Found. Comput.…
In this paper, we present algorithms to solve matrix multiplication problems in the MPC model. In particular, we consider the problem under various processor/memory constraints in the MPC model and prove the following results. 1.…
Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…