Related papers: Patterns in thick compact sets

It is shown that a large class of properties coincide for weighted composition operators on a large class of weighted VMOA spaces, including the ones with logarithmic weights and the ones with standard weights $(1-|z|)^{-c}, \ 0\leq c<…

For two-dimensional lattice equations one definition of integrability is that the model can be naturally and consistently extended to three dimensions, i.e., that it is "consistent around a cube" (CAC). As a consequence of CAC one can…

Regularity properties of the pressure are related to phase transitions. In this article we study thermodynamic formalism for systems defined in non-compact phase spaces, our main focus being countable Markov shifts. We produce metric…

This paper is concerned with "nice" compactifications of manifolds. Siebenmann's iconic dissertation characterized open manifolds M^m (m>5) compactifiable by addition of a manifold boundary. His theorem extends easily to cases where M^m is…

We introduce new invariants associated to collections of compact subsets of a symplectic manifold. They are defined through an elementary-looking variational problem involving Poisson brackets. The proof of the non-triviality of these…

In this paper, we establish a Minkowski-type inequality for weak Lebesgue space, which allows us to obtain a characterization of relative compactness in these spaces. Furthermore, we are the first to investigate the compactness results of…

The Nystrom method is an efficient technique used to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by…

Let T be a C^2-expanding self-map of a compact, connected, smooth, Riemannian manifold M. We correct a minor gap in the proof of a theorem from the literature: the set of points whose forward orbits are nondense has full Hausdorff…

We obtain game-theoretic characterizations for meagerness and rareness of filters on a countable set.

The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise probabilities. We characterize the cone of exact games by…

We define and undertake a systematic study of thick, syndetic, and piecewise syndetic subsets of a Fra\"iss\'e structure. Each of these collections forms a family in the sense of Akin and Glasner [AG], and we define and study ultrafilters…

A new approach is developed within the first-order Born approximation to light scattering from a collection of particles with $\mathcal{L}$ types. Two $\mathcal{L}\times\mathcal{L}$ matrices called pair-potential matrix (PPM) and…

In the context of stationary $\mathbb{Z}^d$ nearest-neighbour Gibbs measures $\mu$ satisfying strong spatial mixing, we present a new combinatorial condition (the topological strong spatial mixing property (TSSM)) on the support of $\mu$…

This paper introduces a notion of weak solution for the coupled system of master equations in mean field games with a major player. It extends the previously introduced notion of Lipschitz solutions in mean field games. By relying on a…

We develop in this paper general techniques to analyze local combinatorial structures in product sets of two subsets of a countable group which are "large" with respect to certain classes of (not necessarily invariant) means on the group.…

A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progressions and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness…

The Nystrom method is an efficient technique to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by…