Related papers: Using Hook Schur Functions to Compute Matrix Cocha…
This paper advocates the use of complex variables to represent votes in the Hough transform for circle detection. Replacing the positive numbers classically used in the parameter space of the Hough transforms by complex numbers allows…
We introduce the Schur class of functions, discrete analytic on the integer lattice in the complex plane. As a special case, we derive the explicit form of discrete analytic Blaschke factors and solve the related basic interpolation…
The familiar trace of a square matrix generalizes to a trace of an endomorphism of a dualizable object in a symmetric monoidal category. To extend these ideas to other settings, such as modules over non-commutative rings, the trace can be…
Provided that a cohomological model for $G$ is known, we describe a method for constructing a basis for $n$-cocycles over $G$, from which the whole set of $n$-dimensional $n$-cocyclic matrices over $G$ may be straightforwardly calculated.…
We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…
A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…
We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a…
The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…
We introduce and investigate a family of tau-functions of the 2D Toda hierarchy, which is a natural generalization of the hypergeometric family associated with Hurwitz numbers. For this family we prove a skew Schur function expansion…
In this paper, we present a general review of hash functions in a cryptographic sense. We give special emphasis on some particular topics such as cipher block chaining message authentication code (CBC MAC) and its variants. This paper also…
We argue that restricted Schur polynomials provide a useful parameterization of the complete set of gauge invariant variables of multi-matrix models. The two point functions of restricted Schur polynomials are evaluated exactly in the free…
In this paper, we give one possible definition for functions of several variables applied to endomorphisms of finite dimensional C-vector spaces. This definition is consistent with the usual notion of a function of a square matrix. Some…
In this paper, we first introduce certain forms of extended incomplete Pochhammer symbols which are then used to define families of extended incomplete generalized hypergeometric functions. For these functions, we investigate various…
We derive a product rule satisfied by restricted Schur polynomials. We focus mostly on the case that the restricted Schur polynomial is built using two matrices, although our analysis easily extends to more than two matrices. This product…
New sufficient conditions and necessary conditions are developed for two skew diagrams to give rise to the same skew Schur function. The sufficient conditions come from a variety of new operations related to ribbons (also known as border…
We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
Let F be a field of characteristic 0. We consider the algebra UT_m(F) of upper triangular matrices of order m endowed with na elementar Z_m-grading induced by the m-tuple phi=(0,0,1,...,m-2), then we compute its Y-proper graded cocharacter…
We present an approximate algorithm for matrix multiplication based on matrix sketching techniques. First one of the matrix is chosen and sparsified using the online matrix sketching algorithm, and then the matrix product is calculated…
We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…