Related papers: Fundamental Group Algorithm for low dimensional te…

Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…

Complex networks possess a rich, multi-scale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one…

In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chevalley groups in the same spirit as the row-column operation…

K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using…

For a Morse function f on a compact oriented manifold M, we show that f has more critical points than the number required by the Morse inequalities if and only if there exists a certain class of link in M whose components have nontrivial…

We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…

It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…

We introduce a Morse theory for posets of Bestvina-Brady type combining matchings and height functions. This theory generalizes Forman's discrete Morse theory for regular CW-complexes and extends previous results on Morse theory for…

We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…

We study the decomposition of the Coulomb integrals of periodic systems into a tensor contraction of six matrices of which only two are distinct. We find that the Coulomb integrals can be well approximated in this form already with small…

The identification of vertices that play a central role in network analysis is a fundamental challenge. Although traditional centrality measures have been extensively employed for this purpose, the increasing complexity of modern networks…

We present ensemble methods in a machine learning (ML) framework combining predictions from five known motif/binding site exploration algorithms. For a given TF the ensemble starts with position weight matrices (PWM's) for the motif,…

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…

Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…

Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the…

A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…

The theory of bottom tangles is used to construct a quantum fundamental group. On the other hand, the skein module is considered as a quantum analogue of the $SL(2)$ representation of the fundamental group. Here we construct the skein…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

In this paper we provide a classification of fundamental group elements representing simple closed curves on the punctured Klein bottle, Similar to the Birman-Series classification of curves on the punctured torus[1]. In the process, an…

In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765