Related papers: On VC-minimal theories and variants

We consider C-graded vertex algebras, which are vertex algebras V with a C-grading such that V is an admissible V-module generated by 'lowest weight vectors'. We show that such vertex algebras have a 'good' representation theory in the…

We introduce and study a new class of representations of surface groups into Lie groups of Hermitian type, called weakly maximal representations. They are defined in terms of invariants in bounded cohomology and extend considerably the…

We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple…

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

We describe some basic facts about the weak subintegral closure of ideals in both the algebraic and complex-analytic settings. We focus on the analogy between results on the integral closure of ideals and modules and the weak subintegral…

We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible…

Weak measurements have an increasing number of applications in contemporary quantum mechanics. They were originally described as a weak interaction that slightly entangled the translational degrees of freedom of a particle to its spin,…

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…

This paper develops a novel approach to necessary optimality conditions for constrained variational problems defined in generally incomplete subspaces of absolutely continuous functions. Our approach involves reducing a variational problem…

The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…

Robust control seeks stabilizing policies that perform reliably under adversarial disturbances, with $\mathcal{H}_\infty$ control as a classical formulation. It is known that policy optimization of robust $\mathcal{H}_\infty$ control…

We introduce a notion of volatility uncertainty in discrete time and define the corresponding analogue of Peng's G-expectation. In the continuous-time limit, the resulting sublinear expectation converges weakly to the G-expectation. This…

We study the structure of representations, defined as approximations of minimal sufficient statistics that are maximal invariants to nuisance factors, for visual data subject to scaling and occlusion of line-of-sight. We derive analytical…

We give a potential alternative definition of a weak infinite dimensional category, in an unbiased fashion, using one one dimensional quiver with composition and extra structure.

Necessary conditions for high-order optimality in smooth nonlinear constrained optimization are explored and their inherent intricacy discussed. A two-phase minimization algorithm is proposed which can achieve approximate first-, second-…

We address a deep study of the convexity notions that arise in the study of weak* lower semicontinuity of supremal functionals as well as those raised by the power-law approximation of such functionals. Our quest is motivated by the…

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact…

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…