A Cayley graph for F2 × F2 which is not minimally almost convex

2021 ◽  
pp. 1-12
Author(s):  
Andrew Elvey Price
Keyword(s):  
Cayley Graph ◽  
The Other ◽  
Fellow Traveler ◽  
Generating Set ◽  
Other Hand ◽  
Almost Convex ◽  
Graph Property ◽  
Almost Convexity

We give an example of a Cayley graph [Formula: see text] for the group [Formula: see text] which is not minimally almost convex (MAC). On the other hand, the standard Cayley graph for [Formula: see text] does satisfy the falsification by fellow traveler property (FFTP), which is strictly stronger. As a result, any Cayley graph property [Formula: see text] lying between FFTP and MAC (i.e., [Formula: see text]) is dependent on the generating set. This includes the well-known properties FFTP and almost convexity, which were already known to depend on the generating set as well as Poénaru’s condition [Formula: see text] and the basepoint loop shortening property (LSP) for which dependence on the generating set was previously unknown. We also show that the Cayley graph [Formula: see text] does not have the LSP, so this property also depends on the generating set.

scholarly journals Cayley Graphs Without a Bounded Eigenbasis

2020 ◽  
Author(s):  
Ashwin Sah ◽  
Mehtaab Sawhney ◽  
Yufei Zhao
Keyword(s):  
Cayley Graph ◽  
Orthonormal Basis ◽  
Cayley Graphs ◽  
The Other ◽  
Transitive Graph ◽  
Classic Result ◽  
Other Hand ◽  
Small Set ◽  
Vertex Transitive ◽  
Vertex Transitive Graph

Abstract Does every $n$-vertex Cayley graph have an orthonormal eigenbasis all of whose coordinates are $O(1/\sqrt{n})$? While the answer is yes for abelian groups, we show that it is no in general. On the other hand, we show that every $n$-vertex Cayley graph (and more generally, vertex-transitive graph) has an orthonormal basis whose coordinates are all $O(\sqrt{\log n / n})$, and that this bound is nearly best possible. Our investigation is motivated by a question of Assaf Naor, who proved that random abelian Cayley graphs are small-set expanders, extending a classic result of Alon–Roichman. His proof relies on the existence of a bounded eigenbasis for abelian Cayley graphs, which we now know cannot hold for general groups. On the other hand, we navigate around this obstruction and extend Naor’s result to nonabelian groups.

scholarly journals Approximating Cayley Diagrams Versus Cayley Graphs

2012 ◽  
Vol 21 (4) ◽  
pp. 635-641
Author(s):  
ÁDÁM TIMÁR
Keyword(s):  
Cayley Graph ◽  
Hamiltonian Cycle ◽  
Cayley Graphs ◽  
The Other ◽  
Finite Graphs ◽  
Similar Construction ◽  
Graph Property

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by any subgraph of the other. We give an example where this holds, but convergence is meant in a stronger sense. This is related to whether having a Hamiltonian cycle is a testable graph property.

scholarly journals Rational Growth and Almost Convexity of Higher-Dimensional Torus Bundles

2017 ◽  
Vol 2019 (13) ◽  
pp. 4004-4046
Author(s):  
Corey Bregman
Keyword(s):  
Unit Circle ◽  
Dimensional Torus ◽  
Torus Bundle ◽  
Generating Set ◽  
Growth Series ◽  
Torus Bundles ◽  
Almost Convex ◽  
Higher Dimensional ◽  
Finite Index Subgroup ◽  
Almost Convexity

AbstractGiven a matrix $A\in SL(N,\mathbb{Z})$, form the semidirect product $G=\mathbb{Z}^N\rtimes_A \mathbb{Z}$ where the $\mathbb{Z}$-factor acts on $\mathbb{Z}^N$ by $A$. Such a $G$ arises naturally as the fundamental group of an $N$-dimensional torus bundle which fibers over the circle. In this article, we prove that if $A$ has distinct eigenvalues not lying on the unit circle, then there exists a finite index subgroup $H\leq G$ possessing rational growth series for some generating set. In contrast, we show that if $A$ has at least one eigenvalue not lying on the unit circle, then $G$ is not almost convex for any generating set.

scholarly journals Easily Testable Graph Properties

2015 ◽  
Vol 24 (4) ◽  
pp. 646-657 ◽  
Author(s):  
NOGA ALON ◽  
JACOB FOX
Keyword(s):  
The Other ◽  
Induced Subgraph ◽  
Random Subset ◽  
Other Hand ◽  
Graph Properties ◽  
Graph Property

A graph on n vertices is ε-far from a property $\mathcal{P}$ if one has to add or delete from it at least εn2 edges to get a graph satisfying $\mathcal{P}$. A graph property $\mathcal{P}$ is strongly testable if for every fixed ε > 0 it is possible to distinguish, with one-sided error, between graphs satisfying $\mathcal{P}$ and ones that are ε-far from $\mathcal{P}$ by inspecting the induced subgraph on a random subset of at most f(ε) vertices. A property is easily testable if it is strongly testable and the function f is polynomial in 1/ε, otherwise it is hard. We consider the problem of characterizing the easily testable graph properties, which is wide open, and obtain several results in its study. One of our main results shows that testing perfectness is hard. The proof shows that testing perfectness is at least as hard as testing triangle-freeness, which is hard. On the other hand, we show that being a cograph, or equivalently, induced P3-freeness where P3 is a path with 3 edges, is easily testable. This settles one of the two exceptional graphs, the other being C4 (and its complement), left open in the characterization by the first author and Shapira of graphs H for which induced H-freeness is easily testable. Our techniques yield a few additional related results, but the problem of characterizing all easily testable graph properties, or even that of formulating a plausible conjectured characterization, remains open.

Quasi-automatic semigroups

2020 ◽  
pp. 2150046
Author(s):  
Yanhui Wang ◽  
Yuhan Wang ◽  
Xueming Ren ◽  
Kar Ping Shum
Keyword(s):  
Cayley Graph ◽  
Identity Element ◽  
Zero Element ◽  
The Other ◽  
Finitely Generated ◽  
Converse Statement ◽  
Free Products ◽  
Generating Set ◽  
Automatic Semigroup ◽  
Automatic Group

Quasi-automatic semigroups are extensions of a Cayley graph of an automatic group. Of course, a quasi-automatic semigroup generalizes an automatic semigroup. We observe that a semigroup [Formula: see text] may be automatic only when [Formula: see text] is finitely generated, while a semigroup may be quasi-automatic but it is not necessary finitely generated. Similar to the usual automatic semigroups, a quasi-automatic semigroup is closed under direct and free products. Furthermore, a semigroup [Formula: see text] is graph automatic if and only if [Formula: see text] with a zero element adjoined is graph automatic, and also a semigroup [Formula: see text] is graph automatic if and only if [Formula: see text] with an identity element adjoined is graph automatic. However, the class of quasi-automatic semigroups is a much wider class than the class of automatic semigroups. In this paper, we show that every automatic semigroup is quasi-automatic but the converse statement is not true (see Example 3.6). In addition, we notice that the quasi-automatic semigroups are invariant under the changing of generators, while a semigroup may be automatic with respect to a finite generating set but not the other. Finally, the connection between the quasi-automaticity of two semigroups [Formula: see text] and [Formula: see text], where [Formula: see text] is a subsemigroup with finite Rees index in [Formula: see text] will be investigated and considered.

scholarly journals A Bijection between Atomic Partitions and Unsplitable Partitions

10.37236/494 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
William Y. C. Chen ◽  
Teresa X. S. Li ◽  
David G. L. Wang
Keyword(s):  
Symmetric Functions ◽  
The Other ◽  
Generating Set ◽  
Power Sum ◽  
Other Hand

In the study of the algebra $\mathrm{NCSym}$ of symmetric functions in noncommutative variables, Bergeron and Zabrocki found a free generating set consisting of power sum symmetric functions indexed by atomic partitions. On the other hand, Bergeron, Reutenauer, Rosas, and Zabrocki studied another free generating set of $\mathrm{NCSym}$ consisting of monomial symmetric functions indexed by unsplitable partitions. Can and Sagan raised the question of finding a bijection between atomic partitions and unsplitable partitions. In this paper, we provide such a bijection.

A study of cometary eruptions through OH radio-lines

1999 ◽  
Vol 173 ◽  
pp. 249-254
Author(s):  
A.M. Silva ◽  
R.D. Miró
Keyword(s):  
Short Duration ◽  
Growth Curves ◽  
The Other ◽  
Initial Mass ◽  
Radio Lines ◽  
Other Hand ◽  
Sudden Rise

AbstractWe have developed a model for theH2OandOHevolution in a comet outburst, assuming that together with the gas, a distribution of icy grains is ejected. With an initial mass of icy grains of 108kg released, theH2OandOHproductions are increased up to a factor two, and the growth curves change drastically in the first two days. The model is applied to eruptions detected in theOHradio monitorings and fits well with the slow variations in the flux. On the other hand, several events of short duration appear, consisting of a sudden rise ofOHflux, followed by a sudden decay on the second day. These apparent short bursts are frequently found as precursors of a more durable eruption. We suggest that both of them are part of a unique eruption, and that the sudden decay is due to collisions that de-excite theOHmaser, when it reaches the Cometopause region located at 1.35 × 105kmfrom the nucleus.

Closing the GAP—A 5Å Scanning Microscope

1969 ◽  
Vol 27 ◽  
pp. 6-7
Author(s):  
A. V. Crewe
Keyword(s):  
Normal Form ◽  
The Other ◽  
Resolving Power ◽  
Scanning Microscope ◽  
Conventional Microscope ◽  
Other Hand ◽  
Closing The Gap ◽  
Thermal Sources ◽  
Better Than ◽  
Transmission Microscope

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.

Life Beyond 1MeV

1980 ◽  
Vol 38 ◽  
pp. 30-33
Author(s):  
K.H. Westmacott
Keyword(s):  
Electron Microscopy ◽  
Past Experience ◽  
The Other ◽  
Good Case ◽  
Other Hand ◽  
The U.S

Life beyond 1MeV – like life after 40 – is not too different unless one takes advantage of past experience and is receptive to new opportunities. At first glance, the returns on performing electron microscopy at voltages greater than 1MeV diminish rather rapidly as the curves which describe the well-known advantages of HVEM often tend towards saturation. However, in a country with a significant HVEM capability, a good case can be made for investing in instruments with a range of maximum accelerating voltages. In this regard, the 1.5MeV KRATOS HVEM being installed in Berkeley will complement the other 650KeV, 1MeV, and 1.2MeV instruments currently operating in the U.S. One other consideration suggests that 1.5MeV is an optimum voltage machine – Its additional advantages may be purchased for not much more than a 1MeV instrument. On the other hand, the 3MeV HVEM's which seem to be operated at 2MeV maximum, are much more expensive.

Can the Academic Self-Concept be Positive and Realistic?

2005 ◽  
Vol 19 (3) ◽  
pp. 129-132 ◽  
Author(s):  
Reimer Kornmann
Keyword(s):  
Academic Performance ◽  
Opposite Effect ◽  
Self Esteem ◽  
Point Of View ◽  
The Other ◽  
Self Concept ◽  
High Ability ◽  
Self Image ◽  
Other Hand

Summary: My comment is basically restricted to the situation in which less-able students find themselves and refers only to literature in German. From this point of view I am basically able to confirm Marsh's results. It must, however, be said that with less-able pupils the opposite effect can be found: Levels of self-esteem in these pupils are raised, at least temporarily, by separate instruction, academic performance however drops; combined instruction, on the other hand, leads to improved academic performance, while levels of self-esteem drop. Apparently, the positive self-image of less-able pupils who receive separate instruction does not bring about the potential enhancement of academic performance one might expect from high-ability pupils receiving separate instruction. To resolve the dilemma, it is proposed that individual progress in learning be accentuated, and that comparisons with others be dispensed with. This fosters a self-image that can in equal measure be realistic and optimistic.

Sign in / Sign up

Export Citation Format

Share Document