Related papers: Decomposing Linear Representations of Finite Group…

The Graph Burning Problem (GBP) is a combinatorial optimization problem that has gained relevance as a tool for quantifying a graph's vulnerability to contagion. Although it is based on a very simple propagation model, its decision version…

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

We review the enveloping algebra of the 10 dimensional chiral sigma matrices. To facilitate the computation of the product of several chiral sigma matrices we have developed a symbolic program. Using this program one can reduce the…

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

In this paper, we consider the construction of irreducible representations of finite pattern groups in terms of Panov's associative polarization, which is a finite-field analogue of Kirillov's orbital method. Using this construction, first,…

Let $G$ denote the unramified quasi-split unitary group $\mathbb{U}(1,1)(F)$ over a $p$-adic field $F$ with residual characteristic $p \neq 2$. In this article, we determine the branching rules for all irreducible supercuspidal…

Suppose $K/\mathbb{Q}_p$ is finite and $\overline{r}\colon G_K\to \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ is a reducible Galois representation. In this paper we prove that we can use the results by the author in [Ste22] to obtain a…

In this paper, we propose a graph classification approach for automatically determining whether to use a monolithic or a decomposition-based solution method. In this approach, an optimization problem is represented as a graph that captures…

The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…

We study finite-dimensional representations of hyper loop algebras over non-algebraically closed fields. The main results concern the classification of the irreducible representations, the construction of the Weyl modules, base change,…

Let G be a finite group. By Riemann's Existence Theorem, braid orbits of generating systems of G with product 1 correspond to irreducible families of covers of the Riemann sphere with monodromy group G. Thus many problems on algebraic…

We determine semisimple reductions of irreducible, 2-dimensional crystalline representations of the absolute Galois group $\text{Gal}(\overline{\mathbb{Q}_p}/\mathbb{Q}_{p^f})$. To this end, we provide explicit representatives for the…

We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…

We compute explicitly the group of connected components $\pi_0G(\mathbb{R})$ of the real Lie group $G(\mathbb{R})$ for an arbitrary (not necessarily linear) connected algebraic group $G$ defined over the field $\mathbb{R}$ of real numbers.…

We propose a robust framework for the planar pose graph optimization contaminated by loop closure outliers. Our framework rejects outliers by first decoupling the robust PGO problem wrapped by a Truncated Least Squares kernel into two…

Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions can be reused to solve CSPs with the same constraint scopes,…

Let F be a non-Archimedean locally compact field of residue characteristic p, let G be an inner form of GL(n,F) with n>0, and let l be a prime number different from p. We describe the block decomposition of the category of finite length…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…