Enumeration of Golomb rulers and acyclic orientations of mixed graphs (Q456386): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and \(B_2\) sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of markings). Our goal is to enumerate Golomb rulers in a systematic way: we study \[ g_m(t) := \# \left\{ {\mathbf x} \in {\mathbb Z}^{m+1} : \, 0 = x_0 < x_1 < \dots < x_m = t , \text{ all } x_j - x_k \text{ distinct} \right\}, \] the number of Golomb rulers with \(m+1\) markings and length \(t\).Our main result is that \(g_m(t)\) is a quasipolynomial in \(t\) which satisfies a combinatorial reciprocity theorem: \((-1)^{m-1} g_m(-t)\) equals the number of rulers \({\mathbf x}\) of length \(t\) with \(m+1\) markings, each counted with its Golomb multiplicity, which measures how many combinatorially different Golomb rulers are in a small neighborhood of \({\mathbf x}\). Our reciprocity theorem can be interpreted in terms of certain mixed graphs associated to Golomb rulers; in this language, it is reminiscent of Stanley's reciprocity theorem for chromatic polynomials. Thus in the second part of the paper we develop an analogue of Stanley's theorem to mixed graphs, which connects their chromatic polynomials to acyclic orientations. | |||
Property / review text: Summary: A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and \(B_2\) sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of markings). Our goal is to enumerate Golomb rulers in a systematic way: we study \[ g_m(t) := \# \left\{ {\mathbf x} \in {\mathbb Z}^{m+1} : \, 0 = x_0 < x_1 < \dots < x_m = t , \text{ all } x_j - x_k \text{ distinct} \right\}, \] the number of Golomb rulers with \(m+1\) markings and length \(t\).Our main result is that \(g_m(t)\) is a quasipolynomial in \(t\) which satisfies a combinatorial reciprocity theorem: \((-1)^{m-1} g_m(-t)\) equals the number of rulers \({\mathbf x}\) of length \(t\) with \(m+1\) markings, each counted with its Golomb multiplicity, which measures how many combinatorially different Golomb rulers are in a small neighborhood of \({\mathbf x}\). Our reciprocity theorem can be interpreted in terms of certain mixed graphs associated to Golomb rulers; in this language, it is reminiscent of Stanley's reciprocity theorem for chromatic polynomials. Thus in the second part of the paper we develop an analogue of Stanley's theorem to mixed graphs, which connects their chromatic polynomials to acyclic orientations. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11P21 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6098384 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Golomb ruler | |||
Property / zbMATH Keywords: Golomb ruler / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Sidon set | |||
Property / zbMATH Keywords: Sidon set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial reciprocity theorem | |||
Property / zbMATH Keywords: combinatorial reciprocity theorem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
lattice point | |||
Property / zbMATH Keywords: lattice point / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inside-out polytope | |||
Property / zbMATH Keywords: inside-out polytope / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Ehrhart quasipolynomial | |||
Property / zbMATH Keywords: Ehrhart quasipolynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
mixed graph | |||
Property / zbMATH Keywords: mixed graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
proper coloring | |||
Property / zbMATH Keywords: proper coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
acyclic orientation | |||
Property / zbMATH Keywords: acyclic orientation / rank | |||
Normal rank |
Revision as of 12:43, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumeration of Golomb rulers and acyclic orientations of mixed graphs |
scientific article |
Statements
Enumeration of Golomb rulers and acyclic orientations of mixed graphs (English)
0 references
24 October 2012
0 references
Summary: A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and \(B_2\) sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of markings). Our goal is to enumerate Golomb rulers in a systematic way: we study \[ g_m(t) := \# \left\{ {\mathbf x} \in {\mathbb Z}^{m+1} : \, 0 = x_0 < x_1 < \dots < x_m = t , \text{ all } x_j - x_k \text{ distinct} \right\}, \] the number of Golomb rulers with \(m+1\) markings and length \(t\).Our main result is that \(g_m(t)\) is a quasipolynomial in \(t\) which satisfies a combinatorial reciprocity theorem: \((-1)^{m-1} g_m(-t)\) equals the number of rulers \({\mathbf x}\) of length \(t\) with \(m+1\) markings, each counted with its Golomb multiplicity, which measures how many combinatorially different Golomb rulers are in a small neighborhood of \({\mathbf x}\). Our reciprocity theorem can be interpreted in terms of certain mixed graphs associated to Golomb rulers; in this language, it is reminiscent of Stanley's reciprocity theorem for chromatic polynomials. Thus in the second part of the paper we develop an analogue of Stanley's theorem to mixed graphs, which connects their chromatic polynomials to acyclic orientations.
0 references
Golomb ruler
0 references
Sidon set
0 references
combinatorial reciprocity theorem
0 references
lattice point
0 references
inside-out polytope
0 references
Ehrhart quasipolynomial
0 references
mixed graph
0 references
proper coloring
0 references
acyclic orientation
0 references