Related papers: On a Nash curve selection lemma through finitely m…
Let X be an algebraic variety of characteristic zero. Terminal valuations are defined in the sense of the minimal model program, as those valuations given by the exceptional divisors on a minimal model over X. We prove that every terminal…
In this paper we investigate realization theory of a class of non-linear systems, called Nash systems. Nash systems are non-linear systems whose vector fields and readout maps are analytic semi-algebraic functions. In this paper we will…
This paper is concerned with the application of Stackelberg-Nash strategies to control fourth order linear and semi-linear parabolic equations. We assume that the system is acted through a hierarchy of distributed controls: one main control…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
We quantify the density of rational points in the unit sphere $S^n$, proving analogues of the classical theorems on the embedding of $\q^n$ into $\r^n$. Specifically, we prove a Dirichlet theorem stating that every point $\alpha \in S^n$ is…
In a 2017 paper, later presented at the Web and Internet Economics conference, titled ``Sequential Deliberation for Social Choice", the authors propose a mechanism in which a series of agents, are tasked to negotiate over a set of decisions…
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…
This work investigates the existence and uniqueness of the Nash equilibrium (solutions to competitive problems in which individual controls aim at separate desired states) for a bi-objective optimal control problem governed by a fractional…
In finite dimensions, controllability of bilinear quantum control systems can be decided quite easily in terms of the "Lie algebra rank condition" (LARC), such that only the systems Lie algebra has to be determined from a set of generators.…
The universal limit theorem is a central result in rough path theory, which has been proved for: (i) rough paths with roughness $\frac{1}{3}< \alpha \leq \frac{1}{2}$; (ii) geometric rough paths with roughness $0< \alpha \leq 1$; (iii)…
We address the problem of determining the degree a plane curve must have in order to pass with multiplicity m through r points in general position. A conjecture of Nagata states that one must have d > m \sqrt{r}. We prove the inequalities d…
The "openness" of a complex polynomial mapping is discussed and applied to the Fundamental Theorem of Algebra. In this category fall proofs of S. Wolfenstein, R.L. Thompson, J. Milnor, and S. Reich-S. Smale. These proofs take into account…
The classical Besicovitch projection theorem states that if a planar set $E$ with finite length is purely unrectifiable, then almost all orthogonal projections of $E$ have zero length. We prove a quantitative version of this result: if…
Let $G$ be a semiabelian variety defined over an algebraically closed field $K$, endowed with a rational self-map $\Phi$. Let $\alpha\in G(K)$ and let $\Gamma\subseteq G(K)$ be a finitely generated subgroup. We show that the set…
A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…
We identify structural assumptions which provide solvability of the Nash system arising from a linear-quadratic closed-loop game, with stable properties with respect to the number of players. In a setting of interactions governed by a…
We develop a theory of quasimaps to a moduli space of sheaves $M$ on a surface $S$. Under some assumptions, we prove that moduli spaces of quasimaps are proper and carry a perfect obstruction theory. Moreover, they are naturally isomorphic…
A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the scheduling policy or the state of other queues. A game theoretic…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…