Related papers: Rank and Duality in Representation Theory

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

Using a new definition of rank for representations of semisimple groups sharp results are proved for the decay of matrix coefficients of unitary representations of two types of non-split $p$-adic simple algebraic groups of exceptional type.…

We study the complex irreducible representations of special linear, symplectic, orthogonal and unitary groups over principal ideal local rings of length two. We construct a canonical correspondence between the irreducible representations of…

We examine from an algebraic point of view some families of unitary group representations that arise in mathematical physics and are associated to contraction families of Lie groups. The contraction families of groups relate different real…

Many statistical experiments involve comparing multiple population groups. For example, a public opinion poll may ask which of several political candidates commands the most support; a social scientific survey may report the most common of…

In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor…

In recent years, representation learning has become the research focus of the machine learning community. Large-scale neural networks are a crucial step toward achieving general intelligence, with their success largely attributed to their…

Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms…

Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle…

Complex systems are high-dimensional nonlinear dynamical systems with intricate interactions among their constituents. To make interpretable predictions about their large-scale behavior, it is typically assumed, without a clear statement,…

By computing reducibility points of parabolically induced representations, we construct, to within at most two unramified quadratic characters, the Langlands parameter of an arbitrary depth zero irreducible cuspidal representation $\pi$ of…

In an earlier paper we propose an approach to the unitarizability problem in the case of classical groups over a p-adic field of characteristic zero based on cuspidal reducibility points. We have reduced earlier the unitarizability for…

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…

With each resonance of the Laplacian acting on the compactly supported sections of a homogeneous vector bundle over a Riemannian symmetric space of the non-compact type, One can associate a residue representation. The purpose of this paper…

We introduce concepts of intermediate rank for countable groups that "interpolate" between consecutive values of the classical (integer-valued) rank. Various classes of groups are proved to have intermediate rank behaviors. We are…

In this article, we classify disconnected reductive groups over an algebraically closed field with a few caveats. Internal parts of our result are both a classification of finite groups and a classification of integral representations of a…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…

We introduce a family of local ranks DQ depending on a finite set Q of pairs of the form (\varphi(x,y),q(y)) where \varphi(x,y) is a formula and q(y) is a global type. We prove that in any NSOP1 theory these ranks satisfy some desirable…