Related papers: On some Fraisse limits with free amalgamation
Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…
We address the question of identifying degrees of freedom for quantum systems. Typically, quasi-particle descriptions of correlated matter are based upon the canonical algebras of bosons or fermions. Here we highlight that a special class…
We study a recently proposed quantum integrable model defined on a lattice with N sites, with Fermions or Bosons populating each site, as a close relative of the well known spin-1/2 Gaudin model. This model has 2N arbitrary parameters, a…
Big Ramsey degrees of Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages have been recently fully characterised by Balko, Chodounsk\'y, Dobrinen, Hubi\v{c}ka, Kone\v{c}n\'y, Vena, and Zucker. A…
We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
It is shown in this paper that the symplectic form for the system consisting of $D$-dimensional bulk Palatini gravity and SO$(1,1)$ BF theory on an isolated horizon as a boundary just contains the bulk term. An alternative quantization…
In "Random complex fewnomials, I," B. Shiffman and S. Zelditch determine the limiting formula as N goes to infinity of the (normalized) expected distribution of complex zeros of a system of k random n-nomials in m variables where the…
Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
The paper deals with the problem of existence of a convergent "strong" normal form in the neighbourhood of an equilibrium, for a finite dimensional system of differential equations with analytic and time-dependent non-linear term. The…
We consider a discrete one-dimensional random interface on the half-space whose height at any positive point is composed of a function of the heights at its two closest neighbours and an independent random noise background. In [AC24],…
The study of resonances (and well-posedness) for complex systems under time-periodic loading is of broad interest in application. The work of Galdi et al.~(2014) connects asymptotic stability of solutions to an unforced Cauchy problem to…
We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above…
We treat the problem of testing independence between m continuous variables when m can be larger than the available sample size n. We consider three types of test statistics that are constructed as sums or sums of squares of pairwise rank…
The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…