573 research outputs found
Circular chromatic numbers of a class of distance graphs
AbstractSuppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,sk}. The distance graph G(Z,Dm,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i−j|∈Dm,k,s. This paper determines the circular chromatic number of all the distance graphs G(Z,Dm,k,s)
Circular chromatic numbers of some distance graphs
AbstractGiven a set D of positive integers, the distance graph G(Z,D) has vertices all integers Z, and two vertices j and j′ in Z are adjacent if and only if |j-j′|∈D. This paper determines the circular chromatic numbers of some distance graphs
On the independence ratio of distance graphs
A distance graph is an undirected graph on the integers where two integers
are adjacent if their difference is in a prescribed distance set. The
independence ratio of a distance graph is the maximum density of an
independent set in . Lih, Liu, and Zhu [Star extremal circulant graphs, SIAM
J. Discrete Math. 12 (1999) 491--499] showed that the independence ratio is
equal to the inverse of the fractional chromatic number, thus relating the
concept to the well studied question of finding the chromatic number of
distance graphs.
We prove that the independence ratio of a distance graph is achieved by a
periodic set, and we present a framework for discharging arguments to
demonstrate upper bounds on the independence ratio. With these tools, we
determine the exact independence ratio for several infinite families of
distance sets of size three, determine asymptotic values for others, and
present several conjectures.Comment: 39 pages, 12 figures, 6 table
Recommended from our members
Graph colourings using structured colour sets
Available from British Library Document Supply Centre-DSC:DXN046348 / BLDSC - British Library Document Supply CentreSIGLEGBUnited Kingdo
Rhythmic maximal evenness: rhythm in voice-leading space
Maximal evenness was first introduced in the music theory domain by John Clough and Jack Douthett. Later, the concept was explored by others such as Dmitri Tymoczko and Richard Cohn. Although maximal evenness was first explored with respect to pitch-classes, the concept can be understood in the rhythmic domain. An explanation of voice-leading space can be found here to create a conceptual foundation before departing to the implications of maximal evenness on rhythm. This thesis will then explore the concept further by exploring music from Steve Reich and György Ligeti to demonstrate the applicability and deeper understanding of the concept
Recommended from our members
Combinatorics and Metric Geometry
This thesis consists of an introduction and seven chapters, each devoted to a different combinatorial problem.
In Chapters 1 and 2, we consider the main subject of this thesis; the sharp stability of the Brunn-Minkowski inequality (BM). This celebrated theorem from the 19th century asserts that for bodies A,B , we have
|A + B| |A| + |B|,
where || is the Lebesgue measure and A + B := {a + b : a A, b B} is the Minkowski sum. Moreover, we have equality if and only if A,B are homothetic convex sets. The stability question, studied in many papers, asks how the distance to equality in BM relates to the distance from A,B to homothetic convex sets. In particular, given Brunn-Minkowsi deficit
:= |A+B| / |A| + |B| -1,
and normalized volume ratio
:= |A| / |A| + |B|,
what is the best bound one can find on
:= |K \ A| / |A| + |K \ B| / |B|,
where K A, and K B are homothetic convex sets of minimal size? In Chapter 2, we prove a conjecture by Figalli and Jerison establishing the sharp stability for homothetic sets. In particular, we show that for homothetic sets, we have = O(t), for sufficiently small. In Chapter 3, we establish the sharp stability for planar sets, i.e. we show that for planar sets and sufficiently small, we have = O(t). A crucial result in Chapter 3 shows that for any > 0, if is sufficiently small, then we have
|co(A + B) \ (A + B)| (1 + )(|co(A) \ A| + |co(B) \ B|).
In Chapter 4, we consider a reconstruction problem for functions on graphs. Given a function :V(G) [k] on the vertices of a graph G and a random walk (U) on that graph, can we reconstruct (up to automorphisms) based on just ((U)? Gross and Grupel showed this was not generally possible on the hypercube, by constructing non-isomorphic sets , so that for each vertex the fraction of neighbours which is in is exactly . Answering a question of Gross and Grupel, we construct uncountably many non-isomorphic partitions of into 2k parts such that every element of has exactly one neighbour in each part. As a result, we find sets for all with {0, ... , 2n}.
In Chapter 5, we prove the complete graph case of the bunkbed conjecture. Given a graph G, let the bunkbed graph BB(G) be the graph GK, i.e. the graph obtained from considering two copies of G and connecting equivalent vertices with an edge. The bunkbed conjecture posed by Kasteleyn in 1985 asserts the very intuitive statement that when considering percolation with uniform parameter p, we have (u v) (u v), i.e. a vertex has a higher probability of being connected to a vertex in the same copy of G than being connected to the equivalent vertex in the other copy of G.
In Chapter 6, we consider the (t,r) broadcast domination number, a generalisation of the domination number in graphs. In this form of domination, we consider a set T V(G) of towers which broadcast at strength t, where broadcast strength decays linearly with distance in the graph. A set of towers is (t,r) broadcast dominating if every vertex in the graph receives at least r signal from all towers combined. More formally, the (t,r) broadcast domination number of a graph G is the minimal cardinality of a set T V(G) such that for every vertex v V(G), we have
max{t - d(u,v),0} r.
Proving a conjecture by Drews, Harris, and Randolph, we establish that the minimal asymptotical density of (t,3) broadcasting subset of is the same as the minimal asymptotical density of a (t-1,1) broadcasting subset of .
In Chapter 7, we consider the eternal game chromatic number, a version of the game chromatic number in which the game continues after all vertices have been coloured. We show that with high probability
(G) = (p/2 + o(1))n for odd n, and also for even n when p = 1/k for some k . The upper bound applies for even n and any other value of p as well, but we conjecture in this case this upper bound is not sharp. Finally, we answer a question posed by Klostermeyer and Mendoza.
In Chapter 8, we consider the bridge-burning cops and robbers game, a version of the game where after a robber moves over an edge, the edge is removed from the graph. Proving a generalization of a conjecture by Kinnersley and Peterson, we establish the asymptotically maximal capture time in this game for graphs with bridge-burning cops number at least three. In particular, we show that this maximal capture time grows as
kn, where k 3 is the bridge burning cop number and n is the number of vertices of the graph
A Derivation of the Tonal Hierarchy from Basic Perceptual Processes
In recent decades music psychologists have explained the functioning of tonal music in terms of the tonal hierarchy, a stable schema of relative structural importance that helps us interpret the events in a passage of tonal music. This idea has been most influentially disseminated by Carol Krumhansl in her 1990 monograph Cognitive Foundations of Musical Pitch. Krumhansl hypothesized that this sense of the importance or centrality of certain tones of a key is learned through exposure to tonal music, in particular by learning the relative frequency of appearance of the various pitch classes in tonal passages. The correlation of pitch-class quantity and structural status has been the subject of a number of successful studies, leading to the general acceptance of the pitch-distributional account of tonal hierarchy in the field of music psychology.
This study argues that the correlation of pitch-class quantity with structural status is a byproduct of other, more fundamental perceptual properties, all of which are derived from aspects of everyday listening. Individual chapters consider the phenomena of consonance and dissonance, intervallic rootedness, the short-term memory for pitch collection, and the interaction of temporal ordering and voice-leading that Jamshed Bharucha calls melodic anchoring. The study concludes with an elaborate self-experiment that observes the interaction of these properties in a pool of 275 stimuli, each of which is constructed from a single dyad plus one subsequent tone
- …