Related papers: Building Models of Determinacy from Below

Consider estimating a structured signal $\mathbf{x}_0$ from linear, underdetermined and noisy measurements $\mathbf{y}=\mathbf{A}\mathbf{x}_0+\mathbf{z}$, via solving a variant of the lasso algorithm: $\hat{\mathbf{x}}=\arg\min_\mathbf{x}\{…

In this brief note we analyse a toy model which can be derived from heterotic string compactifications on half-flat manifolds with SU(3) structure at first order in \alpha' (ie including matter fields). We show that for this model, finding…

We prove that if X is any 2-regular projective scheme (in the sense of Castelnuovo-Mumford) then X is "small". This means that if L is a linear space and Y:= L\cap X is finite, then Y is "linearly independent" in the sense that the…

Let g be a semisimple complex Lie algebra and k in g be any algebraic subalgebra reductive in g. For any simple finite dimensional k-module V, we construct simple (g; k)-modules M with finite dimensional k-isotypic components such that V is…

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we…

We consider deformations of finite or infinite dimensional Lie algebras over a field of characteristic 0. There is substantial confusion in the literature if one tries to describe all the non-equivalent deformations of a given Lie algebra.…

The Minimum Description Length (MDL) principle selects the model that has the shortest code for data plus model. We show that for a countable class of models, MDL predictions are close to the true distribution in a strong sense. The result…

We establish well-posedness and maximal regularity estimates for linear parabolic SPDE in divergence form involving random coefficients that are merely bounded and measurable in the time, space, and probability variables. To reach this…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

We consider the Pohlmeyer reduced sigma model describing AdS$_5$ minimal surfaces. We show that, similar to the affine Toda models, there exists a conformal extension to this model which admits a Lax formulation. The Lax connection is shown…

Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…

In this note we construct Swiss cheeses X such that R(X) is non-regular but such that R(X) has no non-trivial Jensen measures. We also construct a non-regular uniform algebra with compact, metrizable character space such that every point of…

Let L be a finite dimensional simple Lie algebra over an algebraically closed field of characteristic p>3. We prove in this paper that if all tori of maximal dimansion in the semisimple p-envelope of L are standard, the L is up to…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…

We prove that the ordinary least-squares (OLS) estimator attains nearly minimax optimal performance for the identification of linear dynamical systems from a single observed trajectory. Our upper bound relies on a generalization of…

Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree…