We establish an inequality which involves a non-negative function defined on the vertices of a finite m-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree summed over automorphisms of the tree, to a product of sums of powers of the function over vertices at certain levels of the tree. Conjugate powers arise naturally in the inequality, indeed, Hölder's inequality is a key tool in the proof which uses induction on subgroups of the automorphism group of the tree.PostprintPeer reviewe
AbstractIn this paper, we first give a brief survey on the power domination of the Cartesian product...
Abstract—Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for ...
A graph G on n vertices is a k-leaf power (G ∈ Gk) if it is isomorphic to a graph that can be “gener...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We show that the combination of doubling and (1, p)-Poincaré inequality is equivalent to a version o...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
AbstractLet d¯k denote the normalized hook immanant corresponding to the partition (k, ln-k) of n. P...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
Let T be a tree on n vertices with Laplacian matrix L and q-Laplacian L-q. Let X-k be the character ...
In this paper, we first give a brief survey on the power domination of the Cartesian product of grap...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
Tyt. z nagłówka.Bibliogr. s. 699-700.Let Tk be the homogeneous tree of degree k ≥ 3. J. M. Cohen and...
AbstractIn this paper, we first give a brief survey on the power domination of the Cartesian product...
Abstract—Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for ...
A graph G on n vertices is a k-leaf power (G ∈ Gk) if it is isomorphic to a graph that can be “gener...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We establish an inequality which involves a non-negative function defined on the vertices of a finit...
We show that the combination of doubling and (1, p)-Poincaré inequality is equivalent to a version o...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
AbstractLet d¯k denote the normalized hook immanant corresponding to the partition (k, ln-k) of n. P...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
Let T be a tree on n vertices with Laplacian matrix L and q-Laplacian L-q. Let X-k be the character ...
In this paper, we first give a brief survey on the power domination of the Cartesian product of grap...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
Tyt. z nagłówka.Bibliogr. s. 699-700.Let Tk be the homogeneous tree of degree k ≥ 3. J. M. Cohen and...
AbstractIn this paper, we first give a brief survey on the power domination of the Cartesian product...
Abstract—Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for ...
A graph G on n vertices is a k-leaf power (G ∈ Gk) if it is isomorphic to a graph that can be “gener...