Related papers: An Algorithm to compute the Kronecker cone and oth…
Quadratic programming over orthogonal matrices encompasses a broad class of hard optimization problems that do not have an efficient quantum representation. Such problems are instances of the little noncommutative Grothendieck problem…
Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…
We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group…
A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients…
In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy…
We introduce and analyze a class of valid inequalities for nonconvex quadratically constrained optimization problems (QCQPs) which we call Eigen-CG inequalities. These inequalities are obtained by applying a Chv\'atal-Gomory (CG) rounding…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…
For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…
We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…
Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). We describe a…
This paper is concerned with the Frank--Wolfe algorithm for a special class of {\it non-compact} constrained optimization problems. The notion of asymptotic cone is used to introduce this class of problems as well as to establish that the…
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-cuts) that defines the convex hull of the integer…
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…
We introduce the `Fourier transform' F_C on the isotropic cone C associated to an indefinite quadratic form of signature (n_1,n_2) on R^n (n=n_1+n_2: even). This transform is in some sense the unique and natural unitary operator on L^2(C),…
We investigate the representation theory of the rational and trigonometric Cherednik algebra of type $GL_n$ by means of combinatorics on periodic (or cylindrical) skew diagrams. We introduce and study standard tableaux and plane partitions…