Related papers: Super Multiset RSK and a Mixed Multiset Partition …
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry…
We design a polynomial time decoding algorithm for linearized Algebraic Geometry codes with unramified evaluation places, a family of sum-rank metric evaluation codes on division algebras over function fields. By establishing a Serre…
Deep subspace clustering (DSC) networks based on self-expressive model learn representation matrix, often implemented in terms of fully connected network, in the embedded space. After the learning is finished, representation matrix is used…
The coinvariant algebra $R_n$ is a well-studied $\mathfrak{S}_n$-module that is a graded version of the regular representation of $\mathfrak{S}_n$. Using a straightening algorithm on monomials and the Garsia-Stanton basis, Adin, Brenti, and…
In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of…
Dense and sparse tensors allow the representation of most bulk data structures in computational science applications. We show that sparse tensor algebra can also be used to express many of the transformations on these datasets, especially…
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
It is shown that the deformed Heisenberg algebra involving the reflection operator R (R-deformed Heisenberg algebra) has finite-dimensional representations which are equivalent to representations of paragrassmann algebra with a special…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
The purpose of this note is to give an insertion scheme proof of the formula, $$p_\mu = \sum_{\lambda\vdash k} \chi^\lambda(\mu)s_\lambda,\formula$$ where $p_\mu$ is the power sum symmetric function, $s_\lambda$ is the Schur function and…
This article describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalisation of sets where members are allowed to occur multiple times. A multiset…
In this work we present recent results on application of low-rank tensor decompositions to modelling of aggregation kinetics taking into account multi-particle collisions (for three and more particles). Such kinetics can be described by…
This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…
We propose a new approach to study the Kronecker coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. We explain the limiting behavior and associated bounds in the context of the partition…
We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition,…
We introduce a new basis for the polynomial ring which lifts the complete homogeneous symmetric polynomials while retaining representation theoretic significance. Using a specialized RSK algorithm we give an explicit nonnegative expansion…
Infinite-dimensional Lie superalgebras, particularly Borcherds-Kac-Moody (BKM) superalgebras, play a fundamental role in mathematical physics, number theory, and representation theory. In this paper, we study the root multiplicities of BKM…