Related papers: Monotone subsequence via ultrapower
Let $X$ be an arbitrary set. Then a topology $t$ on $X$ is said to be completely useful if every upper semicontinuous linear (total) preorder $\precsim$ on $X$ can be represented by an upper semicontinuous real-valued order preserving…
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some…
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
Over the past two decades the notion of a strong monad has found wide applicability in computing. Arising out of a need to interpret products in computational and semantic settings, different approaches to this concept have arisen. In this…
Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixed packing and covering constraints. We present a tight…
In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise…
We introduce a general multisummability theory of formal power series in Carleman ultraholomorphic classes. The finitely many levels of summation are determined by pairwise comparable, nonequivalent weight sequences admitting nonzero…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…
We introduce a model of simple type theory with potential infinite carrier sets. The functions in this model are automatically continuous, as defined in this paper. This notion of continuity does not rely on topological concepts, including…
How can we understand the origins of highly symmetrical objects? One way is to characterize them as the solutions of natural optimization problems from discrete geometry or physics. In this paper, we explore how to prove that exceptional…
This work proposes a new moment-SOS hierarchy, called CS-TSSOS, for solving large-scale sparse polynomial optimization problems. Its novelty is to exploit simultaneously correlative sparsity and term sparsity by combining advantages of two…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…
Balancing competing objectives is omnipresent across disciplines, from drug design to autonomous systems. Multi-objective Bayesian optimization is a promising solution for such expensive, black-box problems: it fits probabilistic surrogates…
We generalize to the case of compactified superstrings a construction given previously for critical superstrings of finite one loop amplitudes that are well-defined for all external momenta. The novel issues that arise for compactified…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…