Related papers: Factorization of network reliability with perfect …
Expanding on the comprehensive factorization of functors internal to a category C, under fairly mild conditions on a monad T on C we establish that this orthogonal factorization system exists even in Burroni's category Cat(T) of (internal)…
We discuss a consequence of Green and Tao's factorisation theorem for polynomial orbits on nilmanifolds, adjusted to the requirements of certain arithmetic applications. More precisely, we prove a generalisation of Theorem 16.4, Acta Arith.…
In this talk, I reviewed the role of factorization in diffraction hard scattering.
In this note we answer a question concerning lineability of the set of non-absolutely summing operators.
We outline the proofs of several principal statements in conventional renormalization theory. This may be of some use in the light of new trends and new techniques (Hopf algebras, etc.) recently introduced in the field.
Robustness in response to unexpected events is always desirable for real-world networks. To improve the robustness of any networked system, it is important to analyze vulnerability to external perturbation such as random failures or…
We introduce generalized pinning fields in conformal field theory that model a large class of critical impurities at large distance, enriching the familiar universality classes. We provide a rigorous definition of such defects as certain…
This paper introduces a formulation of the optimal network compression problem for financial systems. This general formulation is presented for different levels of network compression or rerouting allowed from the initial interbank network.…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
The main results in this note concern the characterization of the length of continua 1 (Theorems 2.5) and the parametrization of continua with finite length (Theorem 4.4). Using these results we give two independent and relatively…
We give uniform proofs of tightness and exponential tightness of the sequences of stationary queue lengths in generalised Jackson networks in a number of setups which concern large, normal and moderate deviations.
The celebrated Trotter approximation theorem provides a sufficient condition for the convergence of a sequence of operator semigroups in terms of the corresponding sequence of infinitesimal generators. There exist a few results on the rate…
The factorisation of scattering amplitude is described by the Weinberg theorem. In this talk, we will show the universality of the theorem at the next leading correction of the soft expansion. For that we will derive the soft operator by…
An extension to the factorisation principle as suggested by Fermat is presented.We start from a symmetry of natural numbers and obtain the factorisation principle therefrom.Later it is extended further to test the primality of any natural…
This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.
We introduce a general model for the balance-sheet consistent valuation of interbank claims within an interconnected financial system. Our model represents an extension of clearing models of interdependent liabilities to account for the…
In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.