Related papers: A reduced subduction graph and higher multiplicity…
A complementary group to SU(n) is found that realizes all features of the Littlewood rule for Kronecker products of SU(n) representations. This is accomplished by considering a state of SU(n) to be a special Gel'fand state of the…
In the present paper we continue the project of systematic construction of invariant differential operators on the example of the non-compact algebras $su(n,n)$. Earlier were given the main multiplets of indecomposable elementary…
Subgraph-enhanced graph neural networks (SGNN) can increase the expressive power of the standard message-passing framework. This model family represents each graph as a collection of subgraphs, generally extracted by random sampling or with…
This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original…
We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…
Let G be a branch group (as defined by Grigorchuk) acting on a tree T. A parabolic subgroup P is the stabiliser of an infinite geodesic ray in T. We denote by $\rho_{G/P}$ the associated quasi-regular representation. If G is discrete, these…
We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…
A new strategy is presented for systematically treating super-leading logarithmic contributions including higher-order Glauber exchanges for non-global LHC observables in renormalization-group (RG) improved perturbation theory. This…
A generalization of the Polyakov-Koba-Nielsen-Olesen scaling law of the multiplicity distributions P(n,s) is developed. It states that a suitable change in the normalization point of P(n,s) compensated by a rescaling can restore data…
In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem…
Exploiting symmetries and invariance in data is a powerful, yet not fully exploited, way to achieve better generalisation with more efficiency. In this paper, we introduce two graph network architectures that are equivariant to several…
Applications of the principle of reduction of couplings to the standard model and supersymmetric grand unified theories are reviewed. Phenomenological applications of renormalization group invariant sum rules for soft supersymmetry-breaking…
Group theoretic and graphical techniques are used to derive the N-body wave function for a system of identical bosons with general interactions through first-order in a perturbation approach. This method is based on the maximal symmetry…
Previous work has shown that the classification of indecomposable off-shell representations of N-supersymmetry, depicted as Adinkras, may be factored into specifying the topologies available to Adinkras, and then the height-assignments for…
It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across \Omega(n \log n) coset states. One of the only known models…
Some recent all-loop results on the renormalization of supersymmetric theories are summarized and reviewed. In particular, we discuss how it is possible to construct expressions which do not receive quantum corrections in all orders for…
This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…