相关论文: Improving Colour Computations in MadGraph5_aMC@NLO…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

A complexity-adaptive tree search algorithm is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule. The average complexity is close to that of the successive…

An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover…

In this talk we discuss an algorithm for the numerical calculation of one-loop QCD amplitudes and present results at next-to-leading order for jet observables in electron-positron annihilation calculated with the above-mentioned method. The…

We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in…

In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can…

We denote by $\chi$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu,…

In recent years, there has been a significant amount of research focused on expanding the expressivity of Graph Neural Networks (GNNs) beyond the Weisfeiler-Lehman (1-WL) framework. While many of these studies have yielded advancements in…

Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the…

The clique problems, including $k$-CLIQUE and Triangle Finding, form an important class of computational problems; the former is an NP-complete problem, while the latter directly gives lower bounds for Matrix Multiplication. A number of…

With current state-of-the-art approaches aimed at enhancing the reasoning capabilities of Large Language Models(LLMs) through iterative preference learning inspired by AlphaZero, we propose to further enhance the step-wise reasoning…

Recent work has shown that imperceptible perturbations can be applied to craft unlearnable examples (ULEs), i.e. images whose content cannot be used to improve a classifier during training. In this paper, we reveal the road that researchers…

We study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the used computational units (cores). The overall procedure generates coarse…

Classic symmetry-breaking problems on graphs have gained a lot of attention in models of modern parallel computation. The Adaptive Massively Parallel Computation (AMPC) is a model that captures the central challenges in data center…

We present a computer library for the numerical evaluation of colour-ordered n-gluon amplitudes at one-loop order in pure Yang-Mills theory. The library uses the recently developed technique of generalised unitarity. Running in double…

For integers $n\ge 0$, an iterated triangulation $Tr(n)$ is defined recursively as follows: $Tr(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $Tr(n)$ is the plane triangulation obtained from the plane triangulation…

We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…

Multimodal retrieval over text corpora remains a fundamental challenge: the best vision-language encoder achieves only 27.6 nDCG@10 on MM-BRIGHT, a reasoning-intensive multimodal retrieval benchmark, underperforming strong text-only…

The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…

Both the higher energy and the initial state colored partons contribute to making exact calculations in QCD color space more important at the LHC than at its predecessors. This is applicable whether the method of assessing QCD is fixed…