Related papers: Uncrowding algorithm for hook-valued tableaux
Schensted row insertion is a fundamental component of the Robinson-Schensted-Knuth (RSK) algorithm, a powerful tool in combinatorics and representation theory. This study examines the insertion of a deterministic number into a random…
In this paper, we consider low-rank approximations for the solutions to the stochastic Helmholtz equation with random coefficients. A Stochastic Galerkin finite element method is used for the discretization of the Helmholtz problem.…
An element of a Weyl group of classical type is skew if it is the left factor in a reduced factorization of a Grassmannian element. The skew Grothendieck polynomials are those which are indexed by skew elements of the Weyl group. We define…
Bagging and boosting are proved to be the best methods of building multiple classifiers in classification combination problems. In the area of "flat clustering" problems, it is also recognized that multi-clustering methods based on boosting…
We introduce a Grothendieck group of algebraic stacks (with affine stabilisers) analogous to the Grothendieck group of algebraic varieties. We then identify it with a certain localisation of the Grothendieck group of algebraic varieties.…
We describe new methods for deciding the stability of switching systems. The methods build on two ideas previously appeared in the literature: the polytope norm iterative construction, and the lifting procedure. Moreover, the combination of…
This paper is the sequel of the paper under the same title with part 1, where we introduced refined canonical stable Grothendieck polynomials and their duals with two families of infinite parameters. In this paper we give combinatorial…
This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic…
The free-variable tableau method has been widely used in order to automate proofs in multiple kinds of logics. Many automated theorem provers rely on this approach, either because it is the only available method-e.g., in certain modal…
We propose a novel algorithm for unsupervised graph representation learning with attributed graphs. It combines three advantages addressing some current limitations of the literature: i) The model is inductive: it can embed new graphs…
We present a novel technique by which highly-segmented electrostatic configurations can be solved. The Robin Hood method is a matrix-inversion algorithm optimized for solving high density boundary element method (BEM) problems. We…
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs.…
Matrix completion, the problem of completing missing entries in a data matrix with low dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog, that attempts to impute…
We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
We give some special values of Grothendieck polynomials and an explicit formula for the number of set-valued tableaux. For Young diagrams consisting of a single row or a single column, both the value and number are written by the Gauss'…
Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…
We introduce an enriched analogue of Lam and Pylyavskyy's theory of set-valued $P$-partitions. An an application, we construct a $K$-theoretic version of Stembridge's Hopf algebra of peak quasisymmetric functions. We show that the symmetric…
Decomposition of large matrix inequalities for matrices with chordal sparsity graph has been recently used by Kojima et al.\ \cite{kim2011exploiting} to reduce problem size of large scale semidefinite optimization (SDO) problems and thus…
A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…