Related papers: Edmonds' problem and the membership problem for or…

Let $G$ be a complex semisimple simply connected algebraic group. Given two irreducible representations $V_1$ and $V_2$ of $G$, we are interested in some components of $V_1\otimes V_2$. Consider two geometric realizations of $V_1$ and $V_2$…

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

Let $U_q(\mathfrak{g})$ denote the rational form of the quantized enveloping algebra associated to a complex simple Lie algebra $\mathfrak{g}$. Let $\lambda$ be a nonzero dominant integral weight of $\mathfrak{g}$, and let $V$ be the…

A particular orthogonal map on a finite dimensional real quadratic vector space (V,Q) with a non-degenerate quadratic form Q of any signature (p,q) is considered. It can be viewed as a correlation of the vector space that leads to a dual…

We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B…

In this paper the authors consider four questions of primary interest for the representation theory of reductive algebraic groups: (i) Donkin's Tilting Module Conjecture, (ii) the Humphreys-Verma Question, (iii) whether $\operatorname{St}_r…

We compute the integral cohomology of the minimal non-trivial nilpotent orbit in a complex simple (or quasi-simple) Lie algebra. We find by a uniform approach that the middle cohomology group is isomorphic to the fundamental group of the…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

We consider a generalization of representations of quivers that can be derived from the ordinary representations of quivers by considering a product of arbitrary classical groups instead of a product of the general linear groups and by…

The multiplicative Horn problem is the following question: given three conjugacy classes $\mathcal{C}_1, \mathcal{C}_2, \mathcal{C}_3$ in a Lie group $G$, do there exist elements…

We unify aspects of the equivariant geometry of type $D$ quiver representation varieties, double Grassmannians, and symmetric varieties $GL(a+b)/GL(a)\times GL(b)$; in particular we translate results about singularities of orbit closures,…

Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…

For a complex simple Lie algebra $\mathfrak{g}$ or rank $r$, let $\rho$ be the half sum of positive roots and $P(2\rho)\subset \mathbb{R}^r$ be the convex hull of all dominant weights $\lambda$ of the form $\lambda=2\rho-\sum_{i=1}^r…

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…

In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, graph decompositions, and biembeddings. Here we generalize…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…

A rectangle visibility representation (RVR) of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its…

Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…