Related papers: An algorithmic Littlewood-Richardson rule
The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…
The jeu-de-taquin-based Littlewood-Richardson rule of H. Thomas and A. Yong (2009) for minuscule varieties has been extended in two orthogonal directions, either enriching the cohomology theory or else expanding the family of varieties…
Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the…
While equality of skew Schur functions is well understood, the problem of determining when two skew Schur $Q$ functions are equal is still largely open. It has been studied in the case of ribbon shapes in 2008 by Barekat and van…
One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper…
The main aim of the paper is to present a~combinatorial algorithm that, applying Littlewood-Richardson tableaux with entries equal to $1$, computes generic extensions of semisimple invariant subspaces of nilpotent linear operators.…
An algorithmic method to exploit a general class of infinitesimal symmetries for reducing stochastic differential equations is presented and a natural definition of reconstruction, inspired by the classical reconstruction by quadratures, is…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
We give a new simple characterization of the set of Kleshchev multipartitions, and more generally of the set of Uglov multipartitions. These combinatorial objects play an important role in various areas of representation theory of quantum…
We revisit an algorithm by Skeel et al. for computing the modified, or shadow, energy associated with the symplectic discretization of Hamiltonian systems. By rephrasing the algorithm as a Richardson extrapolation scheme arbitrary high…
We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…
This paper introduces a new strategy for setting the regularization parameter when solving large-scale discrete ill-posed linear problems by means of the Arnoldi-Tikhonov method. This new rule is essentially based on the discrepancy…
I describe a method, particularly suitable to implementation by computer algebra, for the derivation of low-dimensional models of dynamical systems. The method is systematic and is based upon centre manifold theory. Computer code for the…
We first describe a system of inequalities (Horn's inequalities) that characterize eigenvalues of sums of Hermitian matrices. When we apply this system for integral Hermitian matrices, one can directly test it by using Littlewood-Richardson…
We solve the $K$-theoretically refined Donaldson-Thomas theory of local curves. Our results avoid degeneration techniques, but rather exploit direct localisation methods to reduce the refined Donaldson-Thomas partition function to the…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
In recent work, robust mixture modelling approaches using skewed distributions have been explored to accommodate asymmetric data. We introduce parsimony by developing skew-t and skew-normal analogues of the popular GPCM family that employ…