Related papers: LCLs in the Borel Hierarchy
This paper considers the combinatorics of continuous and Borel rectangular partitions of free actions of $\mathbb{Z}^n$ on $0$-dimensional Polish spaces, specifically the free part $F(2^{\mathbb{Z}^n})$ of the shift action of $\mathbb{Z}^n$…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
A proof labelling scheme for a graph class $\mathcal{C}$ is an assignment of certificates to the vertices of any graph in the class $\mathcal{C}$, such that upon reading its certificate and the certificates of its neighbors, every vertex…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
In the context of generalized descriptive set theory, we systematically compare and analyze various notions of Polish-like spaces and standard $\kappa$-Borel spaces for $\kappa$ an uncountable (regular) cardinal satisfying $\kappa^{<\kappa}…
Large Language Models (LLMs) have demonstrated remarkable abilities, one of the most important being in-context learning (ICL). With ICL, LLMs can derive the underlying rule from a few demonstrations and provide answers that comply with the…
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…
In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…
We study the free part of the Bernoulli action of $\mathbb{Z}^n$ for $n\geq 2$ and the Borel combinatorics of the associated Schreier graphs. We construct orthogonal decompositions of the spaces into marker sets with various additional…
It is known that the topology of a Polish group is uniquely determined by its Borel structure and group operations, but this does not give us a way to find the topology. In this article we expand on this theorem and give a criterion for a…
Latent Class Models (LCMs) are used to cluster multivariate categorical data (e.g. group participants based on survey responses). Traditional LCMs assume a property called conditional independence. This assumption can be restrictive,…
As Large Language Models (LLMs) become more powerful and autonomous, they increasingly face conflicts and dilemmas in many scenarios. We first summarize and taxonomize these diverse conflicts. Then, we model the LLM's preferences to make…
Causality is essential for understanding complex systems, such as the economy, the brain, and the climate. Constructing causal graphs often relies on either data-driven or expert-driven approaches, both fraught with challenges. The former…
Linear causal disentanglement is a recent method in causal representation learning to describe a collection of observed variables via latent variables with causal dependencies between them. It can be viewed as a generalization of both…
We show that every $d$-regular bipartite Borel graph admits a Baire measurable $k$-regular spanning subgraph if and only if $d$ is odd or $k$ is even. This gives the first example of a locally checkable coloring problem which is known to…
We introduce a new model-agnostic explanation technique which explains the prediction of any classifier called CLE. CLE gives an faithful and interpretable explanation to the prediction, by approximating the model locally using an…
In this paper a sampling theory for unitary invariant subspaces associated to locally compact abelian (LCA) groups is deduced. Working in the LCA group context allows to obtain, in a unified way, sampling results valid for a wide range of…
We show that large language models (LLMs) are remarkably good at working with interpretable models that decompose complex outcomes into univariate graph-represented components. By adopting a hierarchical approach to reasoning, LLMs can…
The Lov\'asz Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects. It is especially useful for colouring graphs and hypergraphs with bounded maximum degree. This paper presents a general…