Related papers: An axiomatic approach to free amalgamation
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
This talk is organized as follows: First we explain some basic concepts in non-commutative probability theory in the frame of operator algebras. In Section 2, we discuss related topics in von Neumann algebras. Sections 3 and 4 contain some…
Over an arbitrary field $\mathbb{F}$, let $p$ and $q$ be monic polynomials with degree $2$ in $\mathbb{F}[t]$. The free Hamilton algebra of the pair $(p,q)$ is the free noncommutative algebra in two generators $a$ and $b$ subject only to…
The possible tensor constructions of open string theories are analyzed from first principles. To this end the algebraic framework of open string field theory is clarified, including the role of the homotopy associative A_\infty algebra, the…
The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on…
We give a geometric proof of a well known theorem that describes splittings of a free group as an amalgamated product or HNN extension over the integers. The argument generalizes to give a similar description of splittings of a virtually…
Using an infinitary version of the Hypergraph Removal Lemma due to Towsner, we prove a model-theoretic higher amalgamation result. In particular, we obtain an independent amalgamation property which holds in structures which are measurable…
We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
In this work, we translate at the level of decorated trees some of the crucial arguments which have been used in arXiv:2112.10739 for proposing a diagram-free approach for the convergence of the model in Regularity Structures. This allows…
Tent and Ziegler proved that the automorphism group of the Urysohn sphere is simple and that the automorphism group of the Urysohn space is simple modulo bounded automorphisms. A key component of their proof is the definition of a…
We prove an analogue of the Magnus theorem for associative algebras without unity over arbitrary fields. Namely, if an algebra is given by n+k generators and k relations and has an n-element system of generators, then this algebra is a free…
We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
A metaphor of Loday describes Lie, associative, and commutative associative algebras as ``the three graces'' of the operad theory. In this article, we study the three graces in the category of $\mathfrak{sl}_2$-modules that are sums of…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
By providing a procedure to apply Hrushovski's amalgamation method to the setting of classes of infinite structures, we introduce the notion of \textit{paracollapsed} structures. We show that this approach provides existentially closed…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…