Related papers: Surjective Nash maps between semialgebraic sets

We prove that every complex analytic set X in a Runge domain D can be approximated by Nash sets on relatively compact subdomains of D. We give a necessary and sufficient condition for a complex analytic set X to admit a Nash approximation…

Let H be a Hilbert space, L(H) the algebra of all bounded linear operators on H and <, >_A : H \times H \to C the bounded sesquilinear form induced by a selfadjoint A in L(H), < \xi, \eta >_A = < A \xi, \eta >, \xi, \eta in H. Given T in…

Building upon the results in [Hinterm\"uller et al., SIAM J. Optim, '15], generalized Nash equilibrium problems are considered, in which the feasible set of each player is influenced by the decisions of their competitors. This is realized…

We give a classification of connected abelian locally (real) Nash groups of dimension two. We first consider Painlev\'e's description of meromorphic maps admitting an Algebraic Addition Theorem and analyse the algebraic dependence of such…

In this paper, we prove the following differential analog of the Noether normalization lemma: for every $d$-dimensional differential algebraic variety over differentially closed field of zero characteristic there exists a surjective map…

In this paper, we study formal mappings between smooth generic submanifolds in multidimensional complex space and establish results on finite determination, convergence and local biholomorphic and algebraic equivalence. Our finite…

A digraph $D=(V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has…

A toroidal affine Nash group is the affine Nash group analogue of an anti-affine algebraic group. In this note, we prove analogues of Rosenlicht's structure and decomposition theorems: (1) Every affine Nash group $G$ has a smallest normal…

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

In [5] I solved the Thom's conjecture that a proper Thom map is triangulable. In this paper I drop the properness condition in the semialgebraic case and, moreover, in the definable case in an o-minimal structure.

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

We extend previous results on boundedness of sets of coherent sheaves on a compact K\"ahler manifold to the relative and not necessarily smooth case. This enlarged context allows us to prove properness properties of the relative Douady…

We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq \mathbb{R}^d$ of size $\lvert U\rvert = n$. Their mutual goal is to decide using minimum communication…

Let $D$ be a digraph. We define the minimum semi-degree of $D$ as $\delta^{0}(D) := \min \{\delta^{+}(D), \delta^{-}(D)\}$. Let $k$ be a positive integer, and let $S = \{s\}$ and $T = \{t_{1}, \dots ,t_{k}\}$ be any two disjoint subsets of…

We study biharmonic maps between conformally compact manifolds, a large class of complete manifolds with bounded geometry, asymptotically negative curvature, and smooth compactification. These metrics provide a far-reaching generalization…

Morphisms between schemes arising from multigraded rings are essential for understanding geometric relationships in algebraic geometry, yet a systematic theory for such maps has been lacking. In this paper, we develop a comprehensive…

Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…

A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces a semicomplete digraph. In this paper, we characterize all…

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…