DM
2016
10 years 3 days ago
2016
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...
DM
2016
10 years 3 days ago
2016
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 ...
DM
2016
10 years 3 days ago
2016
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...
DM
2016
10 years 3 days ago
2016
—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...
DM
2016
10 years 3 days ago
2016
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...
DM
2016
10 years 3 days ago
2016
Given a coloring of Z+ , we call a monochromatic set A = {a1 < a2 < · · · < am}
117
click to vote
DCG
2016
10 years 3 days ago
2016
We present a polynomial partitioning theorem for finite sets of points in the real locus of a complex algebraic variety of codimension at most two. This result generalizes the pol...
136
click to vote
DCG
2016
10 years 3 days ago
2016
The main result in the paper is a construction of a simple (in fact, just a union of two squares) set T in the plane with the following property. For every > 0 there if a famil...