Related papers: Rectifiability and approximate differentiability o…
We obtain a Fourier dimension estimate for sets of exact approximation order introduced by Bugeaud for certain approximation functions $\psi$. This Fourier dimension estimate implies that these sets of exact approximation order contain…
We characterise purely $n$-unrectifiable subsets $S$ of a complete metric space $X$ with finite Hausdorff $n$-measure by studying arbitrarily small perturbations of elements of the set of all bounded 1-Lipschitz functions $f\colon X \to…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
We prove $L^p$ quantitative differentiability estimates for functions defined on uniformly rectifiable subsets of the Euclidean space. More precisely, we show that a Dorronsoro-type theorem holds in this context: the $L^p$ norm of the…
We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…
A new exponentially convergent algorithm is proposed for an abstract the first order differential equation with unbounded operator coefficient possessing a variable domain. The algorithm is based on a generalization of the Duhamel integral…
We consider the space of real-valued continuously differentiable functions on a compact subset of a euclidean space. We characterize the completeness of this space and prove that the space of restrictions of continuously differentiable…
We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…
Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
We propose an equivalent formula for the higher-order derivatives used in the study of Generalized Almost Perfect Nonlinear functions over an arbitrary finite field of characteristic $p$. The result is obtained by counting the number of…
A discrete set $A$ 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 investigate properties of such sets in the case when $A-A$ is discrete. In…
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…
The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new…
Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…
The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…