Related papers: A random version of Mazur's lemma
We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…
A method of proving local continuity of concave functions on convex set possessing the $\mu$-compactness property is presented. This method is based on a special approximation of these functions. The class of $\mu$-compact sets can be…
Locally $L^0$-convex modules were introduced in [D. Filipovic, M. Kupper, N. Vogelpoth. Separation and duality in locally $L^0$-convex modules. J. Funct. Anal. 256(12), 3996-4029 (2009)] as the analytic basis for the study of conditional…
The converse of Schur's lemma (or CSL) condition on a module category has been the subject of considerable study in recent years. In this note we extend that work by developing basic properties of module categories in which the CSL…
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…
In this paper, we study a general Syracuse problem. We give some necessary conditions concerning the existence of eventual non trivial cycles. Some properties based on linear logarithmic forms are established. New general conjectures are…
We give a general Lagrange multiplier rule for mathematical programming problems in a Hausdorff locally convex space. We consider infinitely many inequality and equality constraints. Our results gives in particular a generalisation of the…
The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
The lefthanded Lov\'asz local lemma (LLLL) is a generalization of the Lov\'asz local lemma (LLL), a powerful technique from the probabilistic method. We prove a computable version of the LLLL and use it to effectivize a collection of…
Locally $L^0$-convex modules were introduced in [D. Filipovic, M. Kupper, N. Vogelpoth. Separation and duality in locally $L^0$-convex modules. J. Funct. Anal. 256(12), 3996-4029 (2009)] as the analytic basis for the study of multi-period…
We provide novel theoretical results regarding local optima of regularized $M$-estimators, allowing for nonconvexity in both loss and penalty functions. Under restricted strong convexity on the loss and suitable regularity conditions on the…
The Lov\'{a}sz Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calculus with conditional rewriting and provide general results in…
In this article, we prove a generalization of a theorem (Ogg's conjecture) due to Bary Mazur for arbitrary $N\in \N$ and for {\it number fields}. The main new observation is a modification of a theorem due to Glenn Stevens for the…
Given a lattice in an isocrystal, Mazur's inequality states that the Newton point of the isocrystal is less than or equal to the invariant measuring the relative position of the lattice and its transform under Frobenius. Conversely, it is…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We prove a gluing lemma for sections of line bundles on a rigid analytic variety. We apply the lemma, in conjunction with a result of Buzzard's, to give a proof of (a generalization) of Coleman's theorem which states that overconvergent…