Related papers: Monotone subsequence via ultrapower
A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to the given one. This…
With infinitely many high-quality data points, infinite computational power, an infinitely large foundation model with a perfect training algorithm and guaranteed zero generalization error on the pretext task, can the model be used for…
A product of compact normal spaces is normal; the product of a countably infinite collection of non-trivial spaces is normal if and only if it is countably paracompact and each of its finite sub-products is normal; if all powers of a space…
Homogeneous countably compact spaces $X$ and $Y$ whose product $X\times Y$ is not pseudocompact are constructed. It is proved that all compact subsets of homogeneous subspaces of the third power of an extremally disconnected space are…
This paper addresses the problem of sequential submodular maximization: selecting and ranking items in a sequence to optimize some composite submodular function. In contrast to most of the previous works, which assume access to the utility…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…
We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking…
We propose a mechanism of superconductivity in which the order of the ground state does not arise from the usual Landau mechanism of spontaneous symmetry breaking but is rather of topological origin. The low-energy effective theory is…
The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…
Monotone systems constitute one of the most important classes of dynamical systems used in mathematical biology modeling. The objective of this paper is to extend the notion of monotonicity to systems with inputs and outputs, a necessary…
We show that every multi-correlation sequence is the sum of a generalized nilsequence and a null-sequence. This proves a conjecture of N. Frantzikinakis. A key ingredient is the reduction of ergodic multidimensional inverse theorems to…
We study three kinds of compactness in some variants of G\"odel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the…
We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension of the well-known size-change termination method.…
In the present paper we prove the compactness theorem with respect to partial structures and quasi-truth, using the technique of ultraproducts. Partial structures and quasi-truth are two notions developed within the partial structures…
A mixture preorder is a preorder on a mixture space (such as a convex set) that is compatible with the mixing operation. In decision theoretic terms, it satisfies the central expected utility axiom of strong independence. We consider when a…
In this note a notion of generalized topological entropy for arbitrary subsets of the space of all sequences in a compact topological space is introduced. It is shown that for a continuous map on a compact space the generalized topological…
The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this…
In the preprocessing framework for dealing with uncertain data, one is given a set of regions that one is allowed to preprocess to create some auxiliary structure such that when a realization of these regions is given, consisting of one…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…