Related papers: Monotone subsequence via ultrapower
We devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fra\"{\i}ss\'{e} limit) embeds all countable semigroups. This approach provides us not only…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
Hyperfinite knots, or limits of equivalence classes of knots induced by a knot invariant taking values in a metric space, were introduced in a previous article by the author. In this article, we present new examples of hyperfinite knots…
We study a relationship between the ultraproduct of a crossed product von Neumann algebra and the crossed product of an ultraproduct von Neumann algebra. As an application, the continuous core of an ultraproduct von Neumann algebra is…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…
Entropy always increases monotonically in a closed system but complexity increases at first and then decreases as equilibrium is approached. Commonsense information-related definitions for entropy and complexity demonstrate that complexity…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
With respect to earlier investigations, the theory of multi-component, concentric, copolar, axisymmetric, rigidly rotating polytropes is improved and extended, including subsystems with nonzero density on the boundary and subsystems with…
The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the…
In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of $k$ items from a ground set $V$ such that the weighted…
Supertask theory is used here to prove a contradictory result which involves the consistency of w-order and the Axiom of Infinity.
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
We give a new completion for the quasi-uniform spaces. We call the whole procedure {\it $\tau$-completion} and the new space {\it $\tau$-complement of the given}. The basic result is that every $T_{_0}$ quasi-uniform space has a…
Constraints can be interpreted in a broad sense as any kind of explicit restriction over the parameters. While some constraints are defined directly on the parameter space, when they are instead defined by known behaviour on the model,…
While there is a long tradition of reasoning about (non)termination in program analysis, specialized logics are typically needed to give different termination criteria. This includes partial correctness, where termination is not guaranteed,…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
In the 1990s, Steel and Woodin showed that under large cardinal hypotheses, the HOD of $L(\mathbb R)$ admits a fine-structural analysis. Although this theorem sheds light on various problems in descriptive set theory, the fine-structural…