English
Related papers

Related papers: On a Nash curve selection lemma through finitely m…

200 papers

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Differential Geometry · Mathematics 2023-01-30 Chengcheng Yang

We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…

Combinatorics · Mathematics 2019-09-04 Jan Hubička , Jaroslav Nešetřil

Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…

Optimization and Control · Mathematics 2026-01-27 Dmytro O. Plutenko

The famous theorem of Higman states that for any well-quasi-order (wqo) $Q$ the embeddability order on finite sequences over $Q$ is also wqo. In his celebrated 1965 paper, Nash-Williams established that the same conclusion holds even for…

Logic · Mathematics 2024-05-24 Fedor Pakhomov , Giovanni Soldà

The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the…

Logic in Computer Science · Computer Science 2014-06-03 Hubie Chen

This paper studies the limits of empirical means of open-loop Nash equilibria of linear-quadratic stochastic differential games as the number of players goes to infinity, when the corresponding mean field game is of potential type and may…

Probability · Mathematics 2026-02-27 Alekos Cecchin , Jodi Dianetti

We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinatorics. Regarding the complexity of partitioning a graph…

Data Structures and Algorithms · Computer Science 2026-02-16 Tomáš Masařík , Michał Włodarczyk , Mehmet Akif Yıldız

Artificial barriers in Learning Automata (LA) is a powerful and yet under-explored concept although it was first proposed in the 1980s. Introducing artificial non-absorbing barriers makes the LA schemes resilient to being trapped in…

Computer Science and Game Theory · Computer Science 2022-04-05 Ismail Hassan , B. John Oommen , Anis Yazidi

In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…

Computational Geometry · Computer Science 2022-03-16 Peyman Afshani , Pingan Cheng

An algebra A of operators on a Banach space X is called strictly semi-transitive if for all non-zero x,y in X there exists an operator S in A such that Sx=y or Sy=x. We show that if A is norm-closed and strictly semi-transitive, then every…

Functional Analysis · Mathematics 2007-05-23 H. P. Rosenthal , V. G. Troitsky

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Number Theory · Mathematics 2008-11-10 Viada Evelina

Every semicomplete multipartite digraph contains a quasi-Hamiltonian path, but the problem of finding a quasi-Hamiltonian path with prescribed start and end vertex is NP-complete even when restricted to semicomplete multipartite digraphs…

Combinatorics · Mathematics 2025-07-22 Julian Brinkmann

An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…

Functional Analysis · Mathematics 2017-09-26 Tom Drescher , Tim Netzer , Andreas Thom

We prove that any correspondence (multi-function) mapping a metric space into a Banach space that satisfies a certain pointwise Lipschitz condition, always has a continuous selection that is pointwise Lipschitz on a dense set of its domain.…

Functional Analysis · Mathematics 2017-08-24 Miek Messerschmidt

We prove that, under appropriate conditions, an abstract game with quasi-Leontief payoff functions $u_i : \prod_{j=1}^nX_j\to\mathbb{R}$ has a Nash equilibria. When all the payoff functions are globally quasi-Leontief, the existence and the…

Optimization and Control · Mathematics 2011-02-15 Walter Briec , QiBin Liang , Charles Horvath

TO APPEAR IN AEQUATIONES MATHEMATICAE - WITHOUT THEOREM 2. THEOREM 2 IS CORRECTLY PROVED IN PREVIOUS VERSIONS 1 AND 2. AUTHOR'S VERSION 3 (WITH A NEW FIGURE 6A) IS UNNECESSARY. Let F \subseteq R denote the field of numbers which are…

Metric Geometry · Mathematics 2009-09-25 Apoloniusz Tyszka

Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is well-constrained (i.e., square), Newton's method is locally quadratically convergent…

Algebraic Geometry · Mathematics 2019-10-16 Jonathan Hauenstein , Avinash Kulkarni , Emre Can Sertöz , Samantha Sherman

Given number fields $L \supset K$, smooth projective curves $C$ defined over $L$ and $B$ defined over $K$, and a non-constant $L$-morphism $h \colon C \to B_L$,we consider the curve $C_h$ defined over $K$ whose $K$-rational points…

Number Theory · Mathematics 2013-05-21 E. V. Flynn , D. Testa

Schwartz functions, or measures, are defined on any smooth semi-algebraic ("Nash") manifold, and are known to form a cosheaf for the semi-algebraic restricted topology. We extend this definition to smooth semi-algebraic stacks, which are…

Algebraic Geometry · Mathematics 2018-05-14 Yiannis Sakellaridis

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Optimization and Control · Mathematics 2008-12-08 J. William Helton , Jiawang Nie