Related papers: Comment on "Typicality for Generalized Microcanoni…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
Archetypal analysis serves as an exploratory tool that interprets a collection of observations as convex combinations of pure (extreme) patterns. When these patterns correspond to actual observations within the sample, they are termed…
One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions
We prove two-term supercongruences for generalizations of recently discovered sporadic sequences of Cooper. We also discuss recent progress and future directions concerning other types of supercongruences.
We prove the finiteness of $B$-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation.…
We introduce the notion of $\mathcal{C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and…
We give a complete and careful proof of Quillen's theorem on the existence of the standard model category structure on the category of topological spaces. We do not assume any familiarity with model categories.
We give a model-theoretic characterization of the class of geometric theories classified by an atomic topos having enough points; in particular, we show that every complete geometric theory classified by an atomic topos is countably…
Motivated by the analysis and geometry of metric-measure structures in infinite dimensions, we study the category of extended metric-topological spaces, along with many of its distinguished subcategories (such as the one of compact spaces).…
We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
Ensembles, as a widely used and effective technique in the machine learning community, succeed within a key element -- "diversity." The relationship between diversity and generalization, unfortunately, is not entirely understood and remains…
I review the classical theory of likelihood based inference and consider how it is being extended and developed for use in complex models and sampling schemes.
A categoricity theorem is established for patterns of resemblance of order 2 showing that the order in which patterns arise in a wide range of hierarchies is the same.
We describe the "generic" part of the character ring of general linear groups over a finite field in terms of quiver representations.
These are extended notes of a course given at Tulane University for the 2015 Clifford Lectures. Their aim is to present structure results for group schemes of finite type over a field, with applications to Picard varieties and automorphism…
Topos properties of the category of covering groupoids over a fixed groupoid are discussed. A classification result for connected covering groupoids over a fixed groupoid analogous to the fundamental theorem of Galois theory is given.
We consider the group property of being icc. We give several examples of icc groups and study its stability under usual algebraic constructions.
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…