Related papers: Reducibility versus definability for pseudovarieti…
Many widely different problems have a common mathematical structure wherein limited knowledge lead to ambiguity that can be captured conveniently using a concept of invisibility that requires the introduction of negative values for…
Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
It is known that if every group satisfying an identity of the form yx ~ xU(x,y)y is abelian, so is every semigroup that satisfies that identity. Because a group has an identity element and the cancellation property, it is easier to show…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We provide a complete description of the category of pseudo-categories (including pseudo-functors, natural and pseudo-natural transformations and pseudo modifications). A pseudo-category is a non strict version of an internal category. It…
We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…
A subvariety of a quasi-projective complex variety $X$ is called ``universally irreducible'' if its preimage inside the universal cover of $X$ is irreducible. In this paper we investigate sufficient conditions for universal irreducibility.…
In a compound decision problem, consisting of $n$ statistically independent copies of the same problem to be solved under the sum of the individual losses, any reasonable compound decision rule $\delta$ satisfies a natural symmetry…
Let gamma be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in gamma is in Logspace or complete for the class CSP(gamma)_NP under…
Crisp and lattice-valued ambiguous representations of one continuous semilattice in another one are introduced and operation of taking pseudo-inverse of the above relations is defined. It is shown that continuous semilattices and their…
We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…
Let $G_\cpl$ be a connected complex reductive Lie group, and $G$ be a real form. Let $(\pi,V)$ be a finite-dimensional irreducible representation of $G$. Assume $(\pi,V)$ admits a $G$ invariant hermitian form. {In…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
A subvariety of a complex projective space has a well-known dual variety, which is the set of its tangent hyperplanes. The purpose of this paper is to generalise this notion for a subvariety of a quite general partial flag variety. A…
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…
In this short note, we establish a quantitative description of the genericity of transversality of $C^1$-submanifolds in $\mathbb{R}^n$: Let $\Sigma \subset \mathbb{R}^n$ be a $d$-dimensional $C^1$-embedded submanifold where $n \geq d+1$.…
Model theoretic internality provides conditions under which the group of automorphisms of a model over a reduct is itself a definable group. In this paper we formulate a categorical analogue of the condition of internality, and prove an…
Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…
We give an algebraic characterization of the syntax and semantics of a class of languages with variable binding. We introduce a notion of 2-signature: such a signature specifies not only the terms of a language, but also reduction rules on…