Related papers: Can one classify finite Postnikov pieces?
The "fundamental theorem of Vassiliev invariants" says that every weight system can be integrated to a knot invariant. We discuss four different approaches to the proof of this theorem: a topological/combinatorial approach following M.…
We present a new method to produce simple formulas for 1-cocycles of knots over the integers, inspired by Polyak-Viro's formulas for finite-type knot invariants. We conjecture that these formulas always represent finite-type cohomology…
We characterize H-spaces which are p-torsion Postnikov pieces of finite type by a cohomological property together with a necessary acyclicity condition. When the mod p cohomology of an H-space is finitely generated as an algebra over the…
This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite $k$-type and finite dimension $d$ are homotopy equivalent. If the spaces are homotopy equivalent, the algorithm…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…
We categorify various finite-type cluster algebras with coefficients using completed orbit categories associated to Frobenius categories. Namely, the Frobenius categories we consider are the categories of finitely generated Gorenstein…
Finite type invariants (also known as Vassiliev invariants) of pure braids are considered from a group-theoretic point of view. New results include a construction of a universal invariant with integer coefficients based on the Magnus…
We prove several results concerning classifications, based on successive observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for membership in a given class of processes, such as the class of all finite order Markov…
In this paper, we classify all (complete) non elementary algebraic solutions of Garnier systems that can be constructed by Kitaev's method: they are deduced from isomonodromic deformations defined by pulling back a given fuchsian equation E…
In the introduction of this paper we discuss a possible approach to the unitarizability problem for classical p-adic groups. In this paper we give some very limited support that such approach is not without chance. In a forthcoming paper we…
The paper is an implementation in low dimensional cases of the classification method presented before by Rakhimov and Bekbaev. We give a complete classification of a subclass of complex filiform Leibniz algebras obtained from the naturally…
The aim of this paper is to summarize some recently obtained relations between the Ablowitz-Ladik hierarchy (ALH) and other integrable equations. It has been shown that solutions of finite subsystems of the ALH can be used to derive a wide…
We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
One of the central tasks in many-body physics is the determination of phase diagrams. However, mapping out a phase diagram generally requires a great deal of human intuition and understanding. To automate this process, one can frame it as a…
We recall results concerning one-dimensional classical and quantum systems with ladder operators. We obtain the most general one-dimensional classical systems respectively with a third and a fourth order ladder operators satisfying…
The present paper presents and proves a proposition concerning the time complexity of finite languages. It is shown herein, that for any finite language (a language for which the set of words composing it is finite) there is a Turing…
In a recent paper by the author (K. Yagasaki, Nonintegrability of the restricted three-body problem, submitted for publication), a technique was developed for determining whether nearly integrable systems are not meromorphically…