相关论文: On Multiple Gluon Exchange Webs

Various branches of matrix model partition function can be represented as intertwined products of universal elementary constituents: Gaussian partition functions Z_G and Kontsevich tau-functions Z_K. In physical terms, this decomposition is…

In this Comment, we argue that the behavior of the overlap functions reported in the commented paper can be fully understood in terms of the physics of simple liquids in contact with disordered substrates, without appealing to any…

Recently the space of tree level color structures for gluon scattering was determined in arXiv:1403.6837 together with its transformation properties under permutations. Here we generalize the discussion to loops, demonstrating a reduction…

The paper introduces a number of structural and functional features of classification of multilayer networks (MLN), by means of which distinguish monoflow partially overlapped MLN, that are quite common in the study of intersystem…

In earlier work, we constructed invariants of irreducible representations of the Kauffman skein algebra of a surface. We introduce here an inverse construction, which to a set of possible invariants associates an irreducible representation…

The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

We define a notion of concordance based on Euler characteristic, and show that it gives rise to a concordance group of links in the three-sphere, which has the concordance group of knots as a direct summand with infinitely generated…

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

Equivariant Graph Neural Networks (GNNs) have demonstrated significant success across various applications. To achieve completeness -- that is, the universal approximation property over the space of equivariant functions -- the network must…

Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Odd electrons of benzenoid units and correlation of these electrons having different spins are the main concepts of the molecular theory of graphene. In contrast to the theory of aromaticity, the molecular theory is based on the fact that…

Concepts in a certain domain of science are linked via intrinsic connections reflecting the structure of knowledge. To get a qualitative insight and a quantitative description of this structure, we perform empirical analysis and modeling of…

I discuss a few interpolating sum rules for spin structure functions of the nucleon. Using the concept of duality, I argue that the $G_1$ sum rule, including the elastic contribution, is useful for learning higher twist matrix elements of…

A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We investigate a model protein interaction network whose links represent interactions between individual proteins. This network evolves by the functional duplication of proteins, supplemented by random link addition to account for…

The fractal nature of graphs has traditionally been investigated by using the nodes of networks as the basic units. Here, instead, we propose to concentrate on the graph edges, and introduce a practical and computationally not demanding…