Related papers: Toward categoricity for classes with no maximal mo…

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. We exhibit slices of the representation theory of $\Lambda$ that are always classifiable in stringent geometric terms. Namely, we prove that, for any…

Ordinal categorical data are widely collected in psychology, education, and other social sciences, appearing commonly in questionnaires, assessments, and surveys. Latent class models provide a flexible framework for uncovering unobserved…

The evidence lower bound (ELBO) is one of the most central objectives for probabilistic unsupervised learning. For the ELBOs of several generative models and model classes, we here prove convergence to entropy sums. As one result, we…

Suppose that $\lambda=\lambda^{<\lambda} \ge\aleph_0$, and we are considering a theory $T$. We give a criterion on $T$ which is sufficient for the consistent existence of $\lambda^{++}$ universal models of $T$ of size $\lambda^+$ for models…

The objective of the paper is to study accuracy of multi-class classification in high-dimensional setting, where the number of classes is also large ("large $L$, large $p$, small $n$" model). While this problem arises in many practical…

We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$, there exists a full satisfaction class $S_A \subset M^2$ such that $A$ is definable in $(M,S_A)$ without parametres. It…

Large language models (LLMs) demonstrate the capacity to reconstruct and trace learned content from their training data under specific elicitation conditions, yet this capability does not manifest in standard generation contexts. This…

We explore some properties of wide subcategories of the category mod$\,(\Lambda)$ of finitely generated left $\Lambda$-modules, for some artin algebra $\Lambda.$ In particular we look at wide finitely generated subcategories and give a…

We define a class of subsets of a topological space that coincides with the class of compact saturated subsets when the space is sober, and with enough good properties when the space is not sober. This class is introduced especially in view…

Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations…

This paper is part of a program initiated by Saharon Shelah to extend the model theory of first order logic to the non-elementary setting of abstract elementary classes (AECs). An abstract elementary class is a semantic generalization of…

We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The…

We study the behavior of the abstract sectional category in the Quillen, the Strom and the Mixed proper model structures on topological spaces and prove that, under certain reasonable conditions, all of them coincide with the classical…

This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…

We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…

We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

This survey paper is based on a talk given at the 44th Summer Symposium in Real Analysis in Paris. This line of research was initiated by a question of Haight and Weizs\"aker concerning almost everywhere convergence properties of series of…

We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…

Multivariate distributions often carry latent structures that are difficult to identify and estimate, and which better reflect the data generating mechanism than extrinsic structures exhibited simply by the raw data. In this paper, we…

We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…