English
Related papers

Related papers: Algorithmically distinguishing irreducible charact…

200 papers

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

Group Theory · Mathematics 2024-07-24 Sheehan Olver

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all…

Logic · Mathematics 2016-09-07 Harry Buhrman , Lance Fortnow , Leen Torenvliet , Dieter van Melkebeek

We introduce a generalization of immanants of matrices, using partition algebra characters in place of symmetric group characters. We prove that our immanant-like function on square matrices, which we refer to as the recombinant, agrees…

Combinatorics · Mathematics 2024-12-11 John M. Campbell

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

We give the criterion for the irreducibility, the Schur irreducibility and the indecomposability of the set of two $n\times n$ matrices $\Lambda_n$ and $A_n$ in terms of the subalgebra associated with the "support" of the matrix $A_n$,…

Representation Theory · Mathematics 2008-11-02 Alexandre Kosyak

Amdeberhan recently proposed certain equalities between sums in the character table of symmetric groups. These equalities are between signed column sums in the character table, summing over the rows labeled by partitions in $\Ev$, where…

Combinatorics · Mathematics 2025-09-24 David J. Hemmer , Armin Straub , Karlee Westrem

Let $G$ be a finite group and \( M \) be a maximal subgroup of \( G \). We call every irreducible constituent \( \chi \) of \( (1_M)^G \) a \( \mathcal{P} \)-character of \( G \) with respect to \( M \). In this paper, we prove that all…

Group Theory · Mathematics 2026-03-31 Jiakuan Lu , hangyang Meng

Let $G$ be a finite group and $p\in \pi(G)$, and let Irr$(G)$ be the set of all irreducible complex characters of $G$. Let $\chi \in {\rm Irr}(G)$, we write ${\rm cod}(\chi)=|G:{\rm ker} \chi|/\chi(1)$, and called it the codegree of the…

Group Theory · Mathematics 2021-04-16 Jiakuan Lu , Yu Li , Boru Zhang

We construct a complex $\mathcal{L}_\bullet^\lambda$ resolving the irreducible representations $\mathcal{S}^{\lambda[n]}$ of the symmetric groups $S_n$ by representations restricted from $GL_n(k)$. This construction lifts to…

Representation Theory · Mathematics 2020-04-02 Christopher Ryba

For a finite group $G$ and complex character $\chi\in\mathrm{Irr}(G)$ that restricts irreducibly to a normal subgroup $N\vartriangleleft G,$ we prove a theorem about Clifford correspondences between the characters of subgroups of $G$ that…

Representation Theory · Mathematics 2018-06-12 Tom Wilde

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

Combinatorics · Mathematics 2023-10-31 Jonas Iskander

A characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning…

Formal Languages and Automata Theory · Computer Science 2024-11-13 Dana Angluin , Dana Fisman

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

Discrete Mathematics · Computer Science 2016-08-12 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

If $n>4$ and $c(\theta)$ denotes the set of irreducible constituents of a character $\theta$, then $c(\chi^k)={\rm Irr}(S_n)$ for all nonlinear $\chi\in {\rm Irr}(S_n)$ if and only if $k\geq n-1$.

Representation Theory · Mathematics 2025-03-13 Alexander R. Miller

A character of a group is said to be super-monomial if every primitive character inducing it is linear. It is conjectured by Isaacs that every irreducible character of an odd $M$-group is super-monomial. We show that all non linear…

Group Theory · Mathematics 2019-04-30 Joakim Færgeman

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

Combinatorics · Mathematics 2020-07-07 Rosa Orellana , Mike Zabrocki

Let $G$ be a finite group and $\mathrm{Irr}(G)$ the set of all irreducible complex characters of $G$. Define the codegree of $\chi \in \mathrm{Irr}(G)$ as $\mathrm{cod}(\chi):=\frac{|G:\mathrm{ker}(\chi) |}{\chi(1)}$ and denote by…

Group Theory · Mathematics 2023-01-10 Mallory Dolorfino , Luke Martin , Zachary Slonim , Yuxuan Sun , Yong Yang

Let H be a countable subgroup of the metrizable compact abelian group G and f:H -> T=R/Z a (not necessarily continuous) character of H. Then there exists a sequence (chi_n)_n of (continuous) characters of G such that lim_n chi_n(alpha) =…

General Topology · Mathematics 2007-05-23 Mathias Beiglböck , Christian Steineder , Reinhard Winkler

Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of irreducible characters of $G$. The codegree of an irreducible character $\chi$ of the group $G$ is defined as $\mathrm{cod}(\chi)=|G:\mathrm{ker}(\chi)|/\chi(1)$. In this paper,…

Group Theory · Mathematics 2021-05-18 Yang Liu , Yong Yang

In this paper, we present some necessary and sufficient conditions under which an irreducible polynomial is self-reciprocal (SR) or self-conjugate-reciprocal (SCR). By these characterizations, we obtain some enumeration formulas of SR and…

Information Theory · Computer Science 2020-01-15 Yansheng Wu , Qin Yue , Shuqin Fan