Related papers: Computing Multiplicities of Lie Group Representati…

In connection with machine arithmetic, we are interested in systems of constraints of the form x + k \leq y + k'. Over integers, the satisfiability problem for such systems is polynomial time. The problem becomes NP complete if we restrict…

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

We describe a collection of computer scripts written in PARI/GP to compute, for reflection groups determined by finite-volume polyhedra in $\mathbb{H}^3$, the commensurability invariants known as the invariant trace field and invariant…

In this note we announce Lp multiplier theorems for invariant and non-invariant operators on compact Lie groups in the spirit of the well-known Hormander-Mikhlin theorem on Rn and its variants on tori Tn. Applications are given to the…

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…

Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that…

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Two representations of a reductive group G are spectrally equivalent if the same irreducible representations appear in both of them. The semigroup of finite dimensional representations of G with tensor product and up to spectral equivalence…

We prove several multiplicity one theorems in this paper. For k a local field not of characteristic two, and V a symplectic space over k, any irreducible admissible representation of the symplectic similitude group GSp(V) decomposes with…

Nielsen's geometric approach offers a powerful framework for quantifying the complexity of unitary transformations. In this formulation, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $G_{\mathbb{R}}$ be a real reductive Lie group and $G'_{\mathbb{R}}$ a reductive subgroup of $G_{\mathbb{R}}$ such that $\mathfrak{g'}$ is algebraic in $\mathfrak{g}$. In this paper, we consider restrictions of irreducible…

We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

We provide an explicit construction and a closed dimension formula in terms of hook lengths for the irreducible representations for the symmetric groups $\mathfrak{S}_p$ and the Sergeev superalgebras $\mathcal{Y}_p$ over an algebraically…