Related papers: Two-sorted algebraic decompositions of Brookes's s…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
We introduce new modified Abelian lattice models, with inhomogeneous local interactions, in which a sum over topological sectors are included in the defining partition function. The dual models, on lattices with arbitrary topology, are…
We use Hidden Markov Models to motivate a quantitative compositional semantics for noninterference-based security with iteration, including a refinement- or "implements" relation that compares two programs with respect to their information…
We introduce the notion of brick-splitting torsion pairs as a modern analogue and generalization of the classical notion of splitting torsion pairs. A torsion pair is called brick-splitting if any given brick is either torsion or…
In Chapter 4 of [25] Triebel proved two theorems concerning pointwise multipliers and diffeomorphisms in function spaces of Besov and Triebel-Lizorkin type. In each case he presented two approaches, one via atoms and one via local means.…
For any graded bialgebras $A$ and $B$, we define a commutative graded algebra $A_B$ representing the functor of $B$-representations of $A$. When $A$ is a cocommutative graded Hopf algebra and $B$ is a commutative ungraded Hopf algebra, we…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…
These are the lecture notes based on earlier papers with some additional new results. New and simple proofs are given for local freeness theorem and the semipositivity theorem. A decomposition theorem for higher direct images of dualizing…
In this report I review some aspects of the algebraic structure of QFT related with the doubling of the degrees of freedom of the system under study. I show how such a doubling is related to the characterizing feature of QFT consisting in…
Deep Learning architectures, and in particular Transformers, are conventionally viewed as a composition of layers. These layers are actually often obtained as the sum of two contributions: a residual path that copies the input and the…
In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…
Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations. The efficiency of symbolic computation is largely constrained by such deep computations…
We introduce a probabilistic framework for two-sample comparison based on a nonparametric process taking the form of a Markov model that transitions between a "divide" and a "merge" state on a multi-resolution partition tree of the sample…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons. We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather…
We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…
When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce the connective implication to be everywhere defined and satisfying (left) adjointness with the connective…