Related papers: Generic Stability Independence and Treeless theori…
We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…
In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an…
We show the theory of pointed $\R$-trees with radius at most $r$ is axiomatizable in a suitable continuous signature. We identify the model companion $\rbRT_r$ of this theory and study its properties. In particular, the model companion is…
Classical field theory is insensitive to the split of the field into a background configuration and a dynamical perturbation. In gauge theories, the situation is complicated by the fact that a covariant (w.r.t. the background field) gauge…
This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…
We investigate the short distance fate of distinct classes of not asymptotically free supersymmetric gauge theories. Examples include super QCD with two adjoint fields and generalised superpotentials, gauge theories without superpotentials…
The notions of bounded-size and quasibounded-size decompositions with bounded treedepth base classes are central to the structural theory of graph sparsity introduced by two of the authors years ago, and provide a characterization of both…
In the present work we suggest a general covariant theory which can be used to study the stability of any physical system treated geometrically. Stability conditions are connected to the magnitude of the deviation vector. This theory is a…
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence. Recently, a representation has been proposed that captures a set of dominant statements of an independence relation from…
For each lattice one can define a free boson theory propagating on the corresponding torus. We give an alternative definition where one employs any automorphism of the group $M^*/M$. This gives a wealth of conformal data, which we realize…
This is the second in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In the first work ("Gaussian free field on the tree subject to a hard wall I:…
Quantum field theories with quenched disorder are so hard to study that even exactly solvable free theories present puzzling aspects. We consider a free scalar field $\phi$ in $d$ dimensions coupled to a random source $h$ with quenched…
We extend the notion of a tree graph to sequences of prime graphs which are cycles and edges and name these non-chordal graphs hollow trees. These structures are especially attractive for palindromic Ising models, which mimic a symmetry of…
We study the problem of learning properties of nodes in tree structures. Those properties are specified by logical formulas, such as formulas from first-order or monadic second-order logic. We think of the tree as a database encoding a…
In this paper we generalize the higher-degree smoothness results in perturbation theory from the case that the stable maps have the fixed domain $S^2$ to the general genus zero case.
We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…
We revisit the existence, background independence and uniqueness of closed, open and open-closed bosonic- and topological string field theory, using the machinery of homotopy algebra. In a theory of classical open- and closed strings, the…
This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…