相关论文: Tokens: An Algebraic Construction Common in Combin…

The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…

Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…

The failure of distributivity in quantum logic is motivated by the principle of quantum superposition. However, this principle can be encoded differently, i.e., in different logico-algebraic objects. As a result, the logic of experimental…

The paper is an overview of recent results on algebraic structures (semigroups, groupoids, algebras, inverse semigroups, and groups) associated with objects with a rich set of partial symmetries. We discuss etale groupoids and inverse…

Motivated by recent appearance of multivalued structures in categorification, tropical geometry and other areas, we study basic properties of abstract multisemigroups. We give many new and old examples and general constructions for…

For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent…

The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some…

Two successive generalizations of the usual tensor products are given. One can be constructed for arbitrary binary operations, and not only for semigroups, groups or vector spaces. The second one, still more general, is constructed for…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…

We introduce and study a class of betweenness algebras-Boolean algebras with binary operators, closely related to ternary frames with a betweenness relation. From various axioms for betweenness, we chose those that are most common, which…

In a previous article by two of the present authors and S. Bonzio, \L ukasiewicz near semirings were introduced and it was proven that basic algebras can be represented (precisely, are term equivalent to) as near semirings. In the same work…