Related papers: Strong additivity and conformal nets
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…
We show explicitly how a strongly coupled fixed point can be constructed in scalar $g\varphi^4$ theory from the solutions to a non-linear eigenvalue problem. The fixed point exists only for $d< 4$, is unstable and characterized by $\nu=2/d$…
In this paper we study representations of conformal nets associated with positive definite even lattices and their orbifolds with respect to isometries of the lattices. Using previous general results on orbifolds, we give a list of all…
The theory of community structure is a powerful tool for real networks, which can simplify their topological and functional analysis considerably. However, since community detection methods have random factors and real social networks…
Suppose that a binary operation $\circ$ on a finite set $X$ is injective in each variable separately and also associative. It is easy to prove that $(X,\circ)$ must be a group. In this paper we examine what happens if one knows only that a…
We show that, under some technical conditions, the Strong Slope Conjecture proposed by Kalfagianni and Tran is closed under connect sums and cabling. As an application, we establish the Strong Slope Conjecture for graph knots.
Analytic structure in the strong coupling constant that emerges for some observables in QCD after duality averaging of renormalization group improved amplitudes is discussed. It is shown that perturbation theory calculations are justified…
One aim of this paper is to develop some aspects of the theory of monoidal derivators. The passages from categories and model categories to derivators both respect monoidal objects and hence give rise to natural examples. We also introduce…
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…
The robustness of deep neural networks is crucial to modern AI-enabled systems and should be formally verified. Sigmoid-like neural networks have been adopted in a wide range of applications. Due to their non-linearity, Sigmoid-like…
The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…
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…
The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…
Let $M$ be an ANR space and $X$ be a homotopy dense subspace in $M$. Assume that $M$ admits a continuous binary operation $*:M\times M\to M$ such that for every $x,y\in M$ the inclusion $x*y\in X$ holds if and only if $x,y\in X$. Assume…
Combinatorial threshold-linear networks (CTLNs) are a special class of inhibition-dominated TLNs defined from directed graphs. Like more general TLNs, they display a wide variety of nonlinear dynamics including multistability, limit cycles,…
By applying methods of integrable quantum field theory to the Kondo problem, we develop a systematic perturbation expansion near the IR (strong coupling) fixed point. This requires the knowledge of an infinity of irrelevant operators and…
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes…
We revise our "Physical Traces" paper in the light of the results in "A Categorical Semantics of Quantum Protocols". The key fact is that the notion of a strongly compact closed category allows abstract notions of adjoint, bipartite…
We prove a version of Pedersen's outer conjugacy theorem for coactions of compact groups, which characterizes outer conjugate coactions of a compact group in terms of properties of the dual actions. In fact, we show that every isomorphism…