Related papers: Rectifiability and approximate differentiability o…
A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…
If $(X,d)$ is a Polish metric space of dimension $0$, then by Wadge's lemma, no more than two Borel subsets of $X$ can be incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space…
We show that whenever a separable subset $S$ of a complete metric space $X$ admits a $d$-dimensional weak tangent field, the set $S$ is close to being $d$-dimensional in the following sense. Whenever $\mu$ is a Borel finite measure on $X$…
We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
Ou et al. (2022) introduce the problem of learning set functions from data generated by a so-called optimal subset oracle. Their approach approximates the underlying utility function with an energy-based model, whose parameters are…
A new concept for the higher-order accurate approximation of partial differential equations on manifolds is proposed where a surface mesh composed by higher-order elements is automatically generated based on level-set data. Thereby, it…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
We prove that in a Euclidean space of dimension at least two, there exists a compact set of Lebesgue measure zero such that any real-valued Lipschitz function defined on the space is differentiable at some point in the set. Such a set is…
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…
We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
Our goal in this paper is to extend the theory of quasi-exactly solvable Schrodinger operators beyond the Lie-algebraic class. Let $\cP_n$ be the space of n-th degree polynomials in one variable. We first analyze "exceptional polynomial…
We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…
The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…
This paper provides a new approach to derive various arbitrary high order finite difference formulae for the numerical differentiation of analytic functions. In this approach, various first and second order formulae for the numerical…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
Given a family of feasible subsets of a ground set, the packing problem is to find a largest subfamily of pairwise disjoint family members. Non-approximability renders heuristics attractive viable options, while efficient methods with…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…