Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.09093

Dimensional reduction for generalized continuum polymers

Tyler Helmuth
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Brydges-Imbrie dimensional reduction formula relates the pressure of a $d$-dimensional gas of hard spheres to a model of $(d+2)$-dimensional branched polymers. Brydges and Imbrie's proof was non-constructive and relied on a supersymmetric localization lemma. The main result of this article is a constructive proof of a more general dimensional reduction formula that contains the Brydges--Imbrie formula as a special case. Central to the proof are invariance lemmas, which were first introduced by Kenyon and Winkler for branched polymers. The new dimensional reduction formulas rely on invariance lemmas for central hyperplane arrangements that are due to Mészáros and Postnikov. Several applications are presented, notably dimensional reduction formulas for (i) non-spherical bodies and (ii) for corrections to the pressure due to symmetry effects.

Explore related subjects

math.COmath-phmath.MPmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tyler Helmuth. 2016-05-30. Dimensional reduction for generalized continuum polymers. https://doi.org/10.1007/s10955-016-1597-6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗