惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

雷峰网
雷峰网
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
T
Tailwind CSS Blog
F
Fortinet All Blogs
Microsoft Azure Blog
Microsoft Azure Blog
Jina AI
Jina AI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
N
Netflix TechBlog - Medium
B
Blog RSS Feed
Blog — PlanetScale
Blog — PlanetScale
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
T
The Blog of Author Tim Ferriss
D
Docker
博客园 - 聂微东
博客园 - 【当耐特】
博客园 - 三生石上(FineUI控件)
L
LangChain Blog
量子位
宝玉的分享
宝玉的分享
博客园 - 司徒正美
The Cloudflare Blog
G
Google Developers Blog
Microsoft Security Blog
Microsoft Security Blog
腾讯CDC

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Ramsey Property and Block Oscillation Stability on Normal...
S. Garcia-Ferreira, A. C. Hernandez-Soto · 2020-09-08 · via math.CO updates on arXiv.org

A well-known application of the Ramsey Theorem in the Banach Space Theory is the proof of the fact that every normalized basic sequence has a subsequence which generates a spreading model (the Brunel-Sucheston Theorem). Based on this application, as an intermediate step, we can talk about the notion of $(k,\varepsilon)-$oscillation stable sequence, which will be described and analyzed more generally in this article. Indeed, we introduce the notion $((\mathcal{B}_i)_{i=1}^k,\varepsilon)-$block oscillation stable sequence where $(\mathcal{B}_i)_{i=1}^k$ is a finite sequence of barriers and using what we will call blocks of barriers. In particular, we prove that the Ramsey Theorem is equivalent to the statement ``for every finite sequence $(\mathcal{B}_i)_{i=1}^k$ of barriers, every $\varepsilon>0$ and every normalized sequence $(x_i)_{i\in\mathbb{N}}$ there is a subsequence $(x_i)_{i\in M}$ that is $((\mathcal{B}_i\cap\mathcal{P}(M))_{i=1}^k,\varepsilon)-$block oscillation stable'', where $\mathcal{P}(M)$ is the power set of the infinite set M. Besides, we introduce the $(\mathcal{B}_i)_{i\in\mathbb{N}}-$block asymptotic model of a normalized basic sequence where $(\mathcal{B}_i)_{i\in\mathbb{N}}$ is a sequence of barriers. These models are a generalization of the spreading models and are related to the $((\mathcal{B}_i)_{i=1}^k,\varepsilon)-$block oscillation stable sequences. We show that the Brunel-Sucheston is satisfied for the $(\mathcal{B}_i)_{i\in\mathbb{N}}-$block asymptotic models, and we also prove that this result is equivalent to the Ramsey Theorem. The difference between our theorem and the Brunel-Sucheston Theorem is based on the number of different models that are obtained from the same normalized basic sequence through them. This and other observations about $(\mathcal{B}_i)_{i\in\mathbb{N}}-$block asymptotic models are noted in an example at the end of the article.