Related papers: A straightening algorithm for row-convex tableaux
This paper addresses matrix approximation problems for matrices that are large, sparse and/or that are representations of large graphs. To tackle these problems, we consider algorithms that are based primarily on coarsening techniques,…
We explain and generalise row-removal phenomena for Schur algebras via isomorphisms between subquotients of these algebras. In particular, we prove a new reduction formulae for $p$-Kostka numbers and extension groups between Weyl and simple…
Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. We introduce a novel approach for the discovery of a…
Schur-type methods in \cite{Chu2} and \cite{GCQX} solve the robust pole assignment problem by employing the departure from normality of the closed-loop system matrix as the measure of robustness. They work well generally when all poles to…
The aim of this work is to investigate the structure of some skew twisted algebras, when the coefficient ring is a localization of the polynomial ring over the field of characteristic zero, and an involution is provided. A parallel…
We describe a fast solver for linear systems with reconstructable Cauchy-like structure, which requires O(rn^2) floating point operations and O(rn) memory locations, where n is the size of the matrix and r its displacement rank. The solver…
We show that some factors of the universal R-matrix generate a family of twistings for the standard Hopf structure of any quantized contragredient Lie (super)algebra of finite growth. As an application we prove that any two isomorphic…
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used with an appropriate preconditioner (e.g.,…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur…
In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [Gubinelli, Journal of Differential Equations, 248(4), 2010], which generalizes the classical geometric rough path. We establish a…
The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…
We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with sampling,…
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms.…
We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of…
We introduce the edge Schur functions $E^{\lambda}$ that are defined as a generating series over edge labeled tableaux. We formulate $E^{\lambda}$ as the partition function for a solvable lattice model, which we use to show they are…
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
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…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Let X be the group of weights of a maximal torus of a simply connected semisimple group over C and let W be the Weyl group. The semidirect product W(Q\otimes X/X) is called the extended Weyl group. There is a natural C(v)-algebra H called…