Searcharxiv⌕ Search

arXiv subjects

Bruno Teheux

Publications and source records attributed to Bruno Teheux.

At least 19 recordsLinked to original sources
arXiv2025

The simplicity of complexity: a story of mathematical outreach

Mathematics is often perceived as difficult or inaccessible, yet meaningful engagement can arise in unexpected places. In this article we describe a multi-year exploration of mathematical outreach through games, puzzles, exhibitions, and artistic activities. Starting from a small science festival exhibit, our work developed into a broad collection of experiences showcased at game festivals, museums, and the World Expos in Dubai (2021/2022) and Osaka (2025). We discuss the principles that shaped these activities -- simplicity, atmosphere, mediation, and progressive depth -- and how mathematical ideas from topology, geometry, and logic can be incorporated into playful and creative formats. The story illustrates how low-threshold engagement and carefully designed experiences can open doors to research-level mathematics for audiences of all ages and backgrounds.

math.HO↗
arXiv2023

New perspectives on semi-primal varieties

We study varieties generated by semi-primal lattice-expansions by means of category theory. We provide a new proof of the Keimel-Werner topological duality for such varieties and, using similar methods, establish its discrete version. We describe multiple adjunctions between the variety of Boolean algebras and the variety generated by a semi-primal lattice-expansion, both on the topological side and explicitly algebraic. In particular, we show that the Boolean skeleton functor has two adjoints, both defined by taking certain Boolean powers, and we identify properties of these adjunctions which fully characterize semi-primality of an algebra. Lastly, we give a new characterization of canonical extensions of algebras in semi-primal varieties in terms of their Boolean skeletons.

math.LO↗
arXiv2023

Many-valued coalgebraic logic over semi-primal varieties

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal algebra. We show that this can be extended to a technique to lift classical coalgebraic logics to many-valued ones, and that (one-step) completeness and expressivity are preserved under this lifting. For specific classes of endofunctors, we also describe how to obtain an axiomatization of the lifted many-valued logic directly from an axiomatization of the original classical one. In particular, we apply all of these techniques to classical modal logic.

cs.LO↗
arXiv2022

The Minor Order of Homomorphisms via Natural Dualities

We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. We characterize the minor homomorphism posets of finite algebras in terms of disjoint unions of dual partition lattices and investigate reconstruction problems for homomorphisms.

math.CO↗
arXiv2019

Extending maps to profinite completions in finitely generated quasivarieties

We consider the problem of extending maps from algebras to their profinite completions in finitely generated quasivarieties. Our developments are based on the construction of the profinite completion of an algebra as its natural extension. We provide an extension which is a multi-map and we study its continuity properties, and the conditions under which it is a map.

math.RA↗
arXiv2018

Classifications of quasitrivial semigroups

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups, we address and solve several related enumeration problems.

math.RA↗
arXiv2018

Associative, idempotent, symmetric, and order-preserving operations on chains

We characterize the associative, idempotent, symmetric, and order-preserving operations on (finite) chains in terms of properties of (the Hasse diagram of) their associated semilattice order. In particular, we prove that the number of associative, idempotent, symmetric, and order-preserving operations on an $n$-element chain is the $n^{\text{th}}$ Catalan number.

math.RA↗
arXiv2018

A generalization of the concept of distance based on the simplex inequality

We introduce and discuss the concept of \emph{$n$-distance}, a generalization to $n$ elements of the classical notion of distance obtained by replacing the triangle inequality with the so-called simplex inequality $$ d(x_1, \ldots, x_n)~\leq~K\, \sum_{i=1}^n d(x_1, \ldots, x_n)_i^z{\,}, \qquad x_1, \ldots, x_n, z \in X, $$ where $K=1$. Here $d(x_1,\ldots,x_n)_i^z$ is obtained from the function $d(x_1,\ldots,x_n)$ by setting its $i$th variable to $z$. We provide several examples of $n$-distances, and for each of them we investigate the infimum of the set of real numbers $K\in\left]0,1\right]$ for which the inequality above holds. We also introduce a generalization of the concept of $n$-distance obtained by replacing in the simplex inequality the sum function with an arbitrary symmetric function.

math.MG↗
arXiv2017

Pivotal decomposition schemes inducing clones of operations

We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations are clones, and show that under certain assumptions these conditions are also necessary. In the latter case, the pivotal operation together with the constant operations generate the corresponding clone.

math.RA↗
arXiv2016

On the generalized associativity equation

The so-called generalized associativity functional equation G(J(x,y),z) = H(x,K(y,z)) has been investigated under various assumptions, for instance when the unknown functions G, H, J, and K are real, continuous, and strictly monotonic in each variable. In this note we investigate the following related problem: given the functions J and K, find every function F that can be written in the form F(x,y,z) = G(J(x,y),z) = H(x,K(y,z)) for some functions G and H. We show how this problem can be solved when any of the inner functions J and K has the same range as one of its sections.

math.RA↗
arXiv2016

Conservative median algebras and semilattices

We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological structures, we obtain descriptions of the median-preserving mappings between products of finitely many chains.

math.RA↗
arXiv2016

Strongly barycentrically associative and preassociative functions

We study the property of strong barycentric associativity, a stronger version of barycentric associativity for functions with indefinite arities. We introduce and discuss the more general property of strong barycentric preassociativity, a generalization of strong barycentric associativity which does not involve any composition of functions. We also provide a generalization of Kolmogoroff-Nagumo's characterization of the quasi-arithmetic mean functions to strongly barycentrically preassociative functions.

math.RA↗
arXiv2016

A characterization of barycentrically preassociative functions

We provide a characterization of the variadic functions which are barycentrically preassociative as compositions of length-preserving associative string functions with one-to-one unary maps. We also discuss some consequences of this characterization.

math.RA↗
arXiv2015

Modal Extensions of Łukasiewicz Logic for Modeling Coalitional Power

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose states may correspond to different game forms. The two classes of effectivity functions studied are the families of playable and truly playable effectivity functions, respectively. In this paper we generalize the concept of effectivity function beyond the yes/no truth scale. This enables us to describe the situations in which the coalitions assess their effectivity in degrees, based on functions over the outcomes taking values in a finite Łukasiewicz chain. Then we introduce two modal extensions of Łukasiewicz finite-valued logic together with many-valued neighborhood semantics in order to encode the properties of many-valued effectivity functions associated with game forms. As our main results we prove completeness theorems for the two newly introduced modal logics.

math.LO↗
arXiv2015

Modal definability based on Łukasiewicz validity relations

We study two notions of definability for classes of relational structures based on modal extensions of Łukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these notions of definability.

math.LO↗
arXiv2015

Relaxations of associativity and preassociativity for variadic functions

In this paper we consider two properties of variadic functions, namely associativity and preassociativity, that are pertaining to several data and language processing tasks. We propose parameterized relaxations of these properties and provide their descriptions in terms of factorization results. We also give an example where these parameterized notions give rise to natural hierarchies of functions and indicate their potential use in measuring the degrees of associativeness and preassociativeness. We illustrate these results by several examples and constructions and discuss some open problems that lead to further directions of research.

math.GR↗
arXiv2015

Barycentrically associative and preassociative functions

We investigate the barycentric associativity property for functions with indefinite arities and discuss the more general property of barycentric preassociativity, a generalization of barycentric associativity which does not involve any composition of functions. We also provide a generalization of Kolmogoroff-Nagumo's characterization of the quasi-arithmetic mean functions to barycentrically preassociative functions.

math.RA↗