English
Related papers

Related papers: Melons are branched polymers

200 papers

A matching $M$ of a graph $G$ is maximal if it is not a proper subset of any other matching in $G$. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In particular, almost nothing is known…

Combinatorics · Mathematics 2015-11-03 Tomislav Došlić , Taylor Short

The Grothendieck classes of melonic graphs satisfy a recursive relation and may be written as polynomials in the class of the moduli space $\mathcal{M}_{0,4}$ with nonnegative integer coefficients, conjectured to be log-concave. In this…

Algebraic Geometry · Mathematics 2025-04-08 Stephanie Chen

The fluctuations of two-dimensional extended objects membranes is a rich and exciting field with many solid results and a wide range of open issues. We review the distinct universality classes of membranes, determined by the local order,…

Soft Condensed Matter · Physics 2014-10-13 Mark J. Bowick , Alex Travesset

We propose a novel characterization method of randomly branched polymers based on the geometrical property of such objects in confined spaces. The central idea is that randomly branched polymers exhibit passing/clogging transition across…

Soft Condensed Matter · Physics 2014-02-03 Takahiro Sakaue , Françoise Brochard-Wyart

Single two dimensional polymers confined to a strip are studied by Monte Carlo simulations. They are described by N-step self-avoiding random walks on a square lattice between two parallel hard walls with distance 1 << D << N^\nu (\nu = 3/4…

Soft Condensed Matter · Physics 2007-05-23 Hsiao-Ping Hsu , Peter Grassberger

We demonstrate that random tensors transforming under rank-$5$ irreducible representations of $\mathrm{O}(N)$ can support melonic large $N$ expansions. Our construction is based on models with sextic ($5$-simplex) interaction, which…

Mathematical Physics · Physics 2022-01-20 Sylvain Carrozza , Sabine Harribey

The notion of word-representable graphs is a generalization of comparability graphs, in which graphs are represented by words. The complexity of word-representation of a word-representable graph is captured through the representation…

Combinatorics · Mathematics 2026-02-17 Khyodeno Mozhui , K. V. Krishna

Distributional tensor fields can be regarded as multilinear mappings with distributional values or as (classical) tensor fields with distributional coefficients. We show that the corresponding isomorphisms hold also in the bornological…

Functional Analysis · Mathematics 2011-05-10 Eduard Nigsch

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…

Statistical Mechanics · Physics 2022-05-19 Jason Cantarella , Tetsuo Deguchi , Clayton Shonkwiler , Erica Uehara

Membranes are of great technological and biological as well as theoretical interest. Two main classes of membranes can be distinguished: Fluid membranes and polymerized, tethered membranes. Here, we review progress in the theoretical…

Condensed Matter · Physics 2007-05-23 Kay Joerg Wiese

The rank three tensor model with tetrahedral interaction was shown by Carrozza and Tanasa to admit a $1/N$ expansion, dominated by melonic diagrams, and double tadpoles decorated with melons at next-to-leading order. This model has…

Mathematical Physics · Physics 2019-12-25 Valentin Bonzom

We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie, and Kenyon and Winkler to any hyperplane arrangement A. The volume of the…

Combinatorics · Mathematics 2009-12-18 Karola Meszaros , Alexander Postnikov

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…

Combinatorics · Mathematics 2017-09-22 Diego Nicodemos , Matěj Stehlík

The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…

Combinatorics · Mathematics 2019-08-21 Ivan Kryven

A folding of a branched cover of the 3-sphere that is branched over a knot is a continuous map of the cover into the product of the sphere with a disk that has the property that the projection onto the sphere factor induces the covering.…

Geometric Topology · Mathematics 2025-04-02 J. Scott Carter , Seonmi Choi , Byeorhi Kim

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

Group Theory · Mathematics 2023-02-28 Mark V Lawson , Aidan Sims , Alina Vdovina

A dessin is a $2$-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper…

Combinatorics · Mathematics 2018-06-13 Kan Hu , Naer Wang , Roman Nedela

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

Algebraic Geometry · Mathematics 2018-04-04 Luca Chiantini , Jonathan D. Hauenstein , Christian Ikenmeyer , J. M. Landsberg , Giorgio Ottaviani

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…

Category Theory · Mathematics 2014-07-15 Joachim Kock

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…

Combinatorics · Mathematics 2026-03-30 Nicholas Beaton , Simone Rinaldi