Related papers: Fundamental Group Algorithm for low dimensional te…
Using a tensorial approach, we show how to construct a one-one correspondence between pattern probabilities and edge parameters for any group-based model. This is a generalisation of the "Hadamard conjugation" and is equivalent to standard…
We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much…
We denote the matching complex of the complete graph with $n$ vertices by $M_n$. Bouc first studied the topological properties of $M_n$ in connection with the Quillen complex. Later Bj\"{o}rner, Lov\'{a}sz, Vre\'{c}ica, and…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…
We propose an algorithm for clustering high dimensional data. If $P$ features for $N$ objects are represented in an $N\times P$ matrix ${\bf X}$, where $N\ll P$, the method is based on exploiting the cluster-dependent structure of the…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…
A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is…
Cluster analysis across multiple institutions poses significant challenges due to data-sharing restrictions. To overcome these limitations, we introduce the Federated One-shot Ensemble Clustering (FONT) algorithm, a novel solution tailored…
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…
Quantum periodic cluster methods for strongly correlated electron systems are reformulated and developed. The reformulation and development are based on a canonical transformation which periodizes the fermions in the cluster space. The…
This is the second part of the article on doubly symmetric diagrams and strongly positive amphicheiral knots. We develop an enumeration strategy for prime knots given by doubly symmetric diagrams and determine all cases up to 18 crossings…
The HPQCD collaboration has a program for determining the fundamental constants of the Standard Model Lagrangian from lattice QCD. The most accurate method of doing this uses the n_f=2+1 improved staggered MILC ensembles with chiral fitting…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
We apply analytic bootstrap techniques to the four-point correlator of fundamental fields in the Wilson-Fisher model. In an $\epsilon$-expansion crossing symmetry fixes the double discontinuity of the correlator in terms of CFT data at…
The cryptographic protocol based on topological knot theory,recently proposed by the authors, is improved for what concerns the efficiency of the encoding of knot diagrams and its error robustness. The standard Dowker-Thistlethwaite code,…
This work considers clustering nodes of a largely incomplete graph. Under the problem setting, only a small amount of queries about the edges can be made, but the entire graph is not observable. This problem finds applications in…