中文
相关论文

相关论文: Reverse mathematics of a uniform Kruskal-Friedman …

200 篇论文

We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…

逻辑 · 数学 2023-06-22 Andrej Bauer

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…

逻辑 · 数学 2022-07-26 Emanuele Frittaion

In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter…

机器学习 · 计算机科学 2017-11-07 Noga Alon , Moshe Babaioff , Yannai A. Gonczarowski , Yishay Mansour , Shay Moran , Amir Yehudayoff

We prove that every positive trace on a countably generated *-algebra can be approximated by positive traces on algebras of generic matrices. This implies that every countably generated tracial *-algebra can be embedded into a metric…

算子代数 · 数学 2010-05-06 Tim Netzer , Andreas Thom

In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…

组合数学 · 数学 2021-06-21 Suresh Dara , S. M. Hegde , Venkateshwarlu Deva , S. B. Rao , Thomas Zaslavsky

Let k be a global field and let k_v be the completion of k with respect to v, a non-archimedean place of k. Let \mathbf{G} be a connected, simply-connected algebraic group over k, which is absolutely almost simple of k_v-rank 1. Let…

群论 · 数学 2007-10-23 A. W. Mason , A. Premet , B. Sury , P. A. Zalesskii

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…

最优化与控制 · 数学 2023-05-31 Nguyen Dinh , Miguel A. Goberna , M. Volle

We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has infinitely many trees almost surely.…

概率论 · 数学 2021-01-26 Gábor Pete , Ádám Timár

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

Given a graph of C*-algebras, we prove a long exact sequence in KK-theory for both the maximal and the vertex-reduced fundamental C*-algebras in the presence of possibly non GNS-faithful conditional expectations. We deduce from it the…

算子代数 · 数学 2016-12-28 Fima Pierre , Germain Emmanuel

By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…

组合数学 · 数学 2018-02-15 Daniel Weißauer

We provide a relatively compact proof of the BPHZ theorem for regularity structures of decorated trees in the case where the driving noise satisfies a suitable spectral gap property, as in the Gaussian case. This is inspired by the recent…

概率论 · 数学 2023-10-10 Martin Hairer , Rhys Steele

We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the…

概率论 · 数学 2007-05-23 G. R. Grimmett , S. N. Winkler

The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…

数论 · 数学 2017-05-10 Shachar Lovett , Oded Regev

Fix $p\geq 5$ an odd integer integer. Let $M_n$ be a uniform $p$-angulation with $n$ vertices and endowed with the uniform probability measure on its vertices. We prove that, there exists $C_p\in \mathbb{R}_+$ such that, after rescaling…

概率论 · 数学 2020-08-03 Louigi Addario-Berry , Marie Albenque

We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

概率论 · 数学 2019-02-20 Itai Benjamini , Russell Lyons , Oded Schramm

Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…

群论 · 数学 2026-04-01 Asgar Jamneshan , Andreas Thom

Singerman introduced to the theory of maps on surfaces an object that is a universal cover for any map. This object is a tessellation of the hyperbolic plane together with a certain subset of the ideal boundary. The 1-skeleton of this…

数论 · 数学 2015-08-07 Ian Short , Mairi Walker

We extend the relative index theorem on non-compact manifolds to encompass a wide variety of hypoelliptic differential operators of arbitrary order, demonstrating that the change in index when changing a differential operator locally can be…

K理论与同调 · 数学 2025-11-11 Magnus Fries