Cover Image

Growth and irreducibility in path-incompressible trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barmpalias, George, Zhang, Xiaoyan
Format:	Preprint
Published:	2022
Subjects:	Combinatorics Information Theory Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computable one-way functions on the reals
by: Barmpalias, George, et al.
Published: (2024)

Dimensionality and randomness
by: Barmpalias, George, et al.
Published: (2024)

Collision-resistant hash-shuffles on the reals
by: Barmpalias, George, et al.
Published: (2025)

Complexity of inversion of functions on the reals
by: Barmpalias, George, et al.
Published: (2024)

Compression of enumerations and gain
by: Barmpalias, George, et al.
Published: (2023)

Pathwise-random trees and models of second-order arithmetic
by: Barmpalias, George, et al.
Published: (2021)

Oligomorphic groups and tensor categories
by: Harman, Nate, et al.
Published: (2022)

VC-dimension of generalized progressions in some nonabelian groups
by: Conant, Gabriel, et al.
Published: (2025)

Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC
by: Banerjee, Amitayu
Published: (2020)

Stabilizers and NIP arithmetic regularity
by: Conant, G., et al.
Published: (2025)

Approximate subgroups with bounded VC-dimension
by: Conant, Gabriel, et al.
Published: (2020)

Mekler's Construction and Murphy's Law for 2-Nilpotent Groups
by: Boissonneau, Blaise, et al.
Published: (2024)

A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture
by: Duda, Karol
Published: (2021)

Omega-categorical limits of betweenness relations and $D$-sets
by: Almazaydeh, Asma Ibrahim, et al.
Published: (2024)

An arithmetic algebraic regularity lemma
by: Pillay, Anand, et al.
Published: (2024)

An analytic version of stable arithmetic regularity
by: Conant, Gabriel, et al.
Published: (2024)

Upper bounds for measures on distal classes
by: Nekrasov, Ilia, et al.
Published: (2024)

Growth of regular partitions 2: Weak regularity
by: Terry, C.
Published: (2024)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)

Growth of regular partitions 4: strong regularity and the pairs partition
by: Terry, C.
Published: (2024)

Growth of regular partitions 3: strong regularity and the vertex partition
by: Terry, C.
Published: (2024)

Growth of regular partitions 1: Improved bounds for small slicewise VC-dimension
by: Terry, C.
Published: (2024)

The Finite Length Property of the Rado Graph and Friends
by: Yang, Jingjie, et al.
Published: (2026)

Speedability of computably approximable reals and their approximations
by: Barmpalias, George, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Monochromatic products and sums in the rationals
by: Bowen, Matt, et al.
Published: (2022)

Stable functions and Følner's Theorem
by: Conant, Gabriel
Published: (2024)

Capturing properties of planar diagrams in Lean proof assistant software
by: Litterick, Alastair, et al.
Published: (2025)

Computability Limits of Sequential Hypothesis Testing
by: Leshem, Amir
Published: (2026)

Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
by: Li, Cheuk Ting
Published: (2025)

Length Functions and the Dimension of Points in Self-Similar Fractal Trees
by: Porter, Christopher P.
Published: (2024)

Formalising Propositional Information via Implication Hypergraphs
by: Dalal, Vibhu
Published: (2025)

Higher Dimensional Chain Conditions
by: Todorcevic, Stevo, et al.
Published: (2023)

More Ramsey theory for highly connected monochromatic subgraphs
by: Hrušák, Michael, et al.
Published: (2023)

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture
by: Alm, Jeremy F., et al.
Published: (2019)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)

An extension of Priestley duality to fuzzy topologies and positive MV-algebras
by: Ortiz, Marby Zuley Bolaños, et al.
Published: (2025)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)