Related papers: Solving Equation Systems in $\omega$-categorical A…
We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the…
Let $\gg$ be the Lie algebra of a compact Lie group and let $\theta$ be any automorphism of $\gg$. Let $\gk$ denote the fixed point subalgebra $\gg^\theta$. In this paper we present LiE programs that, for any finite dimensional complex…
We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…
Building on an old result of Duncan and Namioka, we show that the ${\ell}^1$-convolution algebra of a semilattice $S$ is biflat precisely when $S$ is uniformly locally finite. The proof shows in passing that for such $S$ the convolution…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
Classifying isomorphism classes of group gradings on algebras presents a compelling challenge, particularly within the realms of non-simple and infinite-dimensional algebras, which have been relatively unexplored. This study focuses on a…
In this paper, we study two topics. One is the divisibility problem of class groups of quadratic number fields and its connections to algebraic geometry. The other is the construction of Selmer group and Tate-Shafarevich group for an…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…
We classify solvable Lie groups admitting left invariant symplectic half-flat structure. When the Lie group has a compact quotient by a lattice, we show that these structures provide solutions of supersymmetric equations of type IIA.
We show that the isomorphism class of a two-step solvable Lie poset subalgebra of a semisimple Lie algebra is determined by its dimension. We further establish that all such algebras are absolutely rigid.
We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…
This is a long overdue write up of the following: If the fundamental group of a normal complex algebraic variety (respectively Zariski open subset of a compact K\"ahler manifold) is a solvable group of matrices over Q (respectively…
In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…
This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation $m$ that satisfies the minority equations $m(y,x,x) \approx m(x,y,x) \approx m(x,x,y) \approx y$. We show…
We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…
Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…