Sciweavers

DM
2016
44views more  DM 2016»
8 years 7 months ago
Novel structures in Stanley sequences
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper...
Richard A. Moy, David Rolnick
DM
2016
44views more  DM 2016»
8 years 7 months ago
m-ary partitions with no gaps: A characterization modulo m
Abstract. In a recent work, the authors provided the first-ever characterization of the values bm(n) modulo m where bm(n) is the number of (unrestricted) m-ary partitions of the i...
George E. Andrews, Aviezri S. Fraenkel, James A. S...
DM
2016
45views more  DM 2016»
8 years 7 months ago
Local and global colorability of graphs
It is shown that for any fixed c ≥ 3 and r, the maximum possible chromatic number of a graph on n vertices in which every subgraph of radius at most r is c colorable is ˜Θ n ...
Noga Alon, Omri Ben-Eliezer
DM
2016
42views more  DM 2016»
8 years 7 months ago
Mapping planar graphs into the Coxeter graph
We conjecture that every planar graph of odd-girth at least 11 admits a homomorphism to the Coxeter graph. Supporting this conjecture, we prove that every planar graph of odd-girt...
Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevs...
DM
2016
49views more  DM 2016»
8 years 7 months ago
Three-weight cyclic codes and their weight distributions
—Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and d...
Cunsheng Ding, Chunlei Li, Nian Li, Zhengchun Zhou
DM
2016
55views more  DM 2016»
8 years 7 months ago
Polynomial graph invariants from homomorphism numbers
We give a new method of generating strongly polynomial sequences of graphs, i.e., sequences (Hk) indexed by a tuple k = (k1, . . . , kh) of positive integers, with the property th...
Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril
DM
2016
54views more  DM 2016»
8 years 7 months ago
Intermingled ascending wave m-sets
Given a coloring of Z+ , we call a monochromatic set A = {a1 < a2 < · · · < am}
Aaron Robertson, Caitlin Cremin, Will Daniel, Quer...