Related papers: Algorithmically distinguishing irreducible charact…

Unambiguous automata are nondeterministic automata in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-time Markov chains against \omega-regular specifications…

We provide efficient replicable algorithms for the problem of learning large-margin halfspaces. Our results improve upon the algorithms provided by Impagliazzo, Lei, Pitassi, and Sorrell [STOC, 2022]. We design the first…

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

We study the restriction to Sylow subgroups of irreducible characters of symmetric groups. In particular, we focus our attention on constituents of degree greater than 1. Our main result is a wide generalization of Theorem 3.1 of Giannelli…

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

In \cite{Ka14} we produced an algorithm for deciding whether or not an element $\phi\in Out(F_N)$ is an iwip ("fully irreducible") automorphism. At several points that algorithm was rather inefficient as it involved some general enumeration…

Let G be a finite p-group, for some prime p, and $\psi, \theta \in \Irr(G)$ be irreducible complex characters of G. It has been proved that if, in addition, $\psi,\theta$ are faithful characters, then the product $\psi\theta$ is a multiple…

We study a spectral problem related to the finite-dimensional characters of the groups $Sp(2N)$, $SO(2N+1)$, and $SO(2N)$, which form the classical series $C$, $B$, and $D$, respectively. The irreducible characters of these three series are…

In this paper we classify the multiplicity-free skew characters of the symmetric group. Furthermore we show that the Schubert calculus is equivalent to that of skew characters in the following sense: If we decompose the product of two…

The irreducible characters of a finite reductive group are partitioned into Harish-Chandra series that are labelled by cuspidal pairs. In this note, we describe how one can algorithmically calculate those cuspidal pairs using results of…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph $G=\left(V,E\right)$, a subset $S\subseteq V$ is an $\left(\alpha,\beta\right)$-community if: * Every member of the community is…

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…

This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

In this contribution we consider the sequence $\{Q_{n}^{\lambda}\}_{n\geq 0} $ of monic polynomials orthogonal with respect to the following inner product involving differences \begin{equation*} \langle p,q\rangle…

Let X be a smooth curve over a finite field of characteristic p, let E be a number field, and consider an E-compatible system of lisse sheaves on the curve X. For each place lambda of E not lying over p, the lambda-component of the system…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…