Related papers: Technical Report: All Principal Congruence Link Gr…

The main purpose of this article is to give the integral cohomology of classical principal congruence subgroups in SL(2,Z) as well as their analogues in the third braid group with local coefficients in symmetric powers of the natural…

We analyze a science collaboration network, i.e. a network whose nodes are scientists with edges connecting them for each paper published together. Furthermore we develop a model for the simulation of discontiguous small-world networks that…

For the purpose of consistent notation and easy reference the most important relations in light-cone quantization are compiled from a recent review (Brodsky, Pauli Pinsky, Physics Reports 301 (1998) 299), where all further details and…

We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.

For any cssc-crossed module a category is constructed, equipped with a structure and proved that this is a coherent categorical group. Together with a result of the previous paper, where to any categorical group the cssc-crossed module is…

This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

Data Linkage is an important step that can provide valuable insights for evidence-based decision making, especially for crucial events. Performing sensible queries across heterogeneous databases containing millions of records is a complex…

We give a stopping criterion for the enumeration of all conjugacy classes in cocompact triangle groups up to any geometric length. The enumeration is based on an encoding given by P. Dehornoy and T. Pinsky.

This paper presents a thorough evaluation of several widely-used 3D correspondence grouping algorithms, motived by their significance in vision tasks relying on correct feature correspondences. A good correspondence grouping algorithm is…

This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Accurate estimation of dataset complexity is crucial for evaluating and comparing link prediction models for knowledge graphs (KGs). The Cumulative Spectral Gradient (CSG) metric derived from probabilistic divergence between classes within…

We describe a family of representations in SL(3,$\mathbb C$) of the fundamental group $\pi$ of the Whitehead link complement. These representations are obtained by considering pairs of regular order three elements in SL(3,$\mathbb C$) and…

In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on instruction sequences are paid attention to: instruction sequence congruence, structural congruence, and behavioural congruence. Sound and…

If $G$ is a transitive group of degree $n$ having a string C-group of rank $r\geq (n+3)/2$, then $G$ is necessarily the symmetric group $S_n$. We prove that if $n$ is large enough, up to isomorphism and duality, the number of string…

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.

Knot concordance plays a crucial role in the low dimensional topology. We propose a very elementary techniques which allows one to construct a lot of sliceness obstructions for knots in the full torus. Our approach deals with group…

Confluence is a critical property of computational systems which is related with determinism and non ambiguity and thus with other relevant computational attributes of functional specifications and rewriting system as termination and…