Related papers: Strong additivity and conformal nets

This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the…

We derive a composite centrality measure for general weighted and directed complex networks, based on measure standardisation and invariant statistical inheritance schemes. Different schemes generate different intermediate abstract measures…

We explicitly construct the structure of Jacquet modules of parabolically induced representations of even unitary groups and even general unitary groups over a $p$-adic field $F$ of characteristic different than two. As an application, we…

This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…

We take the first steps towards a better understanding of continuous orbit equivalence, i.e., topological orbit equivalence with continuous cocycles. First, we characterise continuous orbit equivalence in terms of isomorphisms of C*-crossed…

We carry out the strong coupling expansion for the SU(N) Kondo model where the impurity spin is represented by a L-shaped Young tableau. Using second order perturbation theory around the strong coupling fixed point it is shown that when the…

Strongly adaptive algorithms are algorithms whose performance on every time interval is close to optimal. We present a reduction that can transform standard low-regret algorithms to strongly adaptive. As a consequence, we derive simple, yet…

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007…

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…

Conformal field theory finds applications across diverse fields, from statistical systems at criticality to quantum gravity through the AdS/CFT correspondence. These theories are subject to strong constraints, enabling a systematic…

Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…

We prove that if a group scheme of multiplicative type acts on an algebraic stack with affine, finitely presented diagonal then the stack of fixed points is algebraic. For this, we extend two theorems of [SGA3.2] on functors of subgroups of…

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset is contained in another) using group-theoretical considerations, and obtain an upper bound on the cardinality of such an antichain. We apply…

Inferring tie strengths (strong vs. weak) is a core task in network analysis, often guided by the Strong Triadic Closure (STC) principle. In multilayer networks, such as social platforms or biological systems, applying STC independently to…

We prove the first rigidity and classification theorems for crossed product von Neumann algebras given by actions of non-discrete, locally compact groups. We prove that for arbitrary free probability measure preserving actions of connected…

A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…