scholarly journals ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F

2004 ◽  
Vol 14 (05n06) ◽  
pp. 677-702 ◽  
Author(s):  
V. S. GUBA
Keyword(s):  
Growth Rate ◽  
Lower Bound ◽  
Cayley Graph ◽  
Upper Bound ◽  
Growth Function ◽  
Vertex Degree ◽  
General Growth ◽  
Thompson’S Group ◽  
Average Vertex ◽  
Thompson's Group F

We study some properties of the Cayley graph of R. Thompson's group F in generators x0, x1. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3. It is known that a 2-generated group is not amenable if and only if the density of the corresponding Cayley graph is strictly less than 4. It is well known this is also equivalent to the existence of a doubling function on the Cayley graph. This means there exists a mapping from the set of vertices into itself such that for some constant K>0, each vertex moves by a distance at most K and each vertex has at least two preimages. We show that the density of the Cayley graph of a 2-generated group does not exceed 3 if and only if the group satisfies the above condition with K=1. Besides, we give a very easy formula to find the length (norm) of a given element of F in generators x0, x1. This simplifies the algorithm by Fordham. The length formula may be useful for finding the general growth function of F in generators x0, x1 and the growth rate of this function. In this paper, we show that the growth rate of F has a lower bound of [Formula: see text].

scholarly journals On the density of Cayley graphs of R.Thompson’s group F in symmetric generators

2021 ◽  
pp. 1-13
Author(s):  
V. S. Guba
Keyword(s):  
Cayley Graph ◽  
Cayley Graphs ◽  
Finite Graph ◽  
Vertex Degree ◽  
Doubling Property ◽  
Generating Set ◽  
Finite Set ◽  
Standard Set ◽  
Thompson’S Group ◽  
Average Vertex

By the density of a finite graph we mean its average vertex degree. For an [Formula: see text]-generated group, the density of its Cayley graph in a given set of generators, is the supremum of densities taken over all its finite subgraphs. It is known that a group with [Formula: see text] generators is amenable if and only if the density of the corresponding Cayley graph equals [Formula: see text]. A famous problem on the amenability of R. Thompson’s group [Formula: see text] is still open. Due to the result of Belk and Brown, it is known that the density of its Cayley graph in the standard set of group generators [Formula: see text], is at least [Formula: see text]. This estimate has not been exceeded so far. For the set of symmetric generators [Formula: see text], where [Formula: see text], the same example only gave an estimate of [Formula: see text]. There was a conjecture that for this generating set equality holds. If so, [Formula: see text] would be non-amenable, and the symmetric generating set would have the doubling property. This would mean that for any finite set [Formula: see text], the inequality [Formula: see text] holds. In this paper, we disprove this conjecture showing that the density of the Cayley graph of [Formula: see text] in symmetric generators [Formula: see text] strictly exceeds [Formula: see text]. Moreover, we show that even larger generating set [Formula: see text] does not have doubling property.

Extremal multiplicative Zagreb indices among trees with given distance k-domination number

2020 ◽  
pp. 2150087
Author(s):  
Fazal Hayat
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Domination Number ◽  
Vertex Degree ◽  
Index Formula ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Sharp Lower Bound ◽  
Distance Formula

The first multiplicative Zagreb index [Formula: see text] of a graph [Formula: see text] is the product of the square of every vertex degree, while the second multiplicative Zagreb index [Formula: see text] is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for [Formula: see text] and upper bound for [Formula: see text] of trees with given distance [Formula: see text]-domination number, and characterize those trees attaining the bounds.

scholarly journals Growth of positive words and lower bounds of the growth rate for Thompson’s groups F(p)

2017 ◽  
Vol 27 (01) ◽  
pp. 1-21
Author(s):  
José Burillo ◽  
Victor Guba
Keyword(s):  
Growth Rate ◽  
Lower Bound ◽  
Lower Bounds ◽  
Normal Forms ◽  
New Normal ◽  
Thompson's Groups ◽  
The Family ◽  
Thompson’S Group

Let [Formula: see text], [Formula: see text] be the family of generalized Thompson’s groups. Here, [Formula: see text] is the famous Richard Thompson’s group usually denoted by [Formula: see text]. We find the growth rate of the monoid of positive words in [Formula: see text] and show that it does not exceed [Formula: see text]. Also, we describe new normal forms for elements of [Formula: see text] and, using these forms, we find a lower bound for the growth rate of [Formula: see text] in its natural generators. This lower bound asymptotically equals [Formula: see text] for large values of [Formula: see text].

scholarly journals The Dehn function and a regular set of normal forms for R. Thompson's group F

1997 ◽  
Vol 62 (3) ◽  
pp. 315-328 ◽  
Author(s):  
V. S. Guba ◽  
M. V. Sapir
Keyword(s):  
Upper Bound ◽  
Normal Forms ◽  
Dehn Function ◽  
Thompson’S Group ◽  
Thompson's Group F

AbstractWe show that the group F discovered by Richard Thompson in 1965 has a subexponential upper bound for its Dehn function. This disproves a conjecture by Gersten. We also prove that F has a regular terminating confluent presentation.

scholarly journals FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F

2005 ◽  
Vol 15 (05n06) ◽  
pp. 815-850 ◽  
Author(s):  
JAMES M. BELK ◽  
KENNETH S. BROWN
Keyword(s):  
Cayley Graph ◽  
Real Line ◽  
Unit Interval ◽  
Minimum Length ◽  
Generating Set ◽  
The Real ◽  
Positive Elements ◽  
Thompson’S Group ◽  
Standard Action ◽  
Thompson's Group F

We introduce forest diagrams to represent elements of Thompson's group F. These diagrams relate to a certain action of F on the real line in the same way that tree diagrams relate to the standard action of F on the unit interval. Using forest diagrams, we give a conceptually simple length formula for elements of F with respect to the {x0,x1} generating set, and we discuss the construction of minimum-length words for positive elements. Finally, we use forest diagrams and the length formula to examine the structure of the Cayley graph of F.

scholarly journals A new upper bound for the largest growth rate of linear Rayleigh–Taylor instability

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Changsheng Dou ◽  
Jialiang Wang ◽  
Weiwei Wang
Keyword(s):  
Surface Tension ◽  
Growth Rate ◽  
Upper Bound ◽  
Viscous Fluids ◽  
Instability Condition ◽  
Interface Surface ◽  
Incompressible Viscous Fluids ◽  
Rayleigh Taylor Instability ◽  
Surface Tensor ◽  
Rt Instability

AbstractWe investigate the effect of (interface) surface tensor on the linear Rayleigh–Taylor (RT) instability in stratified incompressible viscous fluids. The existence of linear RT instability solutions with largest growth rate Λ is proved under the instability condition (i.e., the surface tension coefficient ϑ is less than a threshold $\vartheta _{\mathrm{c}}$ ϑ c ) by the modified variational method of PDEs. Moreover, we find a new upper bound for Λ. In particular, we directly observe from the upper bound that Λ decreasingly converges to zero as ϑ goes from zero to the threshold $\vartheta _{\mathrm{c}}$ ϑ c .

scholarly journals Multiple closed orbits for N-body-type problems

1998 ◽  
Vol 58 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Shiqing Zhang
Keyword(s):  
Lower Bound ◽  
Periodic Solutions ◽  
Upper Bound ◽  
Critical Value ◽  
Body Type ◽  
Fixed Energy ◽  
Closed Orbits

Using the equivariant Ljusternik-Schnirelmann theory and the estimate of the upper bound of the critical value and lower bound for the collision solutions, we obtain some new results in the large concerning multiple geometrically distinct periodic solutions of fixed energy for a class of planar N-body type problems.

Limit Cycle Bifurcations for Piecewise Smooth Hamiltonian Systems with a Generalized Eye-Figure Loop

2016 ◽  
Vol 26 (12) ◽  
pp. 1650204 ◽  
Author(s):  
Jihua Yang ◽  
Liqin Zhao
Keyword(s):  
Lower Bound ◽  
Limit Cycle ◽  
Hamiltonian Systems ◽  
Limit Cycles ◽  
Upper Bound ◽  
Melnikov Function ◽  
Piecewise Smooth ◽  
First Order ◽  
Period Annulus

This paper deals with the limit cycle bifurcations for piecewise smooth Hamiltonian systems. By using the first order Melnikov function of piecewise near-Hamiltonian systems given in [Liu & Han, 2010], we give a lower bound and an upper bound of the number of limit cycles that bifurcate from the period annulus between the center and the generalized eye-figure loop up to the first order of Melnikov function.

Isolated minima of the product of n linear forms

1953 ◽  
Vol 49 (1) ◽  
pp. 59-62 ◽  
Author(s):  
E. S. Barnes
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Linear Forms ◽  
Image Position

Letbe n linear forms with real coefficients and determinant Δ = ∥ aij∥ ≠ 0; and denote by M(X) the lower bound of | X1X2 … Xn| over all integer sets (u) ≠ (0). It is well known that γn, the upper bound of M(X)/|Δ| over all sets of forms Xi, is finite, and the value of γn has been determined when n = 2 and n = 3.

scholarly journals The Algebraic Degree of Phase-Type Distributions

2010 ◽  
Vol 47 (03) ◽  
pp. 611-629
Author(s):  
Mark Fackrell ◽  
Qi-Ming He ◽  
Peter Taylor ◽  
Hanqin Zhang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Polynomial Algorithm ◽  
Algebraic Degree ◽  
Nonnegative Matrices ◽  
Stieltjes Transform ◽  
Special Cases ◽  
Phase Type ◽  
Phase Type Distributions ◽  
The Matrix

This paper is concerned with properties of the algebraic degree of the Laplace-Stieltjes transform of phase-type (PH) distributions. The main problem of interest is: given a PH generator, how do we find the maximum and the minimum algebraic degrees of all irreducible PH representations with that PH generator? Based on the matrix exponential (ME) order of ME distributions and the spectral polynomial algorithm, a method for computing the algebraic degree of a PH distribution is developed. The maximum algebraic degree is identified explicitly. Using Perron-Frobenius theory of nonnegative matrices, a lower bound and an upper bound on the minimum algebraic degree are found, subject to some conditions. Explicit results are obtained for special cases.

Sign in / Sign up

Export Citation Format

Share Document