English
Related papers

Related papers: The Jacaranda tree is strongly aperiodic and has z…

200 papers

In this paper, we present asymptotic analysis of self-adjusting contraction trees for incremental sliding window analytics.

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-05 Pramod Bhatotia

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

Combinatorics · Mathematics 2026-01-13 Hyunwoo Lee

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

Probability · Mathematics 2007-05-23 Konstantin Borovkov , Vladimir Vatutin

In this paper, we study the evolution of a Finitary Random Interlacement (FRI) with respect to the expected length of each fiber. In contrast to the previously proved phase transition between sufficiently large and small fiber length, we…

Probability · Mathematics 2021-02-03 Zhenhao Cai , Yunfeng Xiong , Yuan Zhang

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

Logic · Mathematics 2024-05-17 Mark Kamsma

We extend the results of Zhang et al. to show that $\lambda$ is an eigenvalue of a $k$-uniform hypertree $(k \geq 3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to…

Spectral Theory · Mathematics 2017-11-07 Gregory J. Clark , Joshua Cooper

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

Combinatorics · Mathematics 2019-04-29 Cristina G. Fernandes , César Hernández-Vélez , Orlando Lee , José C. de Pina

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…

Combinatorics · Mathematics 2020-09-04 Andrew Elvey Price , Wenjie Fang , Michael Wallner

Topological objects resulting from symmetry breakdown may be either stable or metastable depending on the pattern of symmetry breaking. However, if they trap zero-energy modes of fermions, and in the process acquire non-integer fermionic…

High Energy Physics - Theory · Physics 2007-05-23 Narendra Sahu , Urjit A. Yajnik

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a…

Logic · Mathematics 2022-04-15 Adi Jarden , Ziv Shami

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

Dynamical Systems · Mathematics 2018-07-05 Lluís Alsedà , Liane Bordignon , Jorge Groisman

Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can…

Combinatorics · Mathematics 2012-05-17 Hamed Hatami , Serguei Norine

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

Probability · Mathematics 2023-01-31 Laura Eslava , Bas Lodewijks , Marcel Ortgiese

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…

Combinatorics · Mathematics 2026-05-14 Yiting Wang

We show that algebraic dynamical systems with entropy rank one have uniformly exponentially many periodic points in all directions.

Dynamical Systems · Mathematics 2008-01-14 Richard Miles , Thomas Ward

Although false for general graphs, this note gives an elementary proof of the bunkbed conjecture for any acyclic graph. The argument is short and self-contained, and may be of educational interest.

Probability · Mathematics 2025-11-18 Serte Donderwinkel , Joost Jorritsma , Guillem Perarnau

We show that if a continuous self-map of a compact metric space is h-expansive and satisfies the shadowing property, then every non-empty uniformly rigid subset is zero-dimensional, and hence the set of periodic points is also…

Dynamical Systems · Mathematics 2025-05-21 Noriaki Kawaguchi

We numerically show that the Lattice Lotka-Volterra model, when realized on a square lattice support, gives rise to a {\it finite} production, per unit time, of the nonextensive entropy $S_q= \frac{1- \sum_ip_i^q}{q-1}$ $(S_1=-\sum_i p_i…

Condensed Matter · Physics 2009-11-10 G. A. Tsekouras , A. Provata , C. Tsallis

Spontaneous symmetry breaking plays a fundamental role in many areas of condensed matter and particle physics. A fundamental problem in ecology is the elucidation of the mechanisms responsible for biodiversity and stability. Neutral theory,…

Populations and Evolution · Quantitative Biology 2013-06-28 Claudio Borile , Miguel A. Muñoz , Sandro Azaele , Jayanth R. Banavar , Amos Maritan

In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…

Combinatorics · Mathematics 2015-10-29 László Németh
‹ Prev 1 3 4 5 6 7 10 Next ›