Related papers: Algebraic Theory of Patterns as Generalized Symmet…
Existing symmetry discovery methods predominantly focus on global transformations across the entire system or space, but they fail to consider the symmetries in local neighborhoods. This may result in the reported symmetry group being a…
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…
Symmetric functions, which take as input an unordered, fixed-size set, are known to be universally representable by neural networks that enforce permutation invariance. These architectures only give guarantees for fixed input sizes, yet in…
Machine learning often aims to produce latent embeddings of inputs which lie in a larger, abstract mathematical space. For example, in the field of 3D modeling, subsets of Euclidean space can be embedded as vectors using implicit neural…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
While a real-world research program in mathematics may be guided by a motivating question, the process of mathematical discovery is typically open-ended. Ideally, exploration needed to answer the original question will reveal new…
A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…
Equivariant neural networks incorporate symmetries through group actions, embedding them as an inductive bias to improve performance. Existing methods learn an equivariant action on the latent space, or design architectures that are…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…
We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…
In this note, we outline the general development of a theory of symmetric homology of algebras, an analog of cyclic homology where the cyclic groups are replaced by symmetric groups. This theory is developed using the framework of crossed…
Semi-algebraic priors are ubiquitous in signal processing and machine learning. Prevalent examples include a) linear models where the signal lies in a low-dimensional subspace; b) sparse models where the signal can be represented by only a…
In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency. While…
In this paper we apply a recently proposed algebraic theory of integration to projective group algebras. These structures have received some attention in connection with the compactification of the $M$ theory on noncommutative tori. This…
Patterns embody repeating phenomena, and, as such, they are partly but not fully detachable from their context. 'Design patterns' and 'pattern languages' are established methods for working with patterns. They have been applied in…
The supercharacter theory of algebra groups gave us a representation theoretic realization of the Hopf algebra of symmetric functions in noncommuting variables. The underlying representation theoretic framework comes equipped with two…
We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…
A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Using the notion of a gauge connection on a flat superspace, we construct a general class of noncommutative ($D=2,$ $\mathcal{N}=1$) supertranslation algebras generalizing the ordinary algebra by inclusion of some new bosonic and fermionic…