Related papers: Fundamental Group Algorithm for low dimensional te…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…
Using Banchoff's discrete Morse Theory, in tandem with Bloch's result on the strong connection between the former and Forman's Morse Theory, and our own previous algorithm based on the later, we show that there exists a curvature-based,…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
We introduce a version of discrete Morse theory for posets. This theory studies the topology of the order complexes K(X) of h-regular posets X from the critical points of admissible matchings on X. Our approach is related to R. Forman's…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.
Traditional social group analysis mostly uses interaction models, event models, or other methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic…
We define an algebraic group comprising symmetric chain complexes which captures the first two stages of the Cochran-Orr-Teichner solvable filtration of the knot concordance group in a single obstruction. To achieve this we impose…
One of the challenging problems in the condensed matter physics is to understand the quantum many-body systems, especially, their physical mechanisms behind. Since there are only a few complete analytical solutions of these systems, several…
Most of the time, the first step to learn word embeddings is to build a word co-occurrence matrix. As such matrices are equivalent to graphs, complex networks theory can naturally be used to deal with such data. In this paper, we consider…
We develop a purely combinatorial framework for the systematic enumeration of knot and link diagrams supported on the thickened torus $T^2\times I$. Using the theory of maps on surfaces, cellular $4$--regular torus projections are encoded…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…
We provide a brief overview of tensor models and group field theories, focusing on their main common features. Both frameworks arose in the context of quantum gravity research, and can be understood as higher-dimensional generalizations of…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We describe a network clustering framework, based on finite mixture models, that can be applied to discrete-valued networks with hundreds of thousands of nodes and billions of edge variables. Relative to other recent model-based clustering…