Related papers: Supercharacters and the discrete Fourier, cosine, …
The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…
Much can be learned about a finite group from its character table, but sometimes that table can be difficult to compute. Supercharacter theories are generalizations of character theory defined by P. Diaconis and I.M. Isaacs, in which…
We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in…
The set of supercharacter theories of a fixed group $G$ forms a natural lattice. An open question in the study of supercharacter theories is to classify this lattice, and to date, this has only been done for the cyclic groups…
The concept of a supercharacter theory of a finite group was introduced by Diaconis and Isaacs as an alternative to the usual irreducible character theory, and exemplified with a particular construction in the case of finite algebra groups.…
We develop the theory of $q$-characters for quantum affine superalgebras of type $A$ in connection with deformed Cartan matrices. To achieve this, we establish a Khoroshkin-Tolstoy-type multiplicative formula of the universal $R$-matrix of…
We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…
We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…
The notion of a supercharacter theory was proposed by P. Diaconis and I.M. Isaacs in 2008. A supercharacter theory for a given finite group is a pair of the system of certain complex characters and the partition of group into classes that…
A discrete Fourier analysis associated with translation lattices is developed recently by the authors. It permits two lattices, one determining the integral domain and the other determining the family of exponential functions. Possible…
We present an overview of characteristic identities for Lie algebras and superalgebras. We outline methods that employ these characteristic identities to deduce matrix elements of finite dimensional representations. To demonstrate the…
Four families of special functions, depending on n variables, are studied. We call them symmetric and antisymmetric multivariate sine and cosine functions. They are given as determinants or antideterminants of matrices, whose matrix…
We study Cheeger-Simons differential characters and provide geometric descriptions of the ring structure and of the fiber integration map. The uniqueness of differential cohomology (up to unique natural transformation) is proved by deriving…
A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In…
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…
In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…