English
Related papers

Related papers: Diamonds on trees

200 papers

We study the nonnegativity of stringy Hodge numbers of a projective variety with Gorenstein canonical singularities, which was conjectured by Batyrev. We prove that the $(p,1)$-stringy Hodge numbers are nonnegative, and for threefolds we…

Algebraic Geometry · Mathematics 2018-03-26 Sebastian Olano

There is a deep link between gravity and thermodynamics; in a precise way gravity can be derived from entanglement entropy in conformal field theories. However, this depends crucially on properties of horizons, and asymptotic symmetries of…

High Energy Physics - Theory · Physics 2025-04-30 Ian Nagle

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. We use Dirichlet form methods to construct…

Probability · Mathematics 2011-10-12 Siva Athreya , Michael Eckhoff , Anita Winter

We propose an off-shell bosonic string action that removes the renormalization window constraint of [1]. To all orders in conformal perturbation theory, this action allows for deformations of the worldsheet theory by any primary or…

High Energy Physics - Theory · Physics 2025-10-07 Amr Ahmadain , Alexander Frenkel , Aron C. Wall

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

A Boolean algebra $\mathcal A$ has the Nikodym property if every pointwise bounded sequence of bounded finitely additive measures on $\mathcal A$ is uniformly bounded. Assuming the Diamond Principle $\Diamond$, we will construct an example…

Functional Analysis · Mathematics 2021-05-27 Damian Sobota , Lyubomyr Zdomskyy

An $n$-vertex tree $T$ is said to be $\textit{graceful}$ if there exists a bijective labelling $\phi:V(T)\to \{1,\ldots,n\}$ such that the edge-differences $\{|\phi(x)-\phi(y)| : xy\in E(T)\}$ are pairwise distinct. The longstanding…

Combinatorics · Mathematics 2025-11-17 Shoham Letzter , Alexey Pokrovskiy , Ella Williams

Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…

Logic · Mathematics 2022-02-25 Corey Bacal Switzer

We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces…

Logic · Mathematics 2009-09-25 Andrzej Rosłanowski , Saharon Shelah

Within the field of phylogenetics there is growing interest in measures for summarising the dissimilarity, or 'incongruence', of two or more phylogenetic trees. Many of these measures are NP-hard to compute and this has stimulated a…

Data Structures and Algorithms · Computer Science 2015-03-03 Steven Kelk , Leo van Iersel , Celine Scornavacca

We consider stochastic processes on complete, locally compact tree-like metric spaces $(T,r)$ on their "natural scale" with boundedly finite speed measure $\nu$. Given a triple $(T,r,\nu)$ such a speed-$\nu$ motion on $(T,r)$ can be…

Probability · Mathematics 2017-04-04 Siva Athreya , Wolfgang Löhr , Anita Winter

We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…

Logic · Mathematics 2023-07-19 Rahman Mohammadpour

A stochastic forest model of young and old age class trees is studied. First, we prove existence, uniqueness and boundedness of global nonnegative solutions. Second, we investigate asymptotic behavior of solutions by giving a sufficient…

Probability · Mathematics 2016-11-15 Ton Viet Ta , Linh Thi Hoai Nguyen , Atsushi Yagi

Graham-Pollak showed that for $D = D_T$ the distance matrix of a tree $T$, det$(D)$ depends only on its number of edges. Several other variants of $D$, including directed/multiplicative/$q$- versions were studied, and always, det$(D)$…

Combinatorics · Mathematics 2023-08-08 Projesh Nath Choudhury , Apoorva Khare

Voevodsky's univalence axiom is often motivated as a realization of the equivalence principle; the idea that equivalent mathematical structures satisfy the same properties. Indeed, in Homotopy Type Theory, properties and structures can be…

Logic in Computer Science · Computer Science 2022-11-15 Rafaël Bocquet

In 2021 Baudier, Motakis, Schlumprecht, and Zs\'ak proved that if a sequence of graphs $(G_k)_{k\in{\mathbb{N}}}$ contains the sequence of complete graphs with uniformly bounded distortion, then the sequence of lamplighter graphs on $G_k$'s…

Functional Analysis · Mathematics 2025-11-26 Charlotte Melby , Beata Randrianantoanina

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Group Theory · Mathematics 2024-02-23 Pierre-Emmanuel Caprace , Timothée Marquis , Colin D. Reid

In this note, we give new examples of type I groups generalizing a previous result of Ol'shanskii. More precisely, we prove that all closed non-compact subgroups of Aut(T_d) acting transitively on the vertices and on the boundary of a…

Group Theory · Mathematics 2015-06-10 Corina Ciobotaru

Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by this theorem is a tower of exponentials whose height…

Data Structures and Algorithms · Computer Science 2026-05-04 Michael Lampis

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…

Logic in Computer Science · Computer Science 2020-10-19 Xuan-Bach Le , Aquinas Hobor , Anthony W. Lin