arXiv subjects

Amritanshu Prasad

Publications and source records attributed to Amritanshu Prasad.

At least 37 records · Page 2Linked to original sources

arXiv2018

Macdonald trees and determinants of representations for finite Coxeter groups

Every irreducible odd dimensional representation of the $n$'th symmetric or hyperoctahedral group, when restricted to the $(n-1)$'th, has a unique irreducible odd-dimensional constituent. Furthermore, the subgraph induced by odd-dimensional representations in the Bratteli diagram of symmetric and hyperoctahedral groups is a binary tree with a simple recursive description. We survey the description of this tree, known as the Macdonald tree, for symmetric groups, from our earlier work. We describe analogous results for hyperoctahedral groups. A partition $λ$ of $n$ is said to be chiral if the corresponding irreducible representation $V_λ$ of $S_n$ has non-trivial determinant. We review our previous results on the structure and enumeration of chiral partitions, and subsequent extension to all Coxeter groups by Ghosh and Spallone. Finally we show that the numbers of odd and chiral partitions track each other closely.

math.RT↗

arXiv2018

Knuth's Moves on Timed Words

We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization of these results to timed words.

math.CO↗

arXiv2018

An Introduction to Schur Polynomials

Notes from a course at the ATM Workshop on Schubert Varieties, held at The Institute of Mathematical Sciences, Chennai, in November 2017. Various expansions of Schur functions, the Lindström-Gessel-Viennot lemma, semistandard Young tableaux, Schensted's insertion algorithm, the plactic monoid, the RSK correspondence, and the Littlewood-Richardson rule are discussed.

math.HO↗

arXiv2018

Tableau Correspondences and Representation Theory

We deduce decompositions of natural representations of general linear groups and symmetric groups from combinatorial bijections involving tableaux. These include some of Howe's dualities, Gelfand models, the Schur-Weyl decomposition of tensor space, and multiplicity-free decompositions indexed by threshold partitions.

math.RT↗

arXiv2017

Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups

Young's orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups, just like the chain of symmetric groups, has multiplicity-free restrictions for irreducible representations. Therefore each irreducible representation of an alternating group also admits Gelfand-Tsetlin bases. Moreover, each such representation is either the restriction of, or a subrepresentation of, the restriction of an irreducible representation of a symmetric group. In this article, we describe a recursive algorithm to write down the expansion of each Gelfand-Tsetlin basis vector for an irreducible representation of an alternating group in terms of Young's orthogonal basis of the ambient representation of the symmetric group. This algorithm is implemented with the Sage Mathematical Software.

math.RT↗

arXiv2017

Residues modulo powers of two in the Young-Fibonacci lattice

We study the subgraph of the Young-Fibonacci graph induced by elements with odd $f$-statistic (the $f$-statistic of an element $w$ of a differential graded poset is the number of saturated chains from the minimal element of the poset to $w$). We show that this subgraph is a binary tree. Moreover, the odd residues of the $f$-statistics in a row of this tree equidistibute modulo any power two. This is equivalent to a purely number theoretic result about the equidistribution of residues modulo powers of two among the products of distinct odd numbers less than a fixed number.

math.CO↗

arXiv2016

Odd partitions in Young's lattice

We show that the subgraph induced in Young's graph by the set of partitions with an odd number of standard Young tableaux is a binary tree. This tree exhibits self-similarities at all scales, and has a simple recursive description.

math.CO↗

arXiv2016

Representations of symmetric groups with non-trivial determinant

We give a closed formula for the number of partitions $λ$ of $n$ such that the corresponding irreducible representation $V_λ$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and how many are hooks. This is achieved by characterizing the $2$-core towers of such partitions. We also obtain a formula for the number of partitions of $n$ such that the associated permutation representation of $S_n$ has non-trivial determinant.

math.RT↗

arXiv2014

Centre of the Schur Algebra

We describe a basis of the centre of the Schur algebra which comes from conjugacy classes in the symmetric group via Schur-Weyl duality. We give a combinatorial description of expansions of these basis elements in terms of the basis originally used by Schur. The primitive central idempotents of the Schur algebra can be written down using this basis and the character table of the symmetric group. Along the way we prove a result on the non-singularity of the submatrix of the character table matrix of a symmetric group obtained by taking rows and columns indexed by partitions with at most n parts for any n.

math.RT↗

arXiv2014

Growth in Right-Angled Groups and Monoids

We derive functional relationships between spherical generating functions of graph monoids, right-angled Artin groups and right-angled Coxeter groups. We use these relationships to express the spherical generating function of a right-angled Artin group in terms of the clique polynomial of its defining graph. We also describe algorithms for computing the geodesic generating functions of these structures.

math.GR↗

arXiv2014

Graphic Interpretation of the Structure Constants of the Schur Algebra

Issai Schur, in his doctoral thesis (1901) introduced the Schur algebra to study the polynomial representation theory of the general linear group. He described a basis of this algebra and structure constants. Later, Miguel Mendez (2001) gave a graph-theoretic description of Schur's basis and computed the structure constants. In this presentation, we will give a new graphic interpretation of the basis of Schur algebra and use it to give a description of the structure constants which is equivalent to the one given by Mendez.

math.RT↗

arXiv2014

Equivalence classes of nodes in trees and rational generating functions

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied to counting the number of conjugacy classes of commuting tuples in finite groups and the number of isomorphism classes of representations of polynomial algebras over finite fields. The method for computing the rational generating functions, when applied to the study of point configurations in finite sets, gives rise to some classical combinatorial results on Bell numbers and Stirling numbers of the second kind. When applied to the study of vector configurations in a finite vector space, it reveals a connection between counting such configurations and Gaussian binomial coefficients.

math.CO↗

arXiv2014

Combinatorics of finite abelian groups and Weil representations

The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil representation are parametrized by a partially ordered set which is independent of p. As p varies, the dimension of the irreducible representation corresponding to each parameter is shown to be a polynomial in p which is calculated explicitly. The commuting algebra of the Weil representation has a basis indexed by another partially ordered set which is independent of p. The expansions of the projection operators onto the irreducible invariant subspaces in terms of this basis are calculated. The coefficients are again polynomials in p. These results remain valid in the more general setting of finitely generated torsion modules over a Dedekind domain.

math.RT↗

arXiv2013

Similarity of matrices over local rings of length two

Let $R$ be a local principal ideal ring of length two, for example, the ring $R=\Z/p^2\Z$ with $p$ prime. In this paper we develop a theory of normal forms for similarity classes in the matrix rings $M_n(R)$ by interpreting them in terms of extensions of $R[t]$-modules. Using this theory, we describe the similarity classes in $M_n(R)$ for $n\leq 4$, along with their centralizers. Among these, we characterize those classes which are similar to their transposes. Non-self-transpose classes are shown to exist for all $n>3$. When $R$ has finite residue field of order $q$, we enumerate the similarity classes and the cardinalities of their centralizers as polynomials in $q$. Surprisingly, the polynomials representing the number of similarity classes in $M_n(R)$ turn out to have non-negative integer coefficients.

math.RA↗

arXiv2013

Orbits of pairs in abelian groups

We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose coefficients are integers which depend only on the elementary divisors of the module, and not on the ring in question. The coefficients of these polynomials are conjectured to be non-negative integers.

math.CO↗

arXiv2012

Buildings, Extensions, and Volume Growth Entropy

Let F be a non-Archimedean local field and let E be a finite extension of F. Let G be a split semisimple F group. We discuss how to compare volumes on the Bruhat-Tits buildings B_E and B_F of G(E) and G(F) respectively.

math.GT↗

arXiv2012

Degeneration and orbits of tuples and subgroups in an Abelian group

A tuple (or subgroup) in a group is said to degenerate to another if the latter is an endomorphic image of the former. In a countable reduced abelian group, it is shown that if tuples (or finite subgroups) degenerate to each other, then they lie in the same automorphism orbit. The proof is based on techniques that were developed by Kaplansky and Mackey in order to give an elegant proof of Ulm's theorem. Similar results hold for reduced countably generated torsion modules over principal ideal domains. It is shown that the depth and the description of atoms of the resulting poset of orbits of tuples depend only on the Ulm invariants of the module in question (and not on the underlying ring). A complete description of the poset of orbits of elements in terms of the Ulm invariants of the module is given. The relationship between this description of orbits and a very different-looking one obtained by Dutta and Prasad for torsion modules of bounded order is explained.

math.GR↗

arXiv2011

Ultrametric Logarithm Laws, II

We prove positive characteristic versions of the logarithm laws of Sullivan and Kleinbock-Margulis and obtain related results in Metric Diophantine Approximation.

math.DS↗