Related papers: Effective Hironaka resolution and its Complexity (…
We proposed, in our previous paper, to characterize the Hirota-Miwa equation by means of the theory of triangulated category. We extend our argument in this paper to support the idea. In particular we show in detail how the singularity…
Multimodal learning leverages the integration of diverse data modalities to enhance performance in complex tasks. Yet, it frequently encounters incomplete or redundant modality data in real-world scenarios. This paper presents a…
We show that a method proposed recently, based on the characteristic polynomial of an effective Hamiltonian, had been developed several years earlier by other authors in a clearer and more general way. We outline both implementations of the…
We generalize [3, Lemma 2.2] and [4, Proposition 2.3] and deduce a positive result on Hilbert's fourteenth problem. Further, we give a relatively transparent and elementary proof of [3, Theorem 1.1].
In this paper, we consider linear ill-posed problems in Hilbert spaces and their regularization via frame decompositions, which are generalizations of the singular-value decomposition. In particular, we prove convergence for a general class…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also…
We enumerate generalizations of the superintegrability property $<character>\ \sim {\rm character}$ and illuminate possible general structures behind them. We collect variations of original formulas available up to date and emphasize the…
We give algorithms to construct the N\'eron Desingularization and the easy case from \cite{KK} of the General N\'eron Desingularization.
An infinite summation formula of Hall-Littlewood polynomials due to Kawanaka is generalized to a finite summation formula, which implies, as applications, twelve multiple q-identities of Rogers-Ramanujan type.
A multidimensional generalization of the Bernstein class of functions and the properties of functions of the introduced class are examined. In particular, a new proof of the integral representation of Bernstein functions of many variables…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
We consider the problem of identifying universal low-dimensional features from high-dimensional data for inference tasks in settings involving learning. For such problems, we introduce natural notions of universality and we show a local…
We present a historiographical review of algorithms and computer codes developed for solving integration-by-parts relations for Feynman integrals. This procedure is one of the key steps in the evaluation of Feynman integrals, since it…
We first show a simple but striking result in bilevel optimization: unconstrained $C^\infty$ smooth bilevel programming is as hard as general extended-real-valued lower semicontinuous minimization. We then proceed to a worst-case analysis…
Matrix completion is one of the key problems in signal processing and machine learning. In recent years, deep-learning-based models have achieved state-of-the-art results in matrix completion. Nevertheless, they suffer from two drawbacks:…
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…
In this paper we identify some inaccuracies in the paper by R.R. Saxena and S.R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm…