Related papers: Arbitrarily Close for Summer 2022 Analysis
Pseudo algebraically closed, pseudo real closed, and pseudo $p$-adically closed fields are examples of unstable fields that share many similarities, but have mostly been studied separately. In this text, we propose a unified framework for…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…
Symbolic nonparametric bounds for partial identification of causal effects now have a long history in the causal literature. Sharp bounds, bounds that use all available information to make the range of values as narrow as possible, are…
The study of rational point sets on circles over the Euclidean plane is discussed in a more general framework, i.e. we generalize the notion rational and consider these circular point sets over arbitrary fields. We also determine the…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and…
This paper defines analysis-suitable T-splines for arbitrary degree (including even and mixed degrees) and arbitrary dimension. We generalize the concept of anchor elements known from the two-dimensional setting, extend existing concepts of…
Approximate Bayesian Computation (ABC for short) is a family of computational techniques which offer an almost automated solution in situations where evaluation of the posterior likelihood is computationally prohibitive, or whenever…
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known…
Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Surprisal theory links human processing effort to the predictability of an upcoming linguistic unit, but empirical work often leaves the notion of a unit underspecified. In practice, experimental stimuli are segmented into linguistically…
We prove that holomorphic maps from an open subset of a complex smooth projective curve to a complex smooth projective rationally simply connected variety can be approximated by algebraic maps for the compact-open topology. This theorem can…
We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
Recent research has revealed that machine learning models have a tendency to leverage spurious correlations that exist in the training set but may not hold true in general circumstances. For instance, a sentiment classifier may erroneously…