7 papers
Finite versus uncountable convex lattices from point configurations
Carles Cardó
We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative latt…
On semigroups and groupoids with minimal probabilistic spectrum
Carles Cardó
The equational probabilistic spectrum of a finite algebra is the set of probabilities with which equations are satisfied in the algebra. We study algebras with minimal spectrum, th…
Probabilistic equational spectrum, primality and approximation in finite algebras
Carles Cardó
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of…
Convex hull lattices point generated
Carles Cardó
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obta…
Anti-Context-Free languages
Carles Cardó
Context-free languages can be characterized in several ways. This article studies projective linearisations of languages of simple dependency trees, i.e., dependency trees in which…
A look at the Kolmogorov complexity of finite groupoids and algebras
Carles Cardó
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. Th…
On semi-Peano algebras
Carles Cardó
A semi-Peano algebra is an algebra for which each operation is injective, and the images of the operations are pairwise disjoint. The most straightforward non-trivial kind of finit…