English
Related papers

Related papers: Computing Multiplicities of Lie Group Representati…

200 papers

We determine the quantum query complexity of oracle identification on the hyperoctahedral group $B_N = \{\pm 1\}^N \rtimes S_N$ with respect to the natural representation: $Q_{LV}(B_N) = 2(N-1)$ for all $N \ge 2$. This is twice the…

Combinatorics · Mathematics 2026-04-16 Ji Ho Bae

In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…

Representation Theory · Mathematics 2026-05-25 Venkata Subbaiah Yerrapati , Rahul Dixit , Ajay Kumar Shukla

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev , Dmitrii V. Pasechnik

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

Representation Theory · Mathematics 2007-05-23 G. Lusztig

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

Let $k$ be a field, let $G$ be a reductive algebraic group over $k$, and let $V$ be a linear representation of $G$. Geometric invariant theory involves the study of the $k$-algebra of $G$-invariant polynomials on $V$, and the relation…

Number Theory · Mathematics 2012-08-07 Manjul Bhargava , Benedict H. Gross

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

Computational Complexity · Computer Science 2009-05-05 Leslie Ann Goldberg , Martin Grohe , Mark Jerrum , Marc Thurley

Given a hyper loop algebra over a non-algebraically closed field, we address multiplicity problems in the underlying abelian tensor category of finite-dimensional representations. Namely, we give formulas for the l-characters of the simple…

Representation Theory · Mathematics 2012-01-04 Dijana Jakelic , Adriano Moura

This paper presents algebraic methods for the study of polynomial relative invariants, when the group G formed by the symmetries and relative symmetries is a compact Lie group. We deal with the case when the subgroup H of symmetries is…

Dynamical Systems · Mathematics 2012-07-09 Patricia H. Baptistelli , Miriam Manoel

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 Theory · Mathematics 2015-05-19 Kunal Dutta , Amritanshu Prasad

We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…

Group Theory · Mathematics 2007-05-23 Michael Larsen , Alexander Lubotzky

We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…

Combinatorics · Mathematics 2016-09-07 Frank K. Hwang , Shmuel Onn , Uriel G. Rothblum

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

Data Structures and Algorithms · Computer Science 2020-03-10 Peter Bürgisser , Cole Franks , Ankit Garg , Rafael Oliveira , Michael Walter , Avi Wigderson

Let $G$ be a connected and simply connected two-step nilpotent Lie group and $\Gamma$ a lattice subgroup of $G$. In this note, we give a new multiplicity formula, according to the sense of Moore, of irreducible unitary representations…

Group Theory · Mathematics 2009-06-16 Hatem Hamrouni

In this paper, we will compute the characteristic polynomials for finite dimensional representations of classical complex Lie algebras and the exceptional Lie algebra of type G2, which can be obtained through the orbits of integral weights…

Representation Theory · Mathematics 2024-10-28 Chenyue Feng , Shoumin Liu , Xumin Wang

Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…

Logic · Mathematics 2023-08-04 Benjamin Castle , Chieu-Minh Tran

Let $\mathbb{F}$ be an algebraically closed field and $G$ be an almost quasi-simple group. An important problem in representation theory is to classify the subgroups $H<G$ and $\mathbb{F} G$-modules $L$ such that the restriction…

Representation Theory · Mathematics 2025-10-10 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

Let $F$ be a totally real field in which $p$ is unramified. Let $\overline{r}: G_F \rightarrow \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ be a modular Galois representation which satisfies the Taylor-Wiles hypotheses and is generic at a place…

Number Theory · Mathematics 2019-10-16 Daniel Le

For a class $\mathcal{H}$ of graphs, #Sub$(\mathcal{H})$ is the counting problem that, given a graph $H\in \mathcal{H}$ and an arbitrary graph $G$, asks for the number of subgraphs of $G$ isomorphic to $H$. It is known that if $\mathcal{H}$…

Computational Complexity · Computer Science 2014-07-11 Radu Curticapean , Dániel Marx
‹ Prev 1 4 5 6 7 8 10 Next ›