Related papers: Algebraic foundations for qualitative calculi and …
Let $G$ be a countable group. We introduce several equivalence relations on the set ${\rm Sub}(G)$ of subgroups of $G$, defined by properties of the quasi-regular representations $\lambda_{G/H}$ associated to $H\in {\rm Sub}(G)$ and compare…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
Quantification is well known to be a major obstacle in the construction of a probabilistic network, especially when relying on human experts for this purpose. The construction of a qualitative probabilistic network has been proposed as an…
We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.
In recent times a new kind of representations has been used to describe superselection sectors of the observable net over a curved spacetime, taking into account of the effects of the fundamental group of the spacetime. Using this notion of…
Convolutional neural networks often dominate fully-connected counterparts in generalization performance, especially on image classification tasks. This is often explained in terms of 'better inductive bias'. However, this has not been made…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to…
Let $G$ be a real Lie group with Lie algebra $\mathfrak g$. Given a unitary representation $\pi$ of $G$, one obtains by differentiation a representation $d\pi$ of $\mathfrak g$ by unbounded, skew-adjoint operators. Representations of…
Families of representations of suitable Banach algebras provide a powerful tool in the study of the spectral theory of (pseudo)differential operators and of their Fredholmness. We introduce the new concept of an exhausting family of…
Recent work has argued that neural networks can be understood theoretically by taking the number of channels to infinity, at which point the outputs become Gaussian process (GP) distributed. However, we note that infinite Bayesian neural…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
This article presents a theory for constructing hierarchical networks in such a way that the networks are guaranteed to be provably scale covariant. We first present a general sufficiency argument for obtaining scale covariance, which holds…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra.…