Related papers: Unbounded topologies and uo-convergence in locally…
We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…
Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the…
A mixed lattice vector space is a partially ordered vector space with two partial orderings, generalizing the notion of a Riesz space. Whereas the algebraic theory of mixed lattice structures dates back to the 1970s, the topological theory…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
A topology on a nonempty set $X$ specifies a natural subset of $\mathcal{P}(X)$. By identifying $\mathcal{P}(\mathcal{P}(X))$ with the totally disconnected compact Hausdorff space $2^{\mathcal{P}(X)}$, the lattice $Top(X)$ of all topologies…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Let $(X_n)_{n}$ be a sequence of uniform spaces such that each space $X_n$ is a closed subspace in $X_{n+1}$. We give an explicit description of the topology and uniformity of the direct limit $u-lim X_n$ of the sequence $(X_n)$ in the…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…
We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…
For an extended locally convex space $(X,\tau)$, in [8], the authors studied the finest locally convex topology (flc topology) $\tau_F$ on $X$ coarser than $\tau$. One can often prove facts about $(X, \tau)$ by applying classical locally…
We consider the inviscid Leray-$\alpha$ equations - an inviscid nonlocal regularisation of the Euler equations. In the first part, we prove the convergence of strong solutions of the Leray-$\alpha$ equations to strong solutions of the Euler…
If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric H\"older continuous rough paths can be approximated…
We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…