Related papers: The Geometry of L^k-Canonization I: Rosiness from …
Pure $T\bar{T}$ deformations of conformal field theories are generally asymptotically incomplete in the ultra-violet (UV) due to square-root singularities in the ground state energy on a cylinder of circumference $R$, such that the theory…
In this note we continue our development of tannakizations of symmetric monoidal infinity-categories, begun in our previous paper. The issue treated in this paper is the calculation of tannakizations of examples of symmetric monoidal stable…
We show that every finitely generated conical refinement monoid can be represented as the monoid $\mathcal V(R)$ of isomorphism classes of finitely generated projective modules over a von Neumann regular ring $R$. To this end, we use the…
Theory of Kingman's partition structures has two culminating points: the general paintbox representation, relating finite partitions to hypothetical infinite populations via a natural sampling procedure, known as Kingman's paintbox; a…
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…
In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…
We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…
We study a model theoretic context (finite thorn rank, NIP, with finitely satisfiable generics) which is a common generalization of groups of finite Morley rank and definably compact groups in o-minimal structures. We show that assuming…
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…
We show that the twisted K-theory of the classifying space of a p-local finite group is isomorphic to the completion of the Grothendieck group of twisted representations of the fusion system with respect to the augmentation ideal of the…
We compare four different types of realizability for saturated fusion systems over discrete $p$-toral groups. For example, when $G$ is a locally finite group all of whose $p$-subgroups are artinian (hence discrete $p$-toral), we show that…
Let S be a polynomial ring over a field of characteristic zero in finitely may variables. Let T be an unramified, finitely generated extension of S with $T^\times = k^\times$. Then T = S.
If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…
In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…
Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…
We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.
We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…
Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…
Shininess and strong politeness are properties related to theory combination procedures. In a paper titled "Many-sorted equivalence of shiny and strongly polite theories", Casal and Rasga proved that for decidable theories, these properties…