Searcharxiv⌕ Search

arXiv subjects

Fedor Pavutnitskiy

Publications and source records attributed to Fedor Pavutnitskiy.

9 recordsLinked to original sources

$\mathfrak{sl}(2)$-weight system does not extend to a graph 4-invariant

A long-standing question by S. Lando asks whether the $\mathfrak{sl}(2)$-weight system extends to a unique 4-invariant of graphs. We show that, in full generality, the answer to this question is negative. However, for certain specializations of the weight system, extensions do exist. Explicit formulae for computing two such specializations of the weight system are already known. We construct recurrence relations for one additional such extension and discuss the last remaining specialization, which conjecturally admits an extension. We also study the polynomial coefficients of the $\mathfrak{sl}(2)$-weight system and resolve the questions concerning their extension.

math.CO↗

Limits via relations

In this paper, we study operations on functors in the category of abelian groups simplar to the derivation in the sense of Dold-Puppe. They are defined as derived limits of a functor applied to the relation subgroup over a category of free presentations of the group. The integral homology of the Eilenberg-Maclane space $K(\mathbb Z,3)$ appears as a part of description of these operations applied to symmetric powers.

math.KT↗

Simplicial approach to path homology of quivers, marked categories, groups and algebras

We develop a generalisation of the path homology theory introduced by Grigor'yan, Lin, Muranov and Yau (GLMY-theory) in a general simplicial setting. The new theory includes as particular cases the GLMY-theory for path complexes and new homology theories: path homology of categories with a chosen set of morphisms (marked categories) groups with a chosen subset (marked groups) and path Hochschild homology of algebras with chosen vector subspaces (marked algebras). Using our general machinery, we also introduce a new homology theory for quivers that we call square-commutative homology of quivers and compare it with the theory developed by Grigor'yan, Muranov, Vershinin and Yau.

math.AT↗

Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula

Computing homotopy groups of spheres has long been a fundamental objective in algebraic topology. Various theoretical and algorithmic approaches have been developed to tackle this problem. In this paper we take a step towards the goal of comprehending the group-theoretic structure of the generators of these homotopy groups by leveraging the power of machine learning. Specifically, in the simplicial group setting of Wu's formula, we reformulate the problem of generating simplicial cycles as a problem of sampling from the intersection of algorithmic datasets related to Dyck languages. We present and evaluate language modelling approaches that employ multi-label information for input sequences, along with the necessary group-theoretic toolkit and non-neural baselines.

math.AT↗

Quadric Hypersurface Intersection for Manifold Learning in Feature Space

The knowledge that data lies close to a particular submanifold of the ambient Euclidean space may be useful in a number of ways. For instance, one may want to automatically mark any point far away from the submanifold as an outlier or to use the geometry to come up with a better distance metric. Manifold learning problems are often posed in a very high dimension, e.g. for spaces of images or spaces of words. Today, with deep representation learning on the rise in areas such as computer vision and natural language processing, many problems of this kind may be transformed into problems of moderately high dimension, typically of the order of hundreds. Motivated by this, we propose a manifold learning technique suitable for moderately high dimension and large datasets. The manifold is learned from the training data in the form of an intersection of quadric hypersurfaces -- simple but expressive objects. At test time, this manifold can be used to introduce a computationally efficient outlier score for arbitrary new data points and to improve a given similarity metric by incorporating the learned geometric structure into it.

cs.LG↗

On homology of Lie algebras over commutative rings

We study five different types of the homology of a Lie algebra over a commutative ring which are naturally isomorphic over fields. We show that they are not isomorphic over commutative rings, even over $\mathbb Z,$ and study connections between them. In particular, we show that they are naturally isomorphic in the case of a Lie algebra which is flat as a module. As an auxiliary result we prove that the Koszul complex of a module $M$ over a principal ideal domain that connects the exterior and the symmetric powers $0\to Λ^n M\to M \otimes Λ^{n-1} M \to \dots \to S^{n-1}M \otimes M \to S^nM\to 0 $ is purely acyclic.

math.KT↗

Right exact localizations of groups

We introduce several classes of localizations (idempotent monads) on the category of groups and study their properties and relations. The most interesting class for us is the class of localizations which coincide with their zero derived functors. We call them right exact (in the sense of Keune). We prove that a right exact localization $L$ preserves the class of nilpotent groups and that for a finite $p$-group $G$ the map $G\to LG$ is an epimorphism. We also prove that some examples of localizations (Baumslag's $P$-localization with respect to a set of primes $P,$ Bousfield's $HR$-localization, Levine's localization, Levine-Cha's $\mathbb Z$-localization) are right exact. At the end of the paper we discuss a conjecture of Farjoun about Nikolov-Segal maps and prove a very special case of this conjecture.

math.GR↗

Limits, standard complexes and fr-codes

For a strongly connected category $\mathcal C$ with pair-wise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of ${\sf lim} : \mathrm{Ab}^{\mathcal C}\to \mathrm{Ab}$. Applications involve Künneth theorem for higher limits and ${\sf lim}$-finiteness of ${\bf fr}$-codes. A dictionary for the ${\bf fr}$-codes with words of length $\leq 3$ is given.

math.GR↗