Related papers: Linear Relations of Finite Length Modules are Shif…
Differential logical relations are a method to measure distances between higher-order programs. They differ from standard methods based on program metrics in that differences between functional programs are themselves functions, relating…
We obtain a complete classification of all finite-dimensional irreducible modules over classical map superalgebras, provide formulas for their (super)characters and a description of their extension groups. Furthermore, we describe the block…
This paper is a detailed study of finite-dimensional modules defined on bicomplex numbers. A number of results are proved on bicomplex square matrices, linear operators, orthogonal bases, self-adjoint operators and Hilbert spaces, including…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
It is shown that every linear surjective isometry between two right, full, Hilbert C*-modules is a sum of two maps : a (bi-) module map (which is completely isometric and preserves the inner product) and a map that reverses the (bi-) module…
Finite-time coherent sets represent minimally mixing objects in general nonlinear dynamics, and are spatially mobile features that are the most predictable in the medium term. When the dynamical system is subjected to small parameter…
Linear Geometry describes geometric properties that depend on the fundamental notion of a line. In this paper we survey basic notions and results of Linear Geomery that depend on the flat hulls: flats, exchange, rank, regularity,…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
We describe the ringed-space structure of moduli spaces of jets of linear connections (at a point) as orbit spaces of certain linear representations of the general linear group. Then, we use this fact to prove that the only (scalar)…
We prove that if $B\subseteq A$ is an extension of finite dimensional algebras such that the projective dimension of $A/B$ as a $B$-bimodule is finite, if $A$ has finite finitistic dimension, then so does $B$. We exhibit examples…
This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…
Bijective correspondences are established between (1) silting objects, (2) simple-minded collections, (3) bounded $t$-structures with length heart and (4) bounded co-$t$-structures. These correspondences are shown to commute with mutations.…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We exhibit a set of generating relations for the modular invariant ring of a vector and a covector for the two-dimensional general linear group over a finite field.
Modulated symmetries are internal symmetries that are not invariant under spacetime symmetry actions. We propose a general way to describe the lattice translation modulated symmetries in 1+1D, including the non-invertible ones, via the…
On contact manifolds we describe a notion of (contact) finite-type for linear partial differential operators satisfying a natural condition on their leading terms. A large class of linear differential operators are of finite-type in this…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
A portrait is a combinatorial model for a discrete dynamical system on a finite set. We study the geometry of portrait moduli spaces, whose points correspond to equivalence classes of point configurations on the affine line for which there…
Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…