Related papers: An NIP-like Notion in Abstract Elementary Classes

A C*-algebra is said to be K-stable if its nonstable K-groups are naturally isomorphic to the usual K-theory groups. We study continuous $C(X)$-algebras, each of whose fibers are K-stable. We show that such an algebra is itself K-stable…

Kirchberg's Embedding Problem (KEP) asks whether every separable C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In this paper, we use model theory to show that this conjecture is equivalent to a local…

Given a simple undirected graph, one can construct from it a $c$-step nilpotent Lie algebra for every $c \geq 2$ and over any field $K$, in particular also over the real and complex numbers. These Lie algebras form an important class of…

We discuss measures, invariant measures on definable groups, and genericity, often in an NIP (failure of the independence property) environment. We complete the proof of the third author's conjectures relating definably compact groups $G$…

Answer Set Programming (ASP) is a prominent problem-modeling and solving framework, whose solutions are called answer sets. Epistemic logic programs (ELP) extend ASP to reason about all or some answer sets. Solutions to an ELP can be seen…

In this paper, by introducing a wider class of one-parameter group actions for test configurations, we have a stronger form of the definition of K-stability. This allows us to obtain some key step of my preceding work in proving that…

SkipGram word embedding models with negative sampling, or SGN in short, is an elegant family of word embedding models. In this paper, we formulate a framework for word embedding, referred to as Word-Context Classification (WCC), that…

We complete the classification of positive rank gradings on Lie algebras of simple algebraic groups over an algebraically closed field k whose characteristic is zero or not too small, and we determine the little Weyl groups in each case. We…

We extend our previous algebraic formalisation of the notion of component-based framework in order to formally define two forms, strong and weak, of the notion of full expressiveness. Our earlier result shows that the BIP…

We prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic $p$ which give sufficient conditions for the algebras to be of the form $[R^{(-)}, R^{(-)}] / (Z(R)…

Abstract predicates are considered in this paper as abstraction technique for heap-separated configurations, and as genuine Prolog predicates which are translated straight into a corresponding formal language grammar used as validation…

B. Blackadar recently proved that any full corner $pAp$ in a unital C*-algebra $A$ has K-theoretic stable rank greater than or equal to the stable rank of $A$. (Here $p$ is a projection in $A$, and fullness means that $ApA=A$.) This result…

An IP-space is a pseudomanifold whose defining local properties imply that its middle perversity global intersection homology groups satisfy Poincar\'e duality integrally. We show that the symmetric signature induces a map of Quinn spectra…

We prove an analogue of the Gabriel--Quillen embedding theorem for exact $\infty$-categories, giving rise to a presentable version of Klemenc's stable envelope of an exact $\infty$-category. Moreover, we construct a symmetric monoidal…

We show that a simple separable unital nuclear nonelementary $C^*$-algebra whose tracial state space has a compact extreme boundary with finite covering dimension admits uniformly tracially large order zero maps from matrix algebras into…

State-of-the-art NLP methods achieve human-like performance on many tasks, but make errors nevertheless. Characterizing these errors in easily interpretable terms gives insight into whether a classifier is prone to making systematic errors,…

Assumption-based Argumentation (ABA) is advocated as a unifying formalism for various forms of non-monotonic reasoning, including logic programming. It allows capturing defeasible knowledge, subject to argumentative debate. While, in much…

We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced…

We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…

Standard next-token prediction (NTP) supervises language models solely through discrete labels in the output logit space. We argue that this sparse one-hot supervision leaves the latent representation space under-constrained, allowing…