Related papers: Syzygies Probing Scattering Amplitudes
Spectral clustering is one of the most popular clustering methods. However, the high computational cost due to the involved eigen-decomposition procedure can immediately hinder its applications in large-scale tasks. In this paper we use…
In this paper we discuss in detail computational methods and new results for one-loop virtual corrections to N = 4 super Yang-Mills scattering amplitudes calculated to all orders in epsilon, the dimensional regularization parameter. It is…
Scattering hinders the passage of light through random media and consequently limits the usefulness of optical techniques for sensing and imaging. Thus, methods for increasing the transmission of light through such random media are of…
We present recent developments on the topic of the integrand reduction of scattering amplitudes. Integrand-level methods allow to express an amplitude as a linear combination of Master Integrals, by performing operations on the…
Compactifying the A_1 version of (2,0) theory on a circle gives rise to five-dimensional, maximally supersymmetric Yang-Mills theory. In the Coulomb branch, where the SU(2) gauge group is spontaneously broken to a U(1) subgroup, the degrees…
We consider deterministic self-propelled particles with anti-alignment interactions. An asymptotically exact kinetic theory for particle scattering at low densities is constructed by a non-local closure of the BBGKY-hierarchy, involving…
We examine the polynomial form of the scattering equations by means of computational algebraic geometry. The scattering equations are the backbone of the Cachazo-He-Yuan (CHY) representation of the S-matrix. We explain how the Bezoutian…
We present the building blocks that can be combined to produce tree-level S-matrix elements of a variety of theories with various spins mixed in arbitrary dimensions. The new formulas for the scattering of $n$ massless particles are given…
Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…
There has been a recent surge in learning generative models for graphs. While impressive progress has been made on static graphs, work on generative modeling of temporal graphs is at a nascent stage with significant scope for improvement.…
The dynamic Schr\"odinger bridge problem provides an appealing setting for solving constrained time-series data generation tasks posed as optimal transport problems. It consists of learning non-linear diffusion processes using efficient…
We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability result for the problem of determining whether such a…
Modern studies of societal phenomena rely on the availability of large datasets capturing attributes and activities of synthetic, city-level, populations. For instance, in epidemiology, synthetic population datasets are necessary to study…
A least squares semi-supervised local clustering algorithm based on the idea of compressed sensing is proposed to extract clusters from a graph with known adjacency matrix. The algorithm is based on a two-stage approach similar to the one…
A scattering zipper is a system obtained by concatenation of scattering events with equal even number of incoming and out going channels. The associated scattering zipper operator is the unitary equivalent of Jacobi matrices with matrix…
An unsupervised classification method for point events occurring on a network of lines is proposed. The idea relies on the distributional flexibility and practicality of random partition models to discover the clustering structure featuring…
A multilayered particle is illuminated by plane acoustic or electromagnetic waves of one or several frequencies. We consider the inverse scattering problem for the identification of the layers and of the refraction coefficients of the…
We conjecture a new set of analytic relations for scattering amplitudes in planar N=4 super Yang-Mills theory. They generalise the Steinmann relations and are expressed in terms of the cluster algebras associated to Gr(4,n). In terms of the…
In this work, we propose a new clustering algorithm to group nodes in networks based on second-order simplices (aka filled triangles) to leverage higher-order network interactions. We define a simplicial conductance function, which on…
The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy…