Related papers: A Locale for Minimal Bad Sequences

We study (strong) first countability of locally solid convergence structures on Archimedean vector lattices. Among other results, we characterise those vector lattices for which relatively unform-, order-, and $\sigma$-order convergence,…

Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\f$ in $\hil$ we find necessary and sufficient…

We study the identification of direct and indirect causes on time series and provide conditions in the presence of latent variables, which we prove to be necessary and sufficient under some graph constraints. Our theoretical results and…

We propose the notions of uniform local weak o-minimality and $*$-local weak o-minimality. Local monotonicity theorems hold in definably complete locally o-minimal structures and uniformly locally o-minimal structures of the second kind. In…

We prove that Higman's lemma is strictly stronger for better quasi orders than for well quasi orders, within the framework of reverse mathematics. In fact, we show a stronger result: the infinite Ramsey theorem (for tuples of all lengths)…

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

We introduce the notion of strong local minimizer for the problems of the calculus of variations on time scales. Simple examples show that on a time scale a weak minimum is not necessarily a strong minimum. A time scale form of the…

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…

In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…

When searching for global optima of nonconvex unconstrained optimization problems, it is desirable that every local minimum be a global minimum. This property of having no spurious local minima is true in various problems of interest…

We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function.…

We show that the de Bruijn-Erd\H{o}s condition for the error term in their improvement of Fekete's Lemma is not only sufficient but also necessary in the following strong sense. Suppose that given a sequence $0\leq f(1)\leq f(2)\leq…

We develop the theory of locally small spaces in a new simple language and apply this simplification to re-build the theory of locally definable spaces over structures with topologies.

We study the theoretical properties of learning a dictionary from $N$ signals $\mathbf x_i\in \mathbb R^K$ for $i=1,...,N$ via $l_1$-minimization. We assume that $\mathbf x_i$'s are $i.i.d.$ random linear combinations of the $K$ columns…

We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular stringological complexity measures of the sequence. In this…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

In this paper we study the regularity of the local minima of integral functionals: in particular, not convexity (quasi-convexity, policonvexity or rank one convexity) hypothesis will be made on the density, neither structure hypothesis nor…

Weakly approximable triangulated categories, introduced by Neeman, provide a powerful framework for studying localization phenomena in triangulated categories. In this paper, we establish new localization theorems showing that, under mild…

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

We derive basic properties of minimal extensions of local rings and their restrictions to subrings. Some applications are included to subrings of truncated polynomial rings.