Related papers: Rank and Duality in Representation Theory
In the modular representation theory of finite unitary groups when the characteristic $\ell$ of the ground field is a unitary prime, the $\hat{\mathfrak{sl}}_e$-crystal on level $2$ Fock spaces graphically describes the Harish-Chandra…
We analyze dynamic random network models where younger vertices connect to older ones with probabilities proportional to their degrees as well as a propensity kernel governed by their attribute types. Using stochastic approximation…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
People often plan hierarchically. That is, rather than planning over a monolithic representation of a task, they decompose the task into simpler subtasks and then plan to accomplish those. Although much work explores how people decompose…
This article is a record of the lecture at the centennial conference for Harish-Chandra. The admissibility theorem of Harish-Chandra concerns the restrictions of irreducible representations to maximal compact subgroups. In this article, we…
Inspired by the Gan-Gross-Prasad conjecture and the descent problem for classical groups, in this paper we study the descents of unipotent cuspidal representations of orthogonal and symplectic groups over finite fields.
Ranking entities such as algorithms, devices, methods, or models based on their performances, while accounting for application-specific preferences, is a challenge. To address this challenge, we establish the foundations of a universal…
We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…
The goals of this paper are threefold. First, we provide a new ''universal'' definition for the Racah algebra of rank 2 as an extension of the rank-1 Racah algebra where the generators are indexed by subsets and any three disjoint indexing…
In this paper we de ne conditional random elds in reproducing kernel Hilbert spaces and show connections to Gaussian Process classi cation. More speci cally, we prove decomposition results for undirected graphical models and we give…
In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.…
Selecting the latent dimensions (ranks) in tensor factorization is a central challenge that often relies on heuristic methods. This paper introduces a rigorous approach to determine rank identifiability in probabilistic tensor models, based…
How does an irreducible representation of a group behave when restricted to a subgroup? This is part of branching problems, which are one of the fundamental problems in representation theory, and also interact naturally with other fields of…
Methods for detecting community structure in networks typically aim to identify a single best partition of network nodes into communities, often by optimizing some objective function, but in real-world applications there may be many…
For a semisimple Lie group $G$ satisfying the equal rank condition, the most basic family of unitary irreducible representations is the discrete series found by Harish-Chandra. In this paper, we study some of the branching laws for discrete…
Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decomposition methods based on chordal sparsity have already been…
We extend the family of classical Schur algebras in type A, which determine the polynomial representation theory of general linear groups over an infinite field, to a larger family, the rational Schur algebras, which determine the rational…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
For better learning, large datasets are often split into small batches and fed sequentially to the predictive model. In this paper, we study such batch decompositions from a probabilistic perspective. We assume that data points (possibly…
Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…