Related papers: Lambda-calculus and Reversible Automatic Combinato…
When the inverse of an algorithm is well-defined -- that is, when its output can be deterministically transformed into the input producing it -- we say that the algorithm is invertible. While one can describe an invertible algorithm using a…
We revisit Deep Linear Discriminant Analysis (Deep LDA) from a likelihood-based perspective. While classical LDA is a simple Gaussian model with linear decision boundaries, attaching an LDA head to a neural encoder raises the question of…
Normalizing flows are a widely used class of latent-variable generative models with a tractable likelihood. Affine-coupling (Dinh et al, 2014-16) models are a particularly common type of normalizing flows, for which the Jacobian of the…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
We give a combinatorial construction, not involving a presentation, of almost all untwisted affine Kac--Moody algebras modulo their one-dimensional centres in terms of signed raising and lowering operators on a certain distributive lattice…
We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…
We study possible decompositions of totally decomposable algebras with involution, that is, tensor products of quaternion algebras with involution. In particular, we are interested in decompositions in which one or several factors are the…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
The article is a contribution to the local theory of geometric Langlands correspondence. The main result is a categorification of the isomorphism between the (extended) affine Hecke algebra, thought of as an algebra of Iwahori bi-invariant…
We investigate the application of ensemble transform approaches to Bayesian inference of logistic regression problems. Our approach relies on appropriate extensions of the popular ensemble Kalman filter and the feedback particle filter to…
Using the Rost invariant for non split simply connected groups, we define a relative degree $3$ cohomological invariant for pairs of orthogonal or unitary involutions having isomorphic Clifford or discriminant algebras. The main purpose of…
Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…
In this paper all of the classical constructions of A. Young are generalized to affine Hecke algebras of type A. It is proved that the calibrated irreducible representations of the affine Hecke algebra are indexed by placed skew shapes and…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
C$_{\lambda}$-extended oscillator algebras, where C$_{\lambda}$ is the cyclic group of order $\lambda$, are introduced and realized as generalized deformed oscillator algebras. For $\lambda=2$, they reduce to the well-known…
This work exploits the logical foundation of session types to determine what kind of type discipline for the pi-calculus can exactly capture, and is captured by, lambda-calculus behaviours. Leveraging the proof theoretic content of the…
For a complete lattice $L$ and a relational structure $\mathfrak{X}=(X,(R_i)_I)$, we introduce the convolution algebra $L^{\mathfrak{X}}$. This algebra consists of the lattice $L^X$ equipped with an additional $n_i$-ary operation $f_i$ for…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…
For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…