相关论文: Using Hook Schur Functions to Compute Matrix Cocha…

We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…

Matrix functions with potential applications have a major role in science and engineering. One of the fundamental matrix functions, which is particularly important due to its connections with certain matrix differential equations and other…

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of…

We compute the trace decategorification of the Hecke category for an arbitrary Coxeter group. More generally, we introduce the notion of a strictly object-adapted cellular category and calculate the trace for such categories.

We introduce and study a family of functions we call the "mock characters". These functions satisfy a number of interesting properties, and of all completely multiplicative arithmetic functions seem to come as close as possible to being…

We show how to calculate correlation functions of two matrix models. Our method consists in making full use of the integrable hierarchies and their reductions, which were shown in previous papers to naturally appear in multi--matrix models.…

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…

Computation of the trace of a matrix function plays an important role in many scientific computing applications, including applications in machine learning, computational physics (e.g., lattice quantum chromodynamics), network analysis and…

In this short paper, we study some trace inequalities of the products of the matrices and the power of matrices by the use of elementary calculations.

Low-rank matrix approximations are often used to help scale standard machine learning algorithms to large-scale problems. Recently, matrix coherence has been used to characterize the ability to extract global information from a subset of…

In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space, and consider the class of (left or right) Schur multipliers that can be approached in the multiplier…

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

We consider the Schur-positivity of monomial immanants of Jacobi-Trudi matrices, in particular whether a non-negative coefficient of the trivial Schur function implies non-negative coefficients for other Schur functions in said immanants.…

This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…

The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following…

Given a matrix over a skew field fixing the column (1,...,1)^t, we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes.

Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…

We compute the cohomological invariants with coefficients in $\mathbb{Z}/p\mathbb{Z}$ of the stack $\mathscr{H}_3$ of hyperelliptic curves of genus $3$ over an algebraically closed field.