To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We associate with an n-vertex graph a uniquely determined star basis of ℝn which is canonical in the sense that two cospectral graphs are isomorphic if and only if they determine the same canonical star basis. Such a basis was introduced in [CvRSl] as a means of investigating the complexity of the graph isomorphism problem. Here we first present a polynomial algorithm [CvRS2] for constructing a star partition of G, and hence a corresponding star basis of ℝn. Thereafter we describe a procedure, based on [CvRS2] and [Cve21], for constructing the canonical star basis, with emphasis on three special cases: graphs with distinct eigenvalues, graphs with bounded eigenvalue multiplicities, and strongly regular graphs. The approach provides an alternative proof of a result of Babai et al. [BaGM] that isomorphism testing for graphs with bounded eigenvalue multiplicities can be performed in polynomial time.
Since the material presented in this chapter is the subject of current research, changes and improvements to the procedure for constructing a canonical basis may well emerge in due course. The chapter is included nevertheless because it represents the original motivation for some of the work discussed earlier in the book.
Introduction
There are only finitely many star bases associated with a given graph G; for there are only finitely many star partitions of V(G), and if |V(G)| = n then each star partition determines n! star bases of ℝn (one for each labelling of the vertices).
In this chapter we consider two important concepts: star bases and their combinatorial counterpart star partitions. These concepts were introduced recently in [CvRSl] as a means of extending spectral methods in graph theory, and they provide a strong link between graphs and linear algebra. This connection is promising in that it not only reflects the geometry of eigenspaces but also extends to combinatorial aspects such as matching theory. Star bases were originally introduced as a means of investigating the complexity of the graph isomorphism problem (Chapter 8), but it turned out that the direct relation between graph structure and the underlying star partitions could be exploited to advantage. In particular, there are connections with dominating sets and implications for cubic graphs, and these are two of the topics discussed here.
Introduction
A graph is determined by its eigenvalues and eigenspaces, but not in general by its eigenvalues and angles. In seeking further algebraic invariants we may look to bases of eigenspaces, but of course for eigenspaces of dimension greater than 1 there is not a natural choice of basis. We can however focus our attention on star bases, which as we shall see are related to the geometry of finite-dimensional Euclidean spaces. The key notion which underlines star bases, and which is of wider interest as well, is that of a star partition. In this section we introduce both star partitions and star bases, and prove that they exist for any graph (indeed, for any real symmetric matrix).
Sharp extensions of some classical polynomial inequalities of Bernstein are established for rational function spaces on the unit circle, on K = r (mod 2 π), on [-1, 1 ] and on ℝ. The key result is the establishment of the inequality
for every rational function f=pn/qn, where pn is a polynomial of degree at most n with complex coefficients and
with | aj | ≠ 1 for each j and for every zo∈ δ D, where δ D,= {z∈ ℂ: |z| = l}. The above inequality is sharp at every z0∈δD.
This paper is a contribution to the general problem of differentiability of Lipschitz functions between Banach spaces. We establish here a result concerning the existence of derivatives which are in some sense between the notions of Gâteaux and Frechet differentiability.
On Waring's problem for cubes, it is conjectured that every sufficiently large natural number can be represented as a sum of four cubes of natural numbers. Denoting by E(N) the number of the natural numbers up to N that cannot be written as a sum of four cubes, we may express the conjecture as E(N)≪1.
where ℱ is a certain complex-valued function of the given real periodic function λ, is studied analytically and numerically. The equation is motivated physically by a boundary-layer stability problem in which λ represents the skin-friction of the undisturbed basic flow profile. It is proved that no periodic neutral solutions exist for any attached basic flow and the implications of this result for certain vortex-wave interactions are discussed.
In [3] the authors introduced the notion of a completely 0-simple semigroup of quotients. This definition has since been extended to the class of all semigroups giving a definition of semigroups of quotients which may be regarded as an analogue of the classical ring of quotients. When Q is a semigroup of quotients of a semigroup S, we also say that S is an order in Q.
The prototype of isoperimetric problems is to minimize the surface area of a convex body with given volume. The minimal body is naturally the suitable ball. The solution to this problem in the planar case was already known to the ancient Greeks. In the higher dimensional cases, the first proofs were provided with the help of Steiner's symmetrization method towards the end of the last century. Important later contributors are, among others, Minkowski, Blaschke, Hadwiger. By their work, the optimality of the ball has been also verified for a much wider class of sets (see [14]).
We recall that if S is a d - simplex then each facet and each vertex figure of S is a (d − 1)-simplex and S is a self-dual. We introduce a d-polytope P, called a d-multiplex, with the property that each facet and each vertex figure of P is a (d − 1)-multiplex and P is self-dual.