相关论文: Elementary submodels and separable monotonically n…
A space $X$ is said to be $\kappa$-resolvable (resp. almost $\kappa$-resolvable) if it contains $\kappa$ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). $X$ is maximally resolvable iff…
We extend some results on even sets of nodes which have been proved for surfaces up to degree 6 to surfaces up to degree 10. In particular, we give a formula for the minimal cardinality of a nonempty even set of nodes.
We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.
This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
Let $\overline{M}$ be a smooth manifold with boundary $\partial M$ and interior $M$. Consider an affine connection $\nabla$ on $M$ for which the boundary is at infinity. Then $\nabla$ is projectively compact of order $\alpha$ if the…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…
We give a combinatorial characterization of countable submaximal subspaces of $2^\kappa$. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of $2^{\omega_1}$ whilst…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
We discuss the feasibility of the following learning problem: given unmatched samples from two domains and nothing else, learn a mapping between the two, which preserves semantics. Due to the lack of paired samples and without any…
We construct a complete metric space $M$ of cardinality continuum such that every non-singleton closed separable subset of $M$ fails to be a Lipschitz retract of $M$. This provides a metric analogue to the various classical and recent…
Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…
The presence of second-order smoothness for objective functions of optimization problems can provide valuable information about their stability properties and help us design efficient numerical algorithms for solving these problems. Such…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
We give a direct proof of an important result of Solynin which says that the Poincar\'e metric is a strongly submultiplicative domain function. This result is then used to define a new capacity for compact subsets of the complex plane…