Related papers: Fundamental Group Algorithm for low dimensional te…
We present algorithms for the group independent reduction of group theory factors of Feynman diagrams. We also give formulas and values for a large number of group invariants in which the group theory factors are expressed. This includes…
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since the method detects efficiently clustered nodes in large…
Fractional programming (FP) arises in various communications and signal processing problems because several key quantities in the field are fractionally structured, e.g., the Cram\'{e}r-Rao bound, the Fisher information, and the…
While prior work on group recommender systems (GRSs) has primarily focused on improving recommendation accuracy, most approaches assume static or predefined groups, making them unsuitable for dynamic, real-world scenarios. We reframe group…
An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square…
An algorithm for the reduction of massive Feynman integrals with any number of loops and external momenta to a minimal set of basic integrals is proposed. The method is based on the new algorithm for evaluating tensor integrals,…
This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n…
The method of large spin perturbation theory allows to analyse conformal field theories (CFT) by turning the crossing equations into an algebraic problem. We apply this method to a generic CFT with weakly broken higher spin (HS) symmetry,…
We present an algorithm which determines the fundamental group of a spatial section using topspin networks. Tracking the topology of the spatial section is a unique feature of this approach, which is not possible in standard Loop Quantum…
Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called…
We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…
In this work, a pattern recognition system is investigated for blind automatic classification of digitally modulated communication signals. The proposed technique is able to discriminate the type of modulation scheme which is eventually…
A unifying overview of the ways to parameterize the linear group GL(4.C) and its subgroups is given. As parameters for this group there are taken 16 coefficients G = G(A,B,A_{k}, B_{k}, F_{kl}) in resolving matrix G in terms of 16 basic…
It is well known that under mild conditions on a connected topological space $\mathcal X$, connected covers of $\mathcal X$ may be classified via conjugacy classes of subgroups of the fundamental group of $\mathcal X$. In this paper, we…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
Natural Language Processing (NLP) provides highly effective tools for interpreting and handling human language, offering a broad spectrum of applications. In this paper, we address a classic combinatorial problem -- finding graph partitions…
For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…
Distributed optimization is fundamental to modern machine learning applications like federated learning, but existing methods often struggle with ill-conditioned problems and face stability-versus-speed tradeoffs. We introduce fractional…
In this paper we study the complex symmetry in the several variable Fock space by using the techniques of weighted composition operators and semigroups. We characterize unbounded weighted composition operators that are (real) complex…
Given a poset-graded chain complex of vector spaces, a Conley complex is the minimal chain-homotopic reduction of the initial complex that respects the poset grading. A connection matrix is a matrix representing the differential of the…