相关论文: Technical Report: All Principal Congruence Link Gr…
This paper presents a classification of all p-groups of order p^5 up to isomorphism. It contains a full list of their polycyclic presentations, a short introduction to the basic ideas of the methodes used to classify the groups, and a…
We give a concise proof of a classification of lens spaces up to orientation-preserving homeomorphisms. The chief ingredient in our proof is a study of the Alexander polynomial of ` symmetric' links in $S^3$.
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
For a link $L$ in the 3-sphere and for a prime $p$, we express the $p$-primary information on the first homology group of $p^{m}$-fold branched covers of $L$ in terms of its $p$-adic Milnor higher linking invariants, using the completed…
Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…
Aggregating different pieces of similar information is necessary to generate concise and easy to understand reports in technical domains. This paper presents a general algorithm that combines similar messages in order to generate one or…
We prove the analogue of the Concordance Implies Isotopy in Codimension $\ge 3$ Theorem for link maps, together with some other its singular analogues. In the case of spherical link maps, a stronger result was independently obtained by P.…
In this paper we give a description of the generators of the prime level congruence subgroups of braid groups. Also, we give a new presentation of the symplectic group over a finite field, and we calculate symmetric quotients of the prime…
We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…
This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the…
This paper studies the configuration space of all possible positions of a linkage in R^n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number…
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…
Similar to knots in S^3, any knot in a lens space has a grid diagram from which one can combinatorially compute all of its knot Floer homology invariants. We give an explicit description of the generators, differentials, and rational Maslov…
The initial remarks in this technical report are primarily for those not familiar with the properties of L1 approximation, but the remainder of the report should also interest readers who are already acquainted with the inner workings of L1…
Conformance checking deals with collating modeled process behavior with observed process behavior recorded in event data. Alignments are a state-of-the-art technique to detect, localize, and quantify deviations in process executions, i.e.,…
A cobordism between links in thickened surfaces consists of a surface $ S $ and a $3$-manifold $M $, with $ S $ properly embedded in $ M \times I $. We show that there exist links in thickened surfaces such that if $(S,M) $ is a cobordism…
This technical report proves components consistency for the Doubly Stochastic Dirichlet Process with exponential convergence of posterior probability. We also present the fundamental properties for DSDP as well as inference algorithms.…
This paper is a generalization of the author's previous work on link homotopy to link concordance. We show that the only real-valued finite type link concordance invariants are the linking numbers of the components.
In this paper, we prove that the (orientation-preserving) symmetry groups of $b$-prime flat fully augmented links correspond exactly with the finite subgroups of $O(3)$. We accomplish this by first developing a dictionary between…
Predicting missing links in complex networks requires algorithms that are able to explore statistical regularities in the existing data. Here we investigate the interplay between algorithm efficiency and network structures through the…