Related papers: A reduced subduction graph and higher multiplicity…
We focus on the tranformation matrices between the standard Young-Yamanouchi basis of an irreducible representation for the symmetric group S_n and the split basis adapted to the direct product subgroups S_{n_1} \times S_{n-n_1} . We…
The split basis of an irreducible representation of the symmetric group, $S_{n+m}$, is the basis which is adapted to direct product subgroups of the form $S_{n} \times S_{m}$. In this article we have calculated symmetric group subduction…
Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
We determine precisely when the branching coefficients arising from the restriction of irreducible representations of the symmetric group $S_n$ to the dihedral subgroup $D_n$ are nonzero, and we establish uniform linear lower bounds outside…
Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra $\mathfrak{B}_f(x)$ and split bases adapted to the $\mathfrak{B}_{f_1} (x) \times \mathfrak{B}_{f_2} (x) \subset…
Branching of symplectic groups is not multiplicity-free. We describe a new approach to resolving these multiplicities that is based on studying the associated branching algebra $B$. The algebra $B$ is a graded algebra whose components…
Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto standard approach to…
We propose graph-dependent implicit regularisation strategies for distributed stochastic subgradient descent (Distributed SGD) for convex problems in multi-agent learning. Under the standard assumptions of convexity, Lipschitz continuity,…
Results are obtained on extending flat vector bundles or equivalently general representations from the fundamental group of S, a connected subsurface of the connected boundary of a compact, connected, oriented 3-dimensional manifold, to the…
The graph isomorphism problem is considered. We assign modified $n$-variable characteristic polynomials for graphs and reduce the graph isomorphism problem to the problem of the polynomials isomorphism. It is required to find out, is there…
Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…
Building on reduction theorems and dimension bounds for symmetric groups obtained in our earlier work, we classify the irreducible restrictions of representations of the symmetric and alternating groups to proper subgroups. Such…
We prove a geometric criterion for the bounded multiplicity property of "small" infinite-dimensional representations of real reductive Lie groupsin both induction and restrictions. Applying the criterion to symmetric pairs, we give a full…
We consider the restriction and induction of representations between a covering group and its derived subgroup, both on the representation-theoretic side and the L-parameter side. In particular, restriction of a genuine principal series is…
We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…
In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization,…
Discrete amorphous materials are best described in terms of arbitrary networks which can be embedded in three dimensional space. Investigating the thermodynamic equilibrium as well as non-equilibrium behavior of such materials around second…
We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…