Related papers: Algorithmic recognition of infinite cyclic extensi…
We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…
Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety $\mathcal V$ is standard if every Boolean topological algebra with the…
If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…
The automorphism group of a regular locally finite tree is shown to admit irreducible Banach representations that are not admissible. The dense subspace of smooth vectors contains no algebraically irreducible component.
Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be…
Let $G\subset\GL(\BC^r)$ be a finite complex reflection group. We show that when $G$ is irreducible, apart from the exception $G=\Sgot_6$, as well as for a large class of non-irreducible groups, any automorphism of $G$ is the product of a…
Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
Given a Bayesian network structure (directed acyclic graph), the celebrated d-separation algorithm efficiently determines whether the network structure implies a given conditional independence relation. We show that this changes drastically…
We study birational automorphisms of algebraic varieties of bounded growth, i.e. such that the norms of the inverse images ${(f^n)}^* \colon \mathrm{NS}(X)\to \mathrm{NS}(X)$ of the powers of the automorphism $f\in\mathrm{Bir}(X)$ are…
A long-standing conjecture asserts that every finite nonabelian $p$-group has a non-inner automorphism of order $p$. In this paper we prove the conjecture for finite $p$-groups of coclass $4$ and coclass $5$ ($p\ge 5$). We also prove the…
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
We classify noninvertible, holomorphic selfmaps of the projective plane that preserve an algebraic web. In doing so, we obtain interesting examples of critically finite maps.
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
Given an inverse semigroup $G_0$ of bounded type, we show, along with some other assumptions, that if the set of incompressible elements of $G_0$ is finite, then any finitely generated subgroup $G$ of the topological full group…
We study endomorphisms and derivations of infinite dimensional cyclic Leibniz algebra.
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group $G$ which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually…
We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…