English
Related papers

Related papers: Towards a pseudoequational proof theory

200 papers

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

Rings and Algebras · Mathematics 2022-03-08 Jason P. Bell , Peter V. Danchev

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Let $\Gamma$ be a discrete subgroup of a simply connected, solvable Lie group~$G$, such that $\Ad_G\Gamma$ has the same Zariski closure as $\Ad G$. If $\alpha \colon \Gamma \to \GL_n(\real)$ is any finite-dimensional representation…

Representation Theory · Mathematics 2009-09-25 Dave Witte

We show that if $\mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $\mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the…

Group Theory · Mathematics 2019-03-07 Alfredo Costa , Ana Escada

An algebra is called a GI-algebra if its group of units satisfies a group identity. We provide positive support for the following two open problems. 1. Does every algebraic GI-algebra satisfy a polynomial identity? 2. Is every algebraically…

Rings and Algebras · Mathematics 2008-04-12 Eric Jespers , David Riley , Salvatore Siciliano

In this paper, we work on the pro-nilpotent group topology of a free group. First we investigate the closure of the product of finitely many subgroups of a free group in the pro-nilpotent group topology. We present an algorithm for the…

Group Theory · Mathematics 2017-03-24 J. Almeida , M. H. Shahzamanian , B. Steinberg

Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…

Combinatorics · Mathematics 2017-05-17 M. J. Kronenburg

Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.

Functional Analysis · Mathematics 2025-06-23 Dinamérico P. Pombo

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Computational Complexity · Computer Science 2025-03-04 Alberto Larrauri , Stanislav Živný

In this paper we give sufficient conditions under which a subsemigroup of a topological group is a subgroup, adding to the results given in \cite{Kosh, can, axioms, forum, Hof, cc, locally} where conditions exist (such as locally…

General Topology · Mathematics 2020-12-23 Julio César Hernández Arzusa

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

Group Theory · Mathematics 2019-11-20 Alexander Bors

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…

Discrete Mathematics · Computer Science 2015-03-19 Zoltan Esik

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Logic · Mathematics 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…

Group Theory · Mathematics 2024-09-24 Elisa Hartmann

We introduce a generalization of the product expansion of a finite semigroup. As an application, we provide an alternative proof of the decidability of pointlike sets for pseudovarieties consisting of semigroups whose subgroups all belong…

Group Theory · Mathematics 2021-10-25 Karsten Henckell , Samuel Herman

Let ${\frak F}$ be a class of group and $G$ a finite group. Then a set $\Sigma $ of subgroups of $G$ is called a \emph{$G$-covering subgroup system} for the class ${\frak F}$ if $G\in {\frak F}$ whenever $\Sigma \subseteq {\frak F}$. We…

Group Theory · Mathematics 2021-01-05 A-Ming Liu , W. Guo , Inna N. Safonova , Alexander N. Skiba

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

Rings and Algebras · Mathematics 2019-10-23 Thomas Quinn-Gregson

With each antiholomorphic involution $\sigma $ of a connected complex semisimple Lie group $G$ we associate an automorphism $\epsilon_\sigma$ of the Dynkin diagram. The definition of $\epsilon_\sigma$ is given in terms of the Satake diagram…

Algebraic Geometry · Mathematics 2016-01-05 Dmitri Akhiezer

A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary…

Group Theory · Mathematics 2015-01-20 Clifford Bergman , David Failing
‹ Prev 1 3 4 5 6 7 10 Next ›