Related papers: Reducibility versus definability for pseudovarieti…

Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms…

We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the…

Let $G$ be a connected and simply connected semisimple algebraic group over $\Bbb Q$ and let $\Gamma\subset G(\Bbb Q)$ be an arithmetic subgroup. Let $K_\infty\subset G(\Bbb R)$ be a maximal compact subgroup and let $d$ be the dimension of…

Let $\alpha$, $\beta$, $\gamma, \dots$ $\Theta$, $\Psi, \dots$ $R$, $S$, $T, \dots$ be variables for, respectively, congruences, tolerances and reflexive admissible relations. Let juxtaposition denote intersection. We show that if the…

Inverse categories are categories in which every morphism x has a unique pseudo-inverse y in the sense that xyx=x and yxy=y. Persistence modules from topological data analysis and similarly decomposable category representations factor…

Let $G:=G_2(K)$ be a simple algebraic group of type $G_2$ defined over an algebraically closed field $K$ of characteristic $p>0$. Let $\sigma$ denote a standard Frobenius automorphism of $G$ such that $G_\sigma\cong G_2(q)$ with $q\geq 4$.…

Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…

Let $\mathcal{V}$ be a congruence permutable variety generated by a finite nilpotent algebra $\mathbf{A}$. If $\mathbf{A}$ is a product of algebras of prime power order, then the class $\mathcal{V}_\text{si}$ of subdirectly irreducible…

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

The common behaviour of many families of numerical semigroups led up to defining, firstly, the Frobenius varieties and, secondly, the (Frobenius) pseudo-varieties. However, some interesting families are still out of these definitions. To…

For semigroup $S$, a commutative congruence $\sigma_{orient}$ on $S$ and a subsemigroup Orientable($S$) of $S$ were introduced in "Two cancellative commutative congruences and group diagrams", Semigroup Forum (2011) 82: 338-353. Here we…

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…

Given a (complex, smooth) irreducible representation $\pi$ of the general linear group over a non-archimedean local field and an irreducible supercuspidal representation $\sigma$ of a classical group, we show that the (normalized) parabolic…

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

Let H be a pseudovariety of groups in which the kappa-word problem is decidable. Here, kappa denotes the canonical implicit signature, which consists of the multiplication and the (omega-1)-power. We prove that the kappa-word problem is…

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

We introduce some deformations of the biset category and prove a semisimplicity property. We also consider another group category, called the subgroup category, whose morphisms are subgroups of direct products, the composition being star…

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

Given a stratified variety X with strata satisfying a cohomological parity-vanishing condition, we define and show the uniqueness of "parity sheaves", which are objects in the constructible derived category of sheaves with coefficients in…