Related papers: A few problems on monodromy and discriminants
In this work we deal with analytic families of real planar vector fields $\mathcal{X}_\lambda$ having a monodromic singularity at the origin for any $\lambda \in \Lambda \subset \mathbb{R}^p$ and depending analytically on the parameters…
We study the relationship between singularities of bi-Hamiltonian systems and algebraic properties of compatible Poisson brackets. As the main tool, we introduce the notion of linearization of a Poisson pencil. From the algebraic viewpoint,…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
The paper presents theorems on the calculation of the index of a singular point and at the infinity of monotone type mappings. These theorems cover basic cases when the principal linear part of a mapping is degenerate. Applications of these…
We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data…
We propose a list of open problems in pluripotential theory partially motivated by their applications to complex differential geometry. The list includes both local questions as well as issues related to the compact complex manifold…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
The monodromy conjecture is an umbrella term for several conjectured relationships between poles of zeta functions, monodromy eigenvalues and roots of Bernstein-Sato polynomials in arithmetic geometry and singularity theory. Even the…
The existence of singularities of the solution for a class of Lax equations is investigated using a development of the fac- torization method first proposed by Semenov-Tian-Shansky and Reymann [11], [9]. It is shown that the existence of a…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
The present article investigates the existence, multiplicity and regularity of weak solutions of problems involving a combination of critical Hartree type nonlinearity along with singular and discontinuous nonlinearity. By applying…
We give sufficient conditions, on data including the monodromy representation, the Stokes matrices and the Poincare ranks at prescribed singularities, to solve the generalized Riemann-Hilbert problem with irregular singularities. We recover…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
This is a note on toroidalization, formulated as the problem of resolution of singularities of morphisms in the logarithmic category. It is submitted to the proceedings of the Barrett conference held at the University of Tennessee at…
We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…
This is a survey of the diversity of problems in additive number theory. Equity requires the consideration of less currently popular problems, and suggests their inclusion in the additive canon. Of particular interest are problems about the…
In this paper, we present a numerical method for rigorously finding the monodromy of linear differential equations. Beginning at a base point where certain particular solutions are explicitly given by series expansions, we first compute the…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
This paper is concerned with singular matrix difference equations of mixed order. The existence and uniqueness of initial value problems for these equations are derived, and then the classification of them is obtained with a similar…