Related papers: Gauge-string duality, monomial bases and graph det…

There is a classical connection between the representation theory of the symmetric group and the general linear group called Schur-Weyl duality. Variations on this principle yield analogous connections between the symmetric group and other…

The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzero eigenvalues of A. It is a basis-independent number which is up to a sign the first nonzero entry of the characteristic polynomial of A. We prove…

We present a Geometric Invariant Theory (GIT) construction which allows us to construct good projective degenerations of Hilbert schemes of points for simple degenerations. A comparison with the construction of Li and Wu shows that our GIT…

In this paper we present a combinatorial machinery, consisting of a graph tower $\overleftarrow \Gamma$ and vector towers $\overleftarrow v$ on $\overleftarrow \Gamma$, which allows us to efficiently describe all invariant measures $\mu =…

The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…

The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number, possibly infinite, $\varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…

We construct an explicit basis for the coordinate ring of the Bott-Samelson variety Z_i associated to G = GL(n) and an arbitrary sequence of simple reflections i. Our basis is parametrized by certain standard tableaux and generalizes the…

We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…

We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…

Graph deep learning has recently emerged as a powerful ML concept allowing to generalize successful deep neural architectures to non-Euclidean structured data. Such methods have shown promising results on a broad spectrum of applications…

Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

Let $\Fl_\lambda$ be a generalized flag variety of a simple Lie group $G$ embedded into the projectivization of an irreducible $G$-module $V_\lambda$. We define a flat degeneration $\Fl_\lambda^a$, which is a ${\mathbb G}^M_a$ variety.…

We obtain a geometric construction of a ``standard monomial basis'' for the homogeneous coordinate ring associated with any ample line bundle on any flag variety. This basis is compatible with Schubert varieties, opposite Schubert…

Let $G = (V, E)$ be a connected graph with maximum degree $k\geq 3$ distinct from $K_{k+1}$. Given integers $s \geq 2$ and $p_1,\ldots,p_s\geq 0$, $G$ is said to be $(p_1, \dots, p_s)$-partitionable if there exists a partition of $V$ into…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

We suggest a programming realization of an algorithm for verifying a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…

We prove that a finite dimensional algebra $A$ with representation-finite subcategory consisting of modules that are semi-Gorenstein-projective and $n$-th syzygy modules is left weakly Gorenstein. This generalises a theorem of Ringel and…