Related papers: Blending two discrete integrability criteria: sing…
The information content of the two-particle one- and two-dimensional Calogero model is studied using the von Neumann and R\'enyi entropies. The one-dimensional model is shown to have non-monotonic entropies with finite values in the large…
We study the projective systems in both continuous and discrete settings. These systems are linearizable by construction and thus, obviously, integrable. We show that in the continuous case it is possible to eliminate all variables but one…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
A wide variety of different (fixed-point) iterative methods for the solution of nonlinear equations exists. In this work we will revisit a unified iteration scheme in Hilbert spaces from our previous work that covers some prominent…
The first part of the present paper is devoted to a systematic construction of continuous-time finite-dimensional integrable systems arising from the rational su(2) Gaudin model through certain contraction procedures. In the second part, we…
Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…
We start with a rather detailed, general discussion of recent results of the replica approach to statistical mechanics of a single classical particle placed in a random $N (\gg 1)$-dimensional Gaussian landscape and confined by a…
We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
This thesis deals with the geometric and integrable aspects associated with random matrix models. Its purpose is to provide various applications of random matrix theory, from algebraic geometry to partial differential equations of…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
Decision trees are popular classification models, providing high accuracy and intuitive explanations. However, as the tree size grows the model interpretability deteriorates. Traditional tree-induction algorithms, such as C4.5 and CART,…
Most popular dimension reduction (DR) methods like t-SNE and UMAP are based on minimizing a cost between input and latent pairwise similarities. Though widely used, these approaches lack clear probabilistic foundations to enable a full…
Modern statistical learning theory and deep learning characterize generalization primarily in terms of continuous capacity control (e.g., norm-based regularization, margin maximization, low-rank bias). While highly successful in continuous…
The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems,…
We investigate global properties of the mappings entering the description of symmetries of integrable spin and vertex models, by exploiting their nature of birational transformations of projective spaces. We give an algorithmic analysis of…
Augmented Lagrangian Methods (ALMs) are widely employed in solving constrained optimizations, and some efficient solvers are developed based on this framework. Under the quadratic growth assumption, it is known that the dual iterates and…
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix $A$ and the norm of the elements of its Graver basis. In particular,…
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…
The objective of this work is to examine the integrability of Hamiltonian systems in $2D$ spaces with variable curvature of certain types. Based on the differential Galois theory, we announce the necessary conditions of the integrability.…