Related papers: Conant-independence and generalized free amalgamat…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
For a complete, stable theory $T$ we construct, in a reasonably canonical way, a related stable theory $T^*$ which has higher independent amalgamation properties over the algebraic closure of the empty-set. The theory $T^*$ is an algebraic…
In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions. We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
Hom gives an example of a knot with vanishing Upsilon invariant but nonzero epsilon invariant. We build more such knots that are linearly independent in the smooth concordance group.
The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…
A necessary and suffcient condition for Pitman's asymptotic relative effciency (ARE) of the Kendall and Spearman correlation statistics for the independence test to be 1 is given, in terms of certain smoothness and nondegeneracy properties…
Consider $d$ dependent change point tests, each based on a CUSUM-statistic. We provide an asymptotic theory that allows us to deal with the maximum over all test statistics as both the sample size $n$ and $d$ tend to infinity. We achieve…
The path integral approach for a 3D Chern-Simons theory is discussed with a focus on the question of metric independence and BRST-exactness in the light of Gribov ambiguity. Copies of the vacuum satisfying the strong boundary conditions and…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
We present here some connections between the liberation process for projections $(P,Q)\mapsto(P,U_tQU_t^*)$ and its counterpart $(R,S)\mapsto(R,U_tSU_t^*)$ for symmetries when the projections $\{P,Q\}$ and the symmetries $\{R,S\}$ are…
We produce infinite families of knots $\{K^i\}_{i\geq 1}$ for which the set of cables $\{K^i_{p,1}\}_{i,p\geq 1}$ is linearly independent in the knot concordance group. We arrange that these examples lie arbitrarily deep in the solvable and…
This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs. The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties. The…
The $k$-dimensional functional order property ($\text{FOP}_k$) is a combinatorial property of a $(k+1)$-partitioned formula. This notion arose in work of Terry and Wolf, which identified $\text{NFOP}_2$ as a ternary analogue of stability in…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
We realize the Belinschi-Nica semigroup of homomorphisms as a free multiplicative subordination. This realization allows to define more general semigroups of homomorphisms with respect to free multiplicative convolution. For these…
The free energy of U(N) gauge theory is expanded about a center-symmetric topological background configuration with vanishing action and vanishing Polyakov loops. We construct this background for SU(N) lattice gauge theory and show that it…
This paper formalizes connections between stability of polynomials and convergence rates of Markov Chain Monte Carlo (MCMC) algorithms. We prove that if a (multivariate) partition function is nonzero in a region around a real point…
In the context of planar holography, integrability plays an important role for solving certain massless quantum field theories such as N=4 SYM theory. In this letter we show that integrability also features in the building blocks of massive…
In 2006 Sommers and Tymoczko defined so called arrangements of ideal type A_I stemming from ideals I in the set of positive roots of a reduced root system. They showed in a case by case argument that A_I is free if the root system is of…