Max-min theorems for weak containment, square summable homoclinic points, and completely positive entropy

نویسندگان

چکیده

We prove a max-min theorem for weak containment in the context of algebraic actions. Namely, we show that given an action $G$ on $X,$ there is maximal, closed $G$-invariant subgroup $Y$ $X$ so weakly contained Bernoulli shift. This also minimal any shift $G\curvearrowright X/Y$-ergodic presence X$. give several applications, including major simplification proof measure entropy equals topological principal actions whose associated convolution operator injective. deduce from our techniques square summable homoclinic group dense have completely positive when acting sofic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Containment and Rokhlin Entropy

We define a new notion of weak containment for joinings, and we show that this notion implies an inequality between relative Rokhlin entropies. This leads to new upper bounds to Rokhlin entropy. We also use this notion to study how Pinsker algebras behave under direct products, and we study the Rokhlin entropy of restricted actions of finite-index subgroups.

متن کامل

Max-Margin Min-Entropy Models

We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on the input. Given an input, an m3e model predicts the output with the smallest corresponding Rényi entropy of generalized distribution. This is equivalent to minimizing a score that consists of two terms: (i) the negativ...

متن کامل

Max-Flow Min-Cut Theorems for Multi-User Communication Networks

Traditionally, communication networks are modeled and analyzed in terms of information flows in graphs. In this paper, we introduce a novel symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms from logic. In order to account multi-user or dynamic networks, we allow distributed coding functions, which represent the same n...

متن کامل

Approximate Max--ow Min-(multi)cut Theorems and Their Applications

Consider the multicommodity ow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-ow min-multicut theorem: min multicut O(log k) max ow min multicut; where k is the number of commodities. Our proof is constructive; it enables us to nd a multicut within O(log k) of the max ow (and hence also the optimal multicut). In addition, the pro...

متن کامل

Interior points of the completely positive cone

A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indiana University Mathematics Journal

سال: 2021

ISSN: ['1943-5258', '0022-2518', '1943-5266']

DOI: https://doi.org/10.1512/iumj.2021.70.8535