Related papers: A Locale for Minimal Bad Sequences
We give a proof of the o-minimal version of the Whitney Extension Theorem simplified as compared to the original ones. A new simplifying ingredient is a definable variant of Urysohn's lemma for class $\mathcal{C}^q$ (see Section 3).
Stone locales together with continuous maps form a coreflective subcategory of spectral locales and perfect maps. A proof in the internal language of an elementary topos was previously given by the second-named author. This proof can be…
In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…
Lov\'asz Local Lemma (LLL) is a probabilistic tool that allows us to prove the existence of combinatorial objects in the cases when standard probabilistic argument does not work (there are many partly independent conditions). LLL can be…
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
If a discrete subset S of a topological group G with the identity 1 generates a dense subgroup of G and S \cup {1} is closed in G, then S is called a suitable set for G. We apply Michael's selection theorem to offer a direct,…
In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning…
We give conditions under which a product of topological spaces satisfies some local property. The conditions are necessary and sufficient when the corresponding global property is preserved under finite products. Further examples include…
We introduce a multiscale test statistic based on local order statistics and spacings that provides simultaneous confidence statements for the existence and location of local increases and decreases of a density or a failure rate. The…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.
In this paper, we discuss the generalized H\"older's inequality in p-summable sequence spaces. In particular, we shall prove sufficient and necessary conditions for generalized H\"older's inequality in those spaces. One of the keys to prove…
We prove a general result about the behaviour of minimizing sequences for nonlocal shape functionals satisfying suitable structural assumptions. Typical examples include functions of the eigenvalues of the fractional Laplacian under…
In this paper we extend the notion of a locally hypercyclic operator to that of a locally hypercyclic tuple of operators. We then show that the class of hypercyclic tuples of operators forms a proper subclass to that of locally hypercyclic…
We prove the local boundedness and the local H\"older continuity of weak solutions to nonlocal equations with variable orders and exponents under sharp assumptions.
The paper deals with existence and multiplicity of positive solutions to nonlocal equations with critical Hrardy-Sobolev nonlinearities and external terms. We establish the profile decomposition of the Palais-Smale sequences associated with…
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
This paper introduces a local optimization-based approach to test statistical hypotheses and to construct confidence intervals. This approach can be viewed as an extension of bootstrap, and yields asymptotically valid tests and confidence…
We consider locally recoverable codes (LRCs) and aim to determine the smallest possible length $n=n_q(k,d,r)$ of a linear $[n,k,d]_q$-code with locality $r$. For $k\le 7$ we exactly determine all values of $n_2(k,d,2)$ and for $k\le 6$ we…
An algorithmic proof of General Neron Desingularization is given here for one dimensional local rings and it is implemented in Singular. Also a theorem recalling Greenberg' strong approximation theorem is presented for one dimensional local…