A partition of the Catalan numbers and enumeration of genealogical trees

Rainer Schimming

Displaying similar documents to “A partition of the Catalan numbers and enumeration of genealogical trees”

A note on the cubical dimension of new classes of binary trees

Kamal Kabyl, Abdelhafid Berrachedi, Éric Sopena (2015)

Czechoslovak Mathematical Journal

Similarity:

The cubical dimension of a graph $G$ is the smallest dimension of a hypercube into which $G$ is embeddable as a subgraph. The conjecture of Havel (1984) claims that the cubical dimension of every balanced binary tree with $2^{n}$ vertices, $n \geq 1$ , is $n$ . The 2-rooted complete binary tree of depth $n$ is obtained from two copies of the complete binary tree of depth $n$ by adding an edge linking their respective roots. In this paper, we determine the cubical dimension of trees obtained by subdividing twice...

The tree property at both $ℵ_{ω + 1}$ and $ℵ_{ω + 2}$

Laura Fontanella, Sy David Friedman (2015)

Fundamenta Mathematicae

Similarity:

We force from large cardinals a model of ZFC in which $ℵ_{ω + 1}$ and $ℵ_{ω + 2}$ both have the tree property. We also prove that if we strengthen the large cardinal assumptions, then in the final model $ℵ_{ω + 2}$ even satisfies the super tree property.

Trees and the dynamics of polynomials

Laura G. DeMarco, Curtis T. McMullen (2008)

Annales scientifiques de l'École Normale Supérieure

Similarity:

In this paper we study branched coverings of metrized, simplicial trees $F : T \to T$ which arise from polynomial maps $f : ℂ \to ℂ$ with disconnected Julia sets. We show that the collection of all such trees, up to scale, forms a contractible space $ℙ T_{D}$ compactifying the moduli space of polynomials of degree $D$ ; that $F$ records the asymptotic behavior of the multipliers of $f$ ; and that any meromorphic family of polynomials over $Δ^{*}$ can be completed by a unique tree at its central fiber. In the cubic case we give a...

On the (2,2)-domination number of trees

You Lu, Xinmin Hou, Jun-Ming Xu (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let γ(G) and $γ_{2, 2} (G)$ denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that $(2 (γ (T) + 1)) / 3 \leq γ_{2, 2} (T) \leq 2 γ (T)$ . Moreover, we characterize all the trees achieving the equalities.

Shadow trees of Mandelbrot sets

Virpi Kauko (2003)

Fundamenta Mathematicae

Similarity:

The topology and combinatorial structure of the Mandelbrot set $ℳ^{d}$ (of degree d ≥ 2) can be studied using symbolic dynamics. Each parameter is mapped to a kneading sequence, or equivalently, an internal address; but not every such sequence is realized by a parameter in $ℳ^{d}$ . Thus the abstract Mandelbrot set is a subspace of a larger, partially ordered symbol space, $Λ^{d}$ . In this paper we find an algorithm to construct “visible trees” from symbolic sequences which works whether or not the sequence...

The instability of nonseparable complete Erdős spaces and representations in ℝ-trees

Jan J. Dijkstra, Kirsten I. S. Valkenburg (2010)

Fundamenta Mathematicae

Similarity:

One way to generalize complete Erdős space $_{c}$ is to consider uncountable products of zero-dimensional $G_{δ}$ -subsets of the real line, intersected with an appropriate Banach space. The resulting (nonseparable) complete Erdős spaces can be fully classified by only two cardinal invariants, as done in an earlier paper of the authors together with J. van Mill. As we think this is the correct way to generalize the concept of complete Erdős space to a nonseparable setting, natural questions arise...

Turán's problem and Ramsey numbers for trees

Zhi-Hong Sun, Lin-Lin Wang, Yi-Li Wu (2015)

Colloquium Mathematicae

Similarity:

Let T¹ₙ = (V,E₁) and T²ₙ = (V,E₂) be the trees on n vertices with $V = v ₀, v ₁, . . ., v_{n - 1}$ , $E ₁ = v ₀ v ₁, . . ., v ₀ v_{n - 3}, v_{n - 4} v_{n - 2}, v_{n - 3} v_{n - 1}$ and $E ₂ = v ₀ v ₁, . . ., v ₀ v_{n - 3}, v_{n - 3} v_{n - 2}, v_{n - 3} v_{n - 1}$ . For p ≥ n ≥ 5 we obtain explicit formulas for ex(p;T¹ₙ) and ex(p;T²ₙ), where ex(p;L) denotes the maximal number of edges in a graph of order p not containing L as a subgraph. Let r(G₁,G₂) be the Ramsey number of the two graphs G₁ and G₂. We also obtain some explicit formulas for $r (T ₘ, T ₙ^{i})$ , where i ∈ 1,2 and Tₘ is a tree on m vertices with Δ(Tₘ) ≤ m - 3.

On operators which factor through $l_{p}$ or c₀

Bentuo Zheng (2006)

Studia Mathematica

Similarity:

Let 1 < p < ∞. Let X be a subspace of a space Z with a shrinking F.D.D. (Eₙ) which satisfies a block lower-p estimate. Then any bounded linear operator T from X which satisfies an upper-(C,p)-tree estimate factors through a subspace of ${(\sum F ₙ)}_{l_{p}}$ , where (Fₙ) is a blocking of (Eₙ). In particular, we prove that an operator from $L_{p}$ (2 < p < ∞) satisfies an upper-(C,p)-tree estimate if and only if it factors through $l_{p}$ . This gives an answer to a question of W. B. Johnson. We also prove...

On a characterization of $k$ -trees

De-Yan Zeng, Jian Hua Yin (2015)

Czechoslovak Mathematical Journal

Similarity:

A graph $G$ is a $k$ -tree if either $G$ is the complete graph on $k + 1$ vertices, or $G$ has a vertex $v$ whose neighborhood is a clique of order $k$ and the graph obtained by removing $v$ from $G$ is also a $k$ -tree. Clearly, a $k$ -tree has at least $k + 1$ vertices, and $G$ is a 1-tree (usual tree) if and only if it is a $1$ -connected graph and has no $K_{3}$ -minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of $k$ -trees as follows: if $G$ is a graph with at least $k + 1$ vertices, then $G$ is...

On operators from separable reflexive spaces with asymptotic structure

Bentuo Zheng (2008)

Studia Mathematica

Similarity:

Let 1 < q < p < ∞ and q ≤ r ≤ p. Let X be a reflexive Banach space satisfying a lower- $ℓ_{q}$ -tree estimate and let T be a bounded linear operator from X which satisfies an upper- $ℓ_{p}$ -tree estimate. Then T factors through a subspace of ${(\sum F ₙ)}_{ℓ_{r}}$ , where (Fₙ) is a sequence of finite-dimensional spaces. In particular, T factors through a subspace of a reflexive space with an $(ℓ_{p}, ℓ_{q})$ FDD. Similarly, let 1 < q < r < p < ∞ and let X be a separable reflexive Banach space satisfying an asymptotic...

Closure for spanning trees and distant area

Jun Fujisawa, Akira Saito, Ingo Schiermeyer (2011)

Discussiones Mathematicae Graph Theory

Similarity:

A k-ended tree is a tree with at most k endvertices. Broersma and Tuinstra [3] have proved that for k ≥ 2 and for a pair of nonadjacent vertices u, v in a graph G of order n with $d e g_{G} u + d e g_{G} v \geq n - 1$ , G has a spanning k-ended tree if and only if G+uv has a spanning k-ended tree. The distant area for u and v is the subgraph induced by the set of vertices that are not adjacent with u or v. We investigate the relationship between the condition on $d e g_{G} u + d e g_{G} v$ and the structure of the distant area for u and v. We prove...

Iterating along a Prikry sequence

Spencer Unger (2016)

Fundamenta Mathematicae

Similarity:

We introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from large cardinals that it is consistent that the tree property holds at ℵₙ for n ≥ 2, $ℵ_{ω}$ is strong limit and $2^{ℵ_{ω}} = ℵ_{ω + 2}$ .

Compactness properties of weighted summation operators on trees

Mikhail Lifshits, Werner Linde (2011)

Studia Mathematica

Similarity:

We investigate compactness properties of weighted summation operators $V_{α, σ}$ as mappings from ℓ₁(T) into $ℓ_{q} (T)$ for some q ∈ (1,∞). Those operators are defined by $(V_{α, σ} x) (t) : = α (t) \sum_{s ⪰ t} σ (s) x (s)$ , t ∈ T, where T is a tree with partial order ⪯. Here α and σ are given weights on T. We introduce a metric d on T such that compactness properties of (T,d) imply two-sided estimates for $e ₙ (V_{α, σ})$ , the (dyadic) entropy numbers of $V_{α, σ}$ . The results are applied to concrete trees, e.g. moderately increasing, biased or binary trees and to weights...

Note about sequences of extrema $(A, 2 B)$ -edge coloured trees

Urszula Bednarz, Iwona Włoch (2017)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

In this paper we determine successive extremal trees with respect to the number of all $(A, 2 B)$ -edge colourings.

On locating and differentiating-total domination in trees

Mustapha Chellali (2008)

Discussiones Mathematicae Graph Theory

Similarity:

A total dominating set of a graph G = (V,E) with no isolated vertex is a set S ⊆ V such that every vertex is adjacent to a vertex in S. A total dominating set S of a graph G is a locating-total dominating set if for every pair of distinct vertices u and v in V-S, N(u)∩S ≠ N(v)∩S, and S is a differentiating-total dominating set if for every pair of distinct vertices u and v in V, N[u]∩S ≠ N[v] ∩S. Let $γ ₜ^{L} (G)$ and $γ ₜ^{D} (G)$ be the minimum cardinality of a locating-total dominating set and a differentiating-total...

On graceful colorings of trees

Sean English, Ping Zhang (2017)

Mathematica Bohemica

Similarity:

A proper coloring $c : V (G) \to {1, 2, ..., k}$ , $k \geq 2$ of a graph $G$ is called a graceful $k$ -coloring if the induced edge coloring $c^{'} : E (G) \to {1, 2, ..., k - 1}$ defined by $c^{'} (u v) = | c (u) - c (v) |$ for each edge $u v$ of $G$ is also proper. The minimum integer $k$ for which $G$ has a graceful $k$ -coloring is the graceful chromatic number $χ_{g} (G)$ . It is known that if $T$ is a tree with maximum degree $Δ$ , then $χ_{g} (T) \leq ⌈ \frac{5}{3} Δ ⌉$ and this bound is best possible. It is shown for each integer $Δ \geq 2$ that there is an infinite class of trees $T$ with maximum degree $Δ$ such that $χ_{g} (T) = ⌈ \frac{5}{3} Δ ⌉$ . In particular, we investigate for each...

On a magnetic characterization of spectral minimal partitions

Bernard Helffer, Thomas Hoffmann-Ostenhof (2013)

Journal of the European Mathematical Society

Similarity:

Given a bounded open set $Ω$ in $ℝ^{n}$ (or in a Riemannian manifold) and a partition of $Ω$ by $k$ open sets $D_{j}$ , we consider the quantity ${𝚖𝚊𝚡}_{j} λ (D_{j})$ where $λ (D_{j})$ is the ground state energy of the Dirichlet realization of the Laplacian in $D_{j}$ . If we denote by $ℒ_{k} (Ω)$ the infimum over all the $k$ -partitions of ${𝚖𝚊𝚡}_{j} λ (D_{j})$ , a minimal $k$ -partition is then a partition which realizes the infimum. When $k = 2$ , we find the two nodal domains of a second eigenfunction, but the analysis of higher $k$ ’s is non trivial and quite interesting. In this...

Horocyclic products of trees

Laurent Bartholdi, Markus Neuhauser, Wolfgang Woess (2008)

Journal of the European Mathematical Society

Similarity:

Let $T_{1}, \dots, T_{d}$ be homogeneous trees with degrees $q_{1} + 1, \dots, q_{d} + 1 \geq 3$ , respectively. For each tree, let $𝔥 : T_{j} \to ℤ$ be the Busemann function with respect to a fixed boundary point (end). Its level sets are the horocycles. The horocyclic product of $T_{1}, \dots, T_{d}$ is the graph $𝖣𝖫 (q_{1}, \dots, q_{d})$ consisting of all $d$ -tuples $x_{1} \dots x_{d} \in T_{1} \times \dots \times T_{d}$ with $𝔥 (x_{1}) + \dots + 𝔥 (x_{d}) = 0$ , equipped with a natural neighbourhood relation. In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. If $d = 2$ and $q_{1} = q_{2} = q$ then we obtain a Cayley graph...

On γ-labelings of trees

Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang (2005)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → 0,1,2,...,m that induces a labeling f’: E(G) → 1,2,...,m of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is $v a l (f) = Σ_{e \in E (G)} f^{'} K (e)$ . The maximum value of a γ-labeling of G is defined as $v a l_{m a x} (G) = m a x v a l (f) : f i s a γ - l a b e l i n g o f G$ ; while the minimum value of a γ-labeling of G is $v a l_{m i n} (G) = m i n v a l (f) : f i s a γ - l a b e l i n g o f G$ ; The values $v a l_{m a x} (S_{p, q})$ and $v a l_{m i n} (S_{p, q})$ are determined for double stars $S_{p, q}$ . We present characterizations of connected graphs G of order n for which...

Extension of point-finite partitions of unity

Haruto Ohta, Kaori Yamazaki (2006)

Fundamenta Mathematicae

Similarity:

A subspace A of a topological space X is said to be $P^{γ}$ -embedded ( $P^{γ}$ (point-finite)-embedded) in X if every (point-finite) partition of unity α on A with |α| ≤ γ extends to a (point-finite) partition of unity on X. The main results are: (Theorem A) A subspace A of X is $P^{γ}$ (point-finite)-embedded in X iff it is $P^{γ}$ -embedded and every countable intersection B of cozero-sets in X with B ∩ A = ∅ can be separated from A by a cozero-set in X. (Theorem B) The product A × [0,1] is $P^{γ}$ (point-finite)-embedded...

Infinitesimal Morita homomorphisms and the tree-level of the LMO invariant

Gwénaël Massuyeau (2012)

Bulletin de la Société Mathématique de France

Similarity:

Let $Σ$ be a compact connected oriented surface with one boundary component, and let $π$ be the fundamental group of $Σ$ . The Johnson filtration is a decreasing sequence of subgroups of the Torelli group of $Σ$ , whose $k$ -th term consists of the self-homeomorphisms of $Σ$ that act trivially at the level of the $k$ -th nilpotent quotient of $π$ . Morita defined a homomorphism from the $k$ -th term of the Johnson filtration to the third homology group of the $k$ -th nilpotent quotient of $π$ . In this paper, we...