Related papers: A few problems on monodromy and discriminants
This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.
We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We observe that the multiple actions of Laplacian appear for the classifications of such class…
We present a classification algorithm for isolated hypersurface singularities of corank 2 and modality 1 over the real numbers. For a singularity given by a polynomial over the rationals, the algorithm determines its right equivalence class…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
In this work we shall present a survey on problems and results on singular holomorphic foliations and Pfaff systems on complex manifolds assuming that these objects possess invariant analytic varieties. We will focus on recent results which…
The study of hypersurfaces in a torus leads to the beautiful zoo of amoebas and their contours, whose possible configurations are seen from combinatorial data. There is a deep connection to the logarithmic Gauss map and its critical points.…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…
The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…
The note is devoted to multiple mixing, spectrum, rank and self-joinings of measure-preserving transformations. We recall famous open problems, discuss related questions and some known results. A hypothetical example of an automorphism of…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
We prove several classification results for $p$-Laplacian problems on bounded and unbounded domains, and deal with qualitative properties of sign-changing solutions to $p$-Laplacian equations on $\mathbb R^N$ involving critical…
A classic problem in analysis is to solve nonlinear equations of the form \begin{equation*} F(x)=0, \end{equation*} where $F:D^n\to \mathbb{R}^m$ is a continuous map of the closed unit disk $D^n\subset\mathbb{R}^n$ in $\mathbb{R}^m$. A…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…