Related papers: Horn's problem in PU$(n,1)$

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

Let $A$ be the path algebra of a Dynkin quiver $Q$ over a finite field, and $\mathscr{P}$ be the category of projective $A$-modules. Denote by $C^1(\mathscr{P})$ the category of 1-cyclic complexes over $\mathscr{P}$, and…

Equipped with the operation of setwise multiplication induced by a (multiplicatively written) monoid $H$ on its parts, the collection of all finite subsets of $H$ containing the identity element is itself a monoid, denoted by $\mathcal…

We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…

We consider Lie groups ${\rm SU}(n,1)$ and ${\rm Sp}(n,1)$ that act as the isometries of the complex and quaternionic hyperbolic spaces respectively. We classify pairs of semisimple elements in ${\rm Sp}(n,1)$ and ${\rm SU}(n,1)$ up to…

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…

We consider the symplectic groupoid of pairs $(B,\mathbb{A})$ with $\mathbb A$ unipotent upper-triangular matrices and $B\in GL_n$ being such that $\widetilde {\mathbb A}=B{\mathbb A} B^{\text{T}}$ are also unipotent upper-triangular…

We construct certain elements in the integral motivic cohomology group $H^3_{{\cal M}}(E \times E',\Q(2))_{\ZZ}$, where $E$ and $E'$ are elliptic curves over $\Q$. When $E$ is not isogenous to $E'$ these elements are analogous to…

A central problem in algebraic complexity, posed by J. Edmonds, asks to decide if the span of a given $l$-tuple $\V=(\V_1, \ldots, \V_l)$ of $N \times N$ complex matrices contains a non-singular matrix. In this paper, we provide a quiver…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…

Let $W\subset GL(V)$ be a complex reflection group, and ${\mathscr A}(W)$ the set of the mirrors of the complex reflections in $W$. It is known that the complement $X({\mathscr A}(W))$ of the reflection arrangement ${\mathscr A}(W)$ is a…

Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…

We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$…

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

The Modular Isomorphism Problem asks if an isomorphism of group algebras of two finite p-groups G and H over a field of characteristic p, implies an isomorhism of the groups G and H. We survey the history of the problem, explain strategies…

We consider the classification problem for compact Lie groups $G\subset U(n)$ which are generated by a single conjugacy class with a fixed number $N$ of distinct eigenvalues. We give an explicit classification when N=3, and apply this to…

Let C be the class of compact 2n-dimensional symplectic manifolds M for which the first or (n-1) Chern class vanish. We point out an integer optimization problem to find a lower bound B(n) on the number of equilibrium points of…

We prove that the conjugacy problem in the first Grigorchuck group $\Gamma$ can be solved in linear time. Furthermore, the problem to decide if a list of elements $w_1,\ldots,w_k\in\Gamma$ contains a pair of conjugate elements can be solved…