Related papers: Absolutely minimal Lipschitz extension of tree-val…
Despite the significant potential for various applications, stochastic games with long-run average payoffs have received limited scholarly attention, particularly concerning the development of learning algorithms for them due to the…
Ehrenfeucht-Fra\"iss\'e (EF) games are a basic tool in finite model theory for proving definability lower bounds, with many applications in complexity theory and related areas. They have been applied to study various logics, giving insights…
Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…
Let $\Omega\subset\mathbb R^n$ be a Lipschitz domain. Given $1\leq p<k\leq n$ and any $u\in W^{2,p}(\Omega)$ belonging to the little H\"older class $c^{1,\alpha}$, we construct a sequence $u_j$ in the same space with…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…
In this article, which is dedicated to my friend and colleague Boris Zilber on the occasion of his 75th birthday, I put forward a strategy for proving his quasiminimality conjecture for the complex exponential field. That is, for showing…
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…
Gromov's Lipschitz order is an order relation on the set of metric measure spaces. One of the compactifications of the space of isomorphism classes of metric measure spaces equipped with the concentration topology is constructed by using…
Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm…
Energy minimizing maps (E.M.M.s) play a central role in the calculus of variations, partial differential equations (PDEs), and geometric analysis. These maps are often embedded into $C^\infty$ Riemannian manifolds to minimize the Dirichlet…
An extension $K/k$ of analytic (i.e. real valued complete) fields is called small if it is topologically-algebraically generated by finitely many elements. We prove that this property is inherited by subextensions and hence topological…
Let $V$ be a finite tree with radially decaying weights. We show that there exists a set $E \subset \mathbb{R}^2$ for which the following two problems are equivalent: (1) Given a (real-valued) function $\phi$ on the leaves of $V$, extend it…
We focus on the problem of \emph{Answer-Level Fine-Tuning} (ALFT), where the goal is to optimize a language model based on the correctness or properties of its final answers, rather than the specific reasoning traces used to produce them.…
We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…
We propose an extension of the Ehrenfeucht-Fraisse game able to deal with logics augmented with Lindstrom quantifiers. We describe three different games with varying balance between simplicity and ease of use.
A metric space has the universal Lipschitz extension property if for each subspace S embedded quasi-isometrically into an arbitrary metric space M there exists a continuous linear extension of Banach-valued Lipschitz functions on S to those…
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…
A number of researchers have independently introduced topologies on the set of laws of stochastic processes that extend the usual weak topology. Depending on the respective scientific background this was motivated by applications and…
We introduce a new technique for the study of the local extension property (LEP) for boolean algebras and we use it to show that the clopen algebra of every compact Hausdorff space $K$ of finite height has LEP. This implies, under…
In the context of structured nonconvex optimization, we estimate the increase in minimum value for a decision that is robust to parameter perturbations as compared to the value of a nominal problem. The estimates rely on detailed…