相关论文: On Multiple Gluon Exchange Webs

We determine the product structure on Hochschild cohomology of commutative algebras in low degrees, obtaining the answer in all degrees for complete intersection algebras. As applications, we consider cyclic extension algebras as well as…

The analysis of complex reaction networks is of great importance in several chemical and biochemical fields (interstellar chemistry, prebiotic chemistry, reaction mechanism, etc). In this article, we propose to simultaneously refine and…

Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…

This extended abstract describes a framework for analyzing the expressiveness, learning, and (structural) generalization of hypergraph neural networks (HyperGNNs). Specifically, we focus on how HyperGNNs can learn from finite datasets and…

In the complex setting, let $F(x,y,y')=0$ be an analytic or algebraic differential equation with $y'$-degree $d$. We deal with the qualitative study of such equations through the geometry of the planar $d$-web generated by the generic…

Supersymmetric U(Nc) gauge theory with Nf massive hypermultiplets in the fundamental representation admits various BPS solitons like domain walls and their webs. In the first part we show as a review of the previous paper hep-th/0412024…

We present an overview of computational methods for Bredon cohomology with a special focus on infinite groups

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…

Several methods have recently been developed for joint structure learning of multiple (related) graphical models or networks. These methods treat individual networks as exchangeable, such that each pair of networks are equally encouraged to…

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

The longitudinal structure function in deep inelastic scattering is one of the observables from which the gluon distribution can be unfolded. Consequently, this observable can be used to constrain the QCD dynamics at small $x$. In this work…

We prove that under fairly general conditions an iterated exchange move gives infinitely many non-conjugate braids. As a consequence, every knot has infinitely many conjugacy classes of n-braid representations if and only if it has one…

Generalizing the polynomial web category, we introduce a diagrammatic $\Bbbk$-linear monoidal category, the affine web category, for any commutative ring $\Bbbk$. Integral bases consisting of elementary diagrams are obtained for the affine…

The large-scale properties of chemical reaction systems, such as the metabolism, can be studied with graph-based methods. To do this, one needs to reduce the information -- lists of chemical reactions -- available in databases. Even for the…

We construct several new classes of transcendental entire functions, f, such that both the escaping set, I(f), and the fast escaping set, A(f), have a structure known as a spider's web. We show that some of these classes have a degree of…

We analyze the effect of twists on the electronic structure of configurations of infinite stacks of graphene layers. We focus on three different cases: an infinite stack where each layer is rotated with respect to the previous one by a…

Networks of silicon nanowires possess intriguing electronic properties surpassing the predictions based on quantum confinement of individual nanowires. Employing large-scale atomistic pseudopotential computations, as yet unexplored branched…

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…

We study a new formulation for the eikonal equation |grad u| =1 on a bounded subset of R^2. Considering a field P of orthogonal projections onto 1-dimensional subspaces, with divergence bounded in L^2, we prove existence and uniqueness for…