DIDmitry I. Ignatov

Dmitry I. Ignatov

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dmitry I. Ignatov has a total of 174 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    When Wall Street Sleeps: Sparsity-Induced Multifractality and Regime Transitions in 24/7 Tokenized Equity Markets

    by Yufeng Xiao, Minxing Wang, Pavel Braslavski, Dmitry Ignatov

    Financial event processes—on-chain transfers, order arrivals, transaction counts—are often strongly zero-inflated: long silences punctuated by bursts. On such series, apparent multifractality can arise from the marginal distribution and the arrangement of zeros rather than from dependence among active events, and conventional shuffle-based attribution cannot separate these sources. We develop an operational decomposition of multifractal width for sparse event processes—separating marginal-distribution, zero-run, and active-event contributions via shuffle and run-preserving surrogates—and validate it on synthetic processes with known ground truth. As an empirical laboratory we use 24/7 tokenized equity markets: minute-level on-chain event panels for the Top-100 tokenized stocks issued by Ondo (over 70% of issuance) on BNB Smart Chain (83% of on-chain tokenized-equity volume), analyzing the Top-30 instruments across regular, extended, overnight, and weekend sessions. The market splits into two dynamical regimes. Weekday off-hours activity retains the in-hours persistence regime, and overnight prices are incorporated into the next open almost one-for-one. On weekends, a dramatic amplification of raw multifractal width inverts under surrogate correction: it is accounted for primarily by the marginal distribution of sparse activity, with no detectable positive contribution from active-event ordering; a staged 24/7 rollout inside the sample window provides quasi-experimental evidence consistent with this sparsity channel. Price-side validation shows that activity structure and price anchoring are separate information channels: de-anchoring is invisible to activity-side features. Continuous trading access thus does not imply a homogeneous continuous market: the regime of a 24/7 market is jointly determined by reference-price availability and primary-market activity.

  • Statistical Learning of Polyhedra Volumes from Metric Features

    by Wei Yuan, Zamira Ignatova, Dmitry Ignatov

    We explore statistical learning methods for computing polyhedra volumes, motivated by Sabitov’s polynomial approach, which expresses volume as a root of an edge-length-dependent polynomial. It is known that searching for Sabitov polynomials presents significant computational challenges for complex polyhedra. To directly estimate the volume of a polyhedron from its edges’ lengths, we propose using ElasticNet regression to approximate volumes from edge lengths, demonstrating high accuracy (\(R^{2}>0.999\)) for tetrahedra and octahedra (\(R^{2}\geq 0.98\) and \({>}0.999\), depending on the generation parameters), yielding their volume formulas from triples of the lengths of their edges and diagonals. We further speculate on the statistical learning capabilities to deal with Steffen’s flexible polyhedron, where traditional methods struggle to obtain the Sabitov polynomial. Our results bridge algebraic geometry and machine learning, offering a scalable alternative for volume computation.

  • Computation of the Dedekind–MacNeille Completion for the Bruhat Order of the Weyl Group $\boldsymbol{W(B_{6})}$ with Concept Lattices

    by Dmitry I. Ignatov

    This paper presents the computation of the Dedekind–MacNeille completion for the Bruhat order of the Weyl group \(B_{6}\) using concept lattices (also known as Galois lattices). We extend the associated sequence A378072 in the OEIS by providing the value for \(n=6\), which equals 142343254. Our approach leverages Formal Concept Analysis and the NextClosure algorithm to efficiently compute the completion. We also present additional results for other Weyl groups (infinite families up to computationally reasonable \(n\), \(A_{n}\), \(D_{n}\), and special ones, \(G_{2}\), \(F_{4}\), \(E_{6}\)) and analyze lattice properties, including the number of chains and (maximal) antichains, as well as lattice height, width, and breadth. The repository with data, code and selected results is available on GitHub https://github.com/dimachine/BruhatCompletion.

  • Attribute Exploration and Spectra Similarity with Concept Lattices for Number-Theoretic Constants and Kontsevich–Zagier Periods

    by Dmitry Yu. Syrnikov, Dmitry I. Ignatov

    The contribution of this paper is two-fold. First, we show how to acquire and represent background knowledge about classes of numbers in modern number theory using the Attribute Exploration (AE) technique. AE appeared in Formal Concept Analysis (FCA, an applied branch of modern Lattice Theory) and is known in Artificial Intelligence as an interactive knowledge acquisition technique in the form of implications (attribute dependencies), with a domain expert involved in answering questions and providing counterexamples. Special emphasis is placed on the so-called Kontsevich–Zagier periods and their interrelation with transcendental numbers. Second, we employ spectra (cf. Beatty sequences for irrational numbers) of various number-theoretic constants and their contextual object-attribute representations to find and explore similarities between their multiple spectra prefixes. Here, we benefit from the human-oriented nature of the underlying FCA structures, in particular, formal concepts and their hierarchies, where each concept, being a unit of human thought, is an ordered pair of its extent (closed set of objects) and intent (closed set of attributes). We also formulate and prove several statements regarding the structure of the studied concept lattices of spectra and their dynamics.

  • Acne Severity Grading with Deep Learning

    by Stefan Nikolić, Rayeesa Mehmood, Dmitry I. Ignatov

    Automated assessment of facial acne severity remains challenging due to subjective grading practices and limited consideration of lesion spatial characteristics. In this work, we address these challenges by first analyzing interexpert variability using a dataset independently annotated by three dermatologists and introducing a unified grading criterion to mitigate inconsistencies and systematic bias. Based on the harmonized labels, we conduct a comprehensive evaluation of deep learning approaches for continuous acne severity regression. We begin with strong baseline models that directly regress severity scores using convolutional and transformer-based architectures. We then explore detector-driven formulations that infer severity solely from lesion counts predicted by object detection models trained on a publicly available acne dataset, extending prior work by incorporating multiple modern detectors. To better align with clinical grading criteria, we further introduce heuristic geometric features that capture lesion coverage and spatial distribution across the face. Finally, we propose a hybrid framework that fuses global visual features extracted by a convolutional neural network with detector-derived lesion count and spatial features, jointly modeled using gradient boosting regression. Experimental results demonstrate that lesion count alone provides a competitive and interpretable signal, while incorporating spatial heuristics yields consistent improvements. The proposed fusion strategy achieves the best overall performance, outperforming standalone convolutional- or detector-based models. Additionally, we analyze the impact of label standardization and show that unified grading criteria reduce systematic bias in model predictions. These findings highlight the importance of combining global appearance cues with localized lesion characteristics for reliable and clinically meaningful acne severity assessment.

  • Open Access

    What Drives Multi-Chain Crypto Forecasting: Model Choice, Feature Selection, and Transferability

    by Mingxing Wang, Yufeng Xiao, Pavel Braslavski, Dmitry I. Ignatov

    Increasingly shaped by heterogeneous on-chain activity rather than a single shared market process, this study investigates 7-day-ahead forecasting using 147 market and on-chain indicators across eight major blockchain ecosystems from October 2023 to April 2025. We benchmark statistical, deep-learning, and foundation-model baselines under multiple feature-selection pipelines using both error metrics and Diebold–Mariano tests. TiRex achieves the best average MAPE (0.0428) in a univariate setting without additional optimized covariates, while TFT remains slightly weaker even under its best feature-input configuration (MAPE: 0.0435; p=0.9359 versus TiRex), suggesting a persistent practical advantage for TiRex. Importantly, TiRex’s zero-shot nature confers a substantial efficiency edge: by bypassing feature selection, it delivers comparable accuracy at a fraction of the computational cost. At the same time, feature selection materially affects many model families, with Boruta chosen in roughly 71.7% of best configurations. Taken together, the evidence supports a selective-feature principle: robust forecasting depends on validated, chain-specific features rather than larger feature sets. Feature-importance and overlap analyses further indicate a mixed structure of transferability, where broad market proxies provide baseline context while chain-specific variables drive marginal gains. Overall, this study highlights that effective multi-chain forecasting is primarily a feature selection problem under statistical uncertainty, while also showing that zero-shot designs like TiRex can achieve state-of-the-art accuracy with unmatched efficiency, offering practical implications for building leaner, more robust trading systems.


  • Open Access

    TimeGPT’s Potential in Cryptocurrency Forecasting: Efficiency, Accuracy, and Economic Value

    by Minxing Wang, Pavel Braslavski, Dmitry I. Ignatov

    Accurate and efficient cryptocurrency price prediction is vital for investors in the volatile crypto market. This study comprehensively evaluates nine models—including baseline, zero-shot, and deep learning architectures—on 21 major cryptocurrencies using daily and hourly data. Our multi-dimensional evaluation assesses models based on prediction accuracy (MAE, RMSE, MAPE), speed, statistical significance (Diebold–Mariano test), and economic value (Sharpe Ratio). Our research found that the optimally fine-tuned TimeGPT model (without variables) demonstrated superior performance across both Daily and Hourly datasets, with its statistical leadership confirmed by the Diebold–Mariano test. Fine-tuned Chronos excelled in daily predictions, while TFT was a close second to TimeGPT for hourly forecasts. Crucially, zero-shot models like TimeGPT and Chronos were tens of times faster than traditional deep learning models, offering high accuracy with superior computational efficiency. A key finding from our economic analysis is that a model’s effectiveness is highly dependent on market characteristics. For instance, TimeGPT with variables showed exceptional profitability in the volatile ETH market, whereas the zero-shot Chronos model was the top performer for the cyclical BTC market. This also highlights that variables have asset-specific effects with TimeGPT: improving predictions for ICP, LTC, OP, and DOT, but hindering UNI, ATOM, BCH, and ARB. Recognizing that prior research has overemphasized prediction accuracy, this study provides a more holistic and practical standard for model evaluation by integrating speed, statistical significance, and economic value. Our findings collectively underscore TimeGPT’s immense potential as a leading solution for cryptocurrency forecasting, offering a top-tier balance of accuracy and efficiency. This multi-dimensional approach provides critical, theoretical, and practical guidance for investment decisions and risk management, proving especially valuable in real-time trading scenarios.


  • Cooperative games with fuzzy characteristic functions on concept lattices

    by Martin Waffo Kemgne, Blaise Bleriot Koguep Njionou, Dmitry I. Ignatov, Leonard Kwuida