Related papers: Kingman, category and combinatorics

For any open hyperbolic Riemann surface $X$, the Bergman kernel $K$, the logarithmic capacity $c_{\beta}$, and the analytic capacity $c_{B}$ satisfy the inequality chain $\pi K \geq c^2_{\beta} \geq c^2_B$; moreover, equality holds at a…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We show that Quillen's resolution theorem for K-theory also applies to exact $\infty$-categories. We introduce heart structures on a stable $\infty$-category, generalizing weight structures, and using resolution ideas, we show that the…

The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

We consider from a geometric point of view the conjectural fundamental lemma of Langlands and Shelstad for unitary groups over a local field of positive characteristic. We introduce projective algebraic varieties over the finite residue…

This paper deals with Poisson processes on an arbitrary measurable space. Using a direct approach, we derive formulae for moments and cumulants of a vector of multiple Wiener-It\^o integrals with respect to the compensated Poisson process.…

We give bounds for the module sectional category of products of maps which generalise a theorem of Jessup for Lusternik-Schnirelmann category. We deduce also a proof of a Ganea type conjecture for topological complexity. This is a first…

To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illuminate this problem.…

The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…

This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

In this paper,based on the available mathematical works on geometry and topology of hyperbolic manifolds and discrete groups, some results of Freedman et al (hep-th/9804058) are reproduced and broadly generalized. Among many new results the…

We develop a theory of commensurability of groups, of rings, and of modules. It allows us, in certain cases, to compare sizes of automorphism groups of modules, even when those are infinite. This work is motivated by the Cohen-Lenstra…

In this paper, we first establish a decomposition theorem for size-biased Poisson random measures. As consequences of this decomposition theorem, we get a spine decomposition theorem and a 2-spine decomposition theorem for some critical…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

Here we answer a conjecture by Ron Graham about getting finer upper bounds for van der Waerden numbers in the affirmative, but without the application of double induction or combinatorics as applied to sets of integers that contain some van…