Related papers: Finite basis problems for stalactic, taiga, sylves…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Let G be a finite group that acts on an abelian monoid A. If f: A -> G is a map so that f(a f(a)(b)) = f(a)f(b), for all a, b in A, then the submonoid S = {(a, f(a)) | a in A} of the associated semidirect product of A and G is said to be a…

We show that the 42-element monoid of all partial order preserving and extensive injections on the 4-element chain is not contained in any variety generated by a finitely based finite $\mathcal{R}$-trivial semigroup. This provides unified…

The class of finitely presented algebras over a field K with a set of generators a_1,...,a_n and defined by homogeneous relations of the form a_1a_2...a_n = a_{sigma(1)}a_{sigma(2)}...a_{sigma(n)}, where sigma runs through an abelian…

A $(v,k,\lambda)$-BIBD $(X,\mathcal B)$ can be nested if there is a mapping $\phi:\mathcal B\rightarrow X$ such that $(X,\{B\cup\{\phi(B)\}\mid B\in\mathcal B\})$ is a $(v,k+1,\lambda+1)$-packing. A $(v,k,\lambda)$-BIBD has a (perfect)…

Given a polynomial of degree d over a number field, the image of the associated arboreal representation of the absolute Galois group of the field is a profinite group acting on the d-ary tree. Boston and Jones conjectured that for a…

We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids.…

Given a group $G$ acting faithfully on a set $S$, we characterize precisely when the twisted Brin-Thompson group $SV_G$ is finitely presented. The answer is that $SV_G$ is finitely presented if and only if we have the following: $G$ is…

In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…

We transform the method of Glasson into a sufficient condition under which a monoid is non-finitely related, add a new member to the collection of interlocking word-patterns, and use it to show that the monoid $M(ab^2a, a^2b^2)$ is…

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e. Baxter permutations, pairs of twin binary trees,…

In this paper, we prove the existence of a unique strong solution to a stochastic tamed 3D Navier-Stokes equation in the whole space as well as in the periodic boundary case. Then, we also study the Feller property of solutions, and prove…

We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their…

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.

Presentations of smooth symmetry groups of differentiable stacks are studied within the framework of the weak 2-category of Lie groupoids, smooth principal bibundles, and smooth biequivariant maps. It is shown that principality of bibundles…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

We study a model theoretic context (finite thorn rank, NIP, with finitely satisfiable generics) which is a common generalization of groups of finite Morley rank and definably compact groups in o-minimal structures. We show that assuming…

I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one side is matched, for all possible preferences. I extend my…