Related papers: Rank and Duality in Representation Theory

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

In this paper, we propose a new conjecture describing the structure of the unitary dual in terms of Arthur representations for connected reductive algebraic groups defined over any non-Archimedean local field of characteristic zero. This…

In this paper, we establish general categorical frameworks that extend Loewy's classification scheme for finite-dimensional real irreducible representations of groups and Borel--Tits' criterion for the existence of rational forms of…

For a vector field F on the Euclidean plane we construct, under certain assumptions on F, an ordered model-theoretic structure associated to the flow of F. We do this in such a way that the set of all limit cycles of F is represented by a…

Let G be the group of rational points of a connected reductive group over a finite field. Based on work of Lusztig and Yun, we make the Jordan decomposition for irreducible G-representations canonical. It comes in the form of an equivalence…

Let $\mathbf{G}$ be an unramified quasi-split unitary group over a p-adic field of odd residual characteristic. The goal of this paper is to describe the supercuspidal representations within certain L-packets of $\mathbf{G}$, which are…

In this paper, the 2-category $\mathfrak{Rep}_{{\bf 2Mat}_{\mathbb{C}}}(\mathbb{G})$ of (weak) representations of an arbitrary (weak) 2-group $\mathbb{G}$ on (some version of) Kapranov and Voevodsky's 2-category of (complex) 2-vector spaces…

A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…

We define a general class of models representing natural selection between two alleles. The population size and spatial structure are arbitrary, but fixed. Genetics can be haploid, diploid, or otherwise; reproduction can be asexual or…

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…

Let $\Gamma$ be a group and $r_n(\Gamma)$ the number of its $n$-dimensional irreducible complex representations. We define and study the associated representation zeta function $\calz_\Gamma(s) = \suml^\infty_{n=1} r_n(\Gamma)n^{-s}$. When…

Recently, $\alpha$-Rank, a graph-based algorithm, has been proposed as a solution to ranking joint policy profiles in large scale multi-agent systems. $\alpha$-Rank claimed tractability through a polynomial time implementation with respect…

Cardinal characteristics of the continuum represent the boundaries in size between the countable and the continuum with respect to certain properties of sets. They are often defined as the minimum sizes of families of reals that meet some…

Rank-based approaches are among the most popular nonparametric methods for univariate data in tackling statistical problems such as hypothesis testing due to their robustness and effectiveness. However, they are unsatisfactory for more…

We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

We introduce a notion of dimension of max-min convex sets, following the approach of tropical convexity. We introduce a max-min analogue of the tropical rank of a matrix and show that it is equal to the dimension of the associated polytope.…

Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the…