Related papers: On Multiple Gluon Exchange Webs

This article is a revised version of the talk I gave at the conference ``Beauville Surfaces and groups'' held in Newcastle in June 2012. It presents some group theoretical methods to give bounds on the number of connected components of the…

We define a novel type of ensemble Graph Convolutional Network (GCN) model. Using optimized linear projection operators to map between spatial scales of graph, this ensemble model learns to aggregate information from each scale for its…

The generalization of the conformal scattering method for small-angle scattering processes involving magnetic monopoles and ordinary charges is constructed. Using this generalization we show that introducing of magnetic charges corresponds…

Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…

The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a…

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific…

Let $n\geq 1$. The pro-unipotent completion of the pure braid group of $n$ points on a genus 1 surface has been shown to be isomorphic to an explicit pro-unipotent group with graded Lie algebra using two types of tools: (a) minimal models…

We derive an exact expression for the partition function of the su(m) Haldane-Shastry spin chain, which we use to study the density of levels and the distribution of the spacing between consecutive levels. Our computations show that when…

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

Given a biquandle $(X, S)$, a function $\tau$ with certain compatibility and a pair of {\em non commutative cocyles} $f,h:X \times X\to G$ with values in a non necessarily commutative group $G$, we give an invariant for singular knots /…

The gluon field distribution between three infinitely spaced quarks is obtained. The field distribution between every pair is approximated by an infinite flux tube filled with a color longitudinal electric field. The origin of the color…

We investigate the space of abelian relations of planar webs admitting infinitesimal automorphisms. As an application, we construct 4k-14 new algebraic families of global exceptionnal k-webs on the projective plane, for each k >4.

Let $L$ be a prime alternating link with $n$ crossings. We show that for each fixed $g$, the number of genus $g$ incompressible surfaces in the complement of $L$ is bounded by a polynomial in $n$. Previous bounds were exponential in $n$.

Subgraph GNNs are a recent class of expressive Graph Neural Networks (GNNs) which model graphs as collections of subgraphs. So far, the design space of possible Subgraph GNN architectures as well as their basic theoretical properties are…

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…

We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…

Working over imperfect fields, we give a comprehensive classification of genus-one curves that are regular but not geometrically regular, extending the known case of geometrically reduced curves. The description is given intrinsically, in…

We prove some epsilon regularity results for n-dimensional minimal two-valued Lipschitz graphs. The main theorems imply uniqueness of tangent cones and regularity of the singular set in a neighbourhood of any point at which at least one…

We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…