Related papers: Tameness, Uniqueness and amalgamation
The aim of this paper is to unify classification theories of torsion classes of finite dimensional algebras and commutative Noetherian rings. For a commutative Noetherian ring $R$ and a module-finite $R$-algebra $\Lambda$, we study the set…
Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…
In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…
We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…
Convolutional neural networks and supervised learning have achieved remarkable success in various fields but are limited by the need for large annotated datasets. Few-shot learning (FSL) addresses this limitation by enabling models to…
In this article we address the first part of the programme presented in \cite{Teleman_arXiv_III}, \S 2; we construct the local $K$- theory level of the index formula. Our construction is sufficiently general to encompass the algebra of…
Compatible equations, Singularities of solutions, Topological charges and quasi-charges. PhD thesis (translated frorm Russian). The book shows the sights of Absolute Parallelism (AP), and contains useful information on the problem of…
It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…
Data assimilation is a Bayesian inference process that obtains an enhanced understanding of a physical system of interest by fusing information from an inexact physics-based model, and from noisy sparse observations of reality. The…
We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…
This study presents a semi-nonparametric Latent Class Choice Model (LCCM) with a flexible class membership component. The proposed model formulates the latent classes using mixture models as an alternative approach to the traditional random…
We analyse the set of matrices in SL$_3(\mathbb{F}_7)$ without eigenvalues explicitly, extracting nice bijections between the 18 equally sized conjugacy classes contained within. In doing so, we discover a set of $18$ commuting matrices for…
We provide a self-contained introduction to the classical theory of universal-homogeneous models (also known as generic structures, rich models, or Fra\"iss\'e limits). In the literature, most treatments restrict consideration to embeddings…
Sparse autoencoders (SAEs) are used to analyze embeddings, but their role and practical value are debated. We propose a new perspective on SAEs by demonstrating that they can be naturally understood as topic models. We propose a continuous…
We apply some methods of homology and K-theory to special classes of branes wrapping homologically nontrivial cycles. We treat the classification of four-geometries in terms of compact stabilizers (by analogy with Thurston's classification…
We establish a connection between the representation theory of certain noncommutative singular varieties and two-dimensional lattice models. Specifically, we consider noncommutative biparametric deformations of the fiber product of two…
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formalize the semantics of recursive programs in many-sorted…
Through abelian categories, homological lemmas for modules admit a self-dual treatment, where half of the proof of a lemma is sufficient to prove the full lemma. In this paper, we show how the context of a `noetherian form', recently…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…