English
Related papers

Related papers: Indecomposable $F_N$-trees and minimal laminations

200 papers

It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…

Combinatorics · Mathematics 2017-07-26 Stefan Gruenewald , Katharina T. Huber , Vincent Moulton , Mike Steel

We construct an unfolding path in Outer space which does not converge in the boundary, and instead it accumulates on the entire 1-simplex of projectivized length measures on a non-geometric arational $\mathbb{R}$-tree T. We also show that T…

Group Theory · Mathematics 2024-11-20 Mladen Bestvina , Radhika Gupta , Jing Tao

We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…

Probability · Mathematics 2026-03-25 Siarhei Finski

In this article, we study sharp bounds for the Neumann eigenvalues of the Laplace operator on graphs. We first obtain monotonicity results for the Neumann eigenvalues on trees. In particular, we show that increasing any number of boundary…

Spectral Theory · Mathematics 2025-12-25 Ashmita Singh , Sheela Verma

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Probability · Mathematics 2025-11-24 Gabriel Berzunza Ojeda , Cecilia Holmgren , Paul Thévenin

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…

Logic · Mathematics 2013-01-03 Andrzej Rosłanowski , Saharon Shelah

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

Representation Theory · Mathematics 2014-01-07 Wolfgang Peternell

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be claw-free if it does not contain $K_{1,3}$ as an induced subgraph. In this…

Combinatorics · Mathematics 2025-11-26 Pham Hoang Ha , Nguyen Gia Hien

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…

Combinatorics · Mathematics 2020-04-03 David A. Levin , Eric Ramos , Benjamin Young

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

Logic · Mathematics 2020-04-22 Radek Honzik , Sarka Stejskalova

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

Functional Analysis · Mathematics 2013-05-21 Costas Poulios , Athanasios Tsarpalias

Let $\mu$ be a probability measure on $\text{Out}(F_N)$ with finite first logarithmic moment with respect to the word metric, finite entropy, and whose support generates a nonelementary subgroup of $\text{Out}(F_N)$. We show that almost…

Group Theory · Mathematics 2016-02-10 Camille Horbez

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

We derive a graph expansion for the thermal partition function of solvable two-dimensional models with boundaries. This expansion of the integration measure over the virtual particles winding around the time cycle is obtained with the help…

High Energy Physics - Theory · Physics 2020-01-08 Ivan Kostov , Didina Serban , Dinh-Long Vu

Tree-level scattering amplitudes for a scalar particle coupled to an arbitrary number N of photons and a single graviton are computed. We employ the worldline formalism as the main tool to compute the irreducible part of the amplitude,…

High Energy Physics - Theory · Physics 2020-08-04 Naser Ahmadiniaz , Filippo Maria Balli , Olindo Corradini , José Manuel Dávila , Christian Schubert

We investigate the Bieri--Neumann--Strebel--Renz (BNSR) invariants of irreducible uniform lattices. In the case of a direct product of a tree and a Euclidean space we show that vanishing of the BNSR invariants for all finite-index subgroups…

Group Theory · Mathematics 2025-10-15 Sam Hughes

We examine the structure of the insertion-elimination Lie algebra on rooted trees introduced in \cite{CK}. It possesses a triangular structure $\g = \n_+ \oplus \mathbb{C}.d \oplus \n_-$, like the Heisenberg, Virasoro, and affine algebras.…

Quantum Algebra · Mathematics 2009-11-13 Matthew Szczesny

We present field theoretical descriptions of massless (2+1) dimensional nonrelativistic fermions in an external magnetic field, in terms of a fermionic and bosonic second quantized language. An infinite dimensional algebra, $W_{\infty}$,…

High Energy Physics - Theory · Physics 2009-10-22 Satoshi Iso , Dimitra Karabali , B. Sakita

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Group Theory · Mathematics 2007-05-23 Matt Clay

Trees are very agreeable objects to work with, offering a diversity of behaviour within a structure that is sufficiently simple to admit precise analysis. Thus we are able to offer fairly satisfactory necessary and sufficient conditions on…

Functional Analysis · Mathematics 2016-09-06 Richard Haydon
‹ Prev 1 3 4 5 6 7 10 Next ›