Related papers: Stratified Algebra
We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…
Autonomous systems require the management of several model views to assure properties such as safety and security among others. A crucial issue in autonomous systems design assurance is the notion of emergent behavior; we cannot use their…
A twisted commutative algebra is (for us) a commutative $\mathbf{Q}$-algebra equipped with an action of the infinite general linear group. In such algebras the "$\mathbf{GL}$-prime" ideals assume the duties fulfilled by prime ideals in…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
We construct some new Integrable Systems (IS) both classical and quantum associated with elliptic algebras. Our constructions are partly based on the algebraic integrability mechanism given by the existence of commuting families in skew…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…
Our theoretical understanding of deep learning has not kept pace with its empirical success. While network architecture is known to be critical, we do not yet understand its effect on learned representations and network behavior, or how…
An associative $*$-algebra is introduced (containing a $TTR$-algebra as a subalgebra) that implements the form factor axioms, and hence indirectly the Wightman axioms, in the following sense: Each $T$-invariant linear functional over the…
Citation and coauthor networks offer an insight into the dynamics of scientific progress. We can also view them as representations of a causal structure, a logical process captured in a graph. From a causal perspective, we can ask questions…
A definition of a quantum vertex algebra, which is a deformation of a vertex algebra, was proposed by Etingof and Kazhdan in 1998. In a nutshell, a quantum vertex algebra is a braided state-field correspondence which satisfies associativity…
We propose and analyze a novel theoretical and algorithmic framework for structured prediction. While so far the term has referred to discrete output spaces, here we consider more general settings, such as manifolds or spaces of probability…
This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned with the dynamical process acting on top of the network. We…
We use the annealed formulation of complex networks to study the dynamical behavior of disease spreading on both static and adaptive networked systems. This unifying approach relies on the annealed adjacency matrix, representing one network…
Graphs provide a natural representation of relational structure that arises across diverse domains. Despite this ubiquity, graph structure is typically learned in a modality- and task-isolated manner, where graph representations are…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
We develop a framework for applying treewidth-based dynamic programming on graphs with "hybrid structure", i.e., with parts that may not have small treewidth but instead possess other structural properties. Informally, this is achieved by…
In recent contributions, algebraic multigrid methods have been designed and studied from the viewpoint of the spectral complementarity. In this note we focus our efforts on specific applications and, more precisely, on large linear systems…
Large language models (LLMs) offer a new empirical setting in which long-standing theories of linguistic meaning can be examined. This paper contrasts two broad approaches: social constructivist accounts associated with language games, and…