Related papers: Insertion algorithms for Gelfand $S_n$-graphs

We prove that the Bowen-Franks group classifies the Leavitt path algebras of purely infinite simple finite graphs over a regular supercoherent commutative ring with involution where $2$ is invertible, equipped with their standard…

There exist certain intrinsic relations between the ultraviolet divergent graphs and the convergent ones at the same loop order in renormalizable quantum field theories. Whereupon we present a new method, the inserter regularization method,…

In this paper, we propose a general procedure for establishing the geometric landscape connections of a Riemannian optimization problem under the embedded and quotient geometries. By applying the general procedure to the fixed-rank positive…

Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…

In Schiebinger et al. (2017), the authors use optimal transport of measures on empirical distributions arising from biological experiments to relate the single cell RNA sequencing profiles for induced pluripotent stem cells differentiating.…

The stabilization algorithm of Weisfeiler and Leman has as an input any square matrix A of order n and returns the minimal cellular (coherent) algebra W(A) which includes A. In case when A=A(G) is the adjacency matrix of a graph G the…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. We propose the systematic use of symmetric spaces in representation learning,…

A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a…

$W$-graphs, representing the multiplication action of the standard basis on the canonical basis in the Iwahori-Hecke algebra are introduced by Kazhdan and Lusztig. Marberg defined a generalized $W$-graph, the Gelfand W-graph, corresponding…

Graph embedding is a central problem in social network analysis and many other applications, aiming to learn the vector representation for each node. While most existing approaches need to specify the neighborhood and the dependence form to…

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

Given a finite group $G$ and two unitary $G$-representations $V$ and $W$, possible restrictions on Brouwer degrees of equivariant maps between representation spheres $S(V)$ and $S(W)$ are usually expressed in a form of congruences modulo…

We present a full list of all representations of the special linear group $\mathrm{SL}_n$ over the complex numbers with complete intersection invariant ring, completing the classification of Shmelkin. For this task, we combine three…

We describe a new algorithm, termed subspace evolution and transfer (SET), for solving low-rank matrix completion problems. The algorithm takes as its input a subset of entries of a low-rank matrix, and outputs one low-rank matrix…

We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…

Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.

In this paper we present a combinatorial proof of a relation between the generating functions of unicellular and bicellular maps. This relation is a consequence of the Schwinger-Dyson equation of matrix theory. Alternatively it can be…

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…

The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data. A leading design paradigm for this is the convolution kernel, which decomposes structured objects into their…