Related papers: Solving Equation Systems in $\omega$-categorical A…
The Gordon--Rodriguez-Villegas theorem says that, in a finite group, the number of solutions to a system of coefficient-free equations is divisible by the order of the group if the rank of the matrix composed of the exponent sums of $j$-th…
We investigate generalized amenability and biflatness properties of various (operator) Segal algebras in both the group algebra, L1(G), and the Fourier algebra, A(G), of a locally compact group, G.
It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…
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…
Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…
We show that for algebraic groups over local fields of characteristic zero, the following are equivalent: Every homomorphism has a closed image, every unitary representation decomposes into a direct sum of finite-dimensional and mixing…
Let $G$ be a finite group of Lie type. In studying the cross-characteristic representation theory of $G$, the (specialized) Hecke algebra $H=\End_G(\ind_B^G1_B)$ has played a important role. In particular, when $G=GL_n(\mathbb F_q)$ is a…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
For a set theoretical solution of the Yang-Baxter equation $(X,\sigma)$, we define a d.g. bialgebra $B=B(X,\sigma)$, containing the semigroup algebra $A=k\{X\}/\langle xy=zt : \sigma(x,y)=(z,t)\rangle$, such that $k\otimes_A B\otimes_Ak$…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
This article studies the compatibility of Koenig's notion of an exact Borel subalgebra of a quasi-hereditary or, more generally, standardly stratified algebra with taking idempotent subalgebras or quotients. As an application, we provide…
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…
We study (not necessarily connected) Z-graded A-infinity-algebras and their A-infinity-modules. Using the cobar and the bar construction and Quillen's homotopical algebra, we describe the localisation of the category of A-infinity-algebras…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, \omega), where \gk is an appropriate regular subalgebra of…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
We provide some general conditions which ensure that a system of inequalities involving homogeneous polynomials with coefficients in a S-adic field has nontrivial S-integral solutions. The proofs are based on the strong approximation…
For $G$ a connected, reductive group over an algebraically closed field $k$ of large characteristic, we use the canonical Springer isomorphism between the nilpotent variety of $\mathfrak{g}:=\mathrm{Lie}(G)$ and the unipotent variety of $G$…
The relational complexity of a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a measure of the way in which the orbits of $G$ on $\Omega^k$ for various $k$ determine the original action of $G$. Very few precise values of relational complexity…