相关论文: A straightening algorithm for row-convex tableaux

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

We use the theory of Gr\"obner-Shirshov bases for ideals to construct linear bases for graded local Weyl modules for the (hyper) current and the truncated current algebras associated to the finite-dimensional complex simple Lie algebra…

In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…

Estimating matrices in the symmetric positive-definite (SPD) cone is of interest for many applications ranging from computer vision to graph learning. While there exist various convex optimization-based estimators, they remain limited in…

We introduce an affine Schur algebra via the affine Hecke algebra associated to Weyl group of affine type C. We establish multiplication formulas on the affine Hecke algebra and affine Schur algebra. Then we construct monomial bases and…

Aligning users across networks using graph representation learning has been found effective where the alignment is accomplished in a low-dimensional embedding space. Yet, achieving highly precise alignment is still challenging, especially…

We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…

A non-classical Weyl theory is developed for skew-self-adjoint Dirac systems with rectangular matrix potentials. The notion of the Weyl function is introduced and direct and inverse problems are solved. A Borg-Marchenko type uniqueness…

Boob et al. [1] described an iterative peeling algorithm called Greedy++ for the Densest Subgraph Problem (DSG) and conjectured that it converges to an optimum solution. Chekuri, Quanrud, and Torres [2] extended the algorithm to general…

Let W be a Weyl group. We define a new basis for the Grothendieck group of representations of W. This basis contains on the one hand the special representations of W and on the other hand the representations carried by the left cells of W.…

In this paper we present a right version of the algorithms developed for to compute Gr\"obner bases over bijective skew PBW extensions in the left case given in [3]. In particular, we adapt the theory of reduction and we build a right…

We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…

We build on the methods introduced by Friedmann, Hanlon, Stanley, and Wachs, and further developed by Brauner and Friedmann, to construct additional classes of presentations of Specht modules. We obtain these presentations by defining a…

This paper develops a general framework for solving a variety of convex cone problems that frequently arise in signal processing, machine learning, statistics, and other fields. The approach works as follows: first, determine a conic…

Recent advances in the integration of deep learning with automated theorem proving have centered around the representation of logical formulae as inputs to deep learning systems. In particular, there has been a growing interest in adapting…

We give a presentation of Schur algebras (over the rational number field) by generators and relations, in fact a presentation which is compatible with Serre's presentation of the universal enveloping algebra of a simple Lie algebra. In the…

Schur modules give the irreducible polynomial representations of the general linear group $\mathrm{GL}_t$. Viewing the symmetric group $\mathfrak{S}_t$ as a subgroup of $\mathrm{GL}_t$, we may restrict Schur modules to $\mathfrak{S}_t$ and…

There are two approaches to projective representation theory of symmetric and alternating groups, which are powerful enough to work for modular representations. One is based on Sergeev duality, which connects projective representation…

Tight and efficient neural network bounding is crucial to the scaling of neural network verification systems. Many efficient bounding algorithms have been presented recently, but they are often too loose to verify more challenging…

We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…