SearcharxivSearch

arXiv subjects

Maxim Ivanov

Publications and source records attributed to Maxim Ivanov.

6 recordsLinked to original sources

Lifting Functors and Relative Schur-Baer Theorems

We introduce $C$-lifting functors, which axiomatize lifting properties of non-abelian tensor and exterior products with respect to prescribed classes of group extensions. For a homomorphism $f\colon\Gamma\to G$, we associate to every $C$-lifting functor $F$ a relative quotient $F_f(G)$. This quotient maps epimorphically onto the subgroup determined by $F$ in every $f$-extension belonging to $C$. We show that the construction is functorial in $f$ and that, for an $f$-extension $p\colon\widetilde G\to G$, it gives a morphism of natural exact sequences. In degree two this yields an epimorphism $ \frac{H_2(G;\mathbb Z)}{f_*H_2(\Gamma;\mathbb Z)} \longrightarrow \ker p\cap[\widetilde G,\widetilde G]. $ Applying the construction to iterated tensor and exterior powers, we obtain relative Schur-Baer theorems for the lower central and derived series. We also compare the relative tensor and exterior squares, relate the exterior construction to the relative Schur multiplier $H_2(G,\Gamma;\mathbb Z)$, and derive applications to orderability. As a consequence, we prove that a virtual knot group is left-orderable if and only if it is circularly orderable.

math.GR

Scalable Maximal Frequent Episode Mining with Desbordante

Episode mining aims to extract subsequences of events that possess certain distinctive properties and constitute facts valuable to the user. Maximal frequent episode mining concentrates on discovery of frequently-appearing subsequences, which are not included into any other larger frequent subsequence. The state-of-the-art for this problem is the MaxFEM algorithm which enumerates possible subsequences, while applying various pruning techniques to accelerate the search. However, this is a computationally-intensive problem: reducing the minimum number of required subsequence occurrences or increasing the length of the subsequence both substantially raise running time, which limits practical use of MaxFEM. In this paper we describe our efforts in designing a high-performing algorithm for this problem. For this we: 1) develop an efficient C++ implementation of MaxFEM, and 2) devise an efficient technique to parallelizing it. As the result, we propose an improved parallel MaxFEM variant, which we call ParMaxFEM. Additionally, we integrate the improved algorithm into Desbordante - a high-performance, open-source data profiler with deep Python integration that treats patterns as first-class entities and allows users to develop their custom programs that can include discovery and validation of patterns. To evaluate our approach we compare both C++ implementations with the original SPMF implementation. Experiments demonstrated that our reimplemented version provides up to $8\times$ speedup over the SPMF baseline, while our parallelization technique provides up to $35\times$ improvement overall (on 8 cores).

cs.DB

Non-abelian tensor product and circular orderability of groups

For a group $ G $ we consider its tensor square $G \otimes G$ and exterior square $G \wedge G$. We prove that for a circularly orderable group $G$, under some assumptions on $H_1(G)$ and $H_2(G)$, its exterior square and tensor square are left-orderable. This yields an obstruction for a circularly orderable group $G$ to have torsion. We apply these results to study circular orderability of tabulated virtual knot groups.

math.GR

Recurrent Generalization of F-Polynomials for Virtual Knots and Links

F-polynomials for virtual knots were defined by Kaur, Prabhakar and Vesnin in 2018 using flat virtual knot invariants. These polynomials naturally generalize Kauffman's affine index polynomial and use smoothing in classical crossing of a virtual knot diagram. In this paper we introduce weight functions for ordered orientable virtual and flat virtual link. A flat virtual link is an equivalence class of virtual links in respect to a local symmetry changing type of classical crossing in a diagram. By considering three types of smoothings in classical crossings of a virtual link diagram and suitable weight functions, we provide a recurrent construction for new invariants. We demonstrate by providing explicit examples, that newly defined polynomial invariants are stronger than F-polynomials.

math.GT

Polynomials of genus one prime knots of complexity at most five

Prime knots of genus one admitting diagram with at most five classical crossings were classified by Akimova and Matveev in 2014. In 2018 Kaur, Prabhakar and Vesnin introduced families of L-polynomials and F-polynomials for virtual knots which are generalizations of affine index polynomial. Here we introduce a notion of totally flat-trivial knots and demonstrate that for such knots F-polynomials and L-polynomials coincide with affine index polynomial. We prove that all Akimova - Matveev knots are totally flat-trivial and calculate their affine index polynomials.

math.GT

$F$-polynomials of tabulated virtual knots

A sequence of $F$-polynomials $\{ F^n_K (t, \ell)\}_{n=1}^{\infty}$ of virtual knots $K$ was defined by Kaur, Prabhakar, and Vesnin in 2018. These polynomials have been expressed in terms of index value of crossing and $n$-writhe of $K$. By the construction, $F$-polynomials are generalizations of the Kauffman's Affine Index Polynomial, and are invariants of virtual knot $K$. We present values of $F$-polynomials of oriented virtual knots having at most four classical crossings in a diagram.

math.GT