Generally a ruler is marked in equal increments, e.g., a 12 inch ruler has 12 markings,\ud each 1 inch apart. In this paper we discuss a special type of ruler discovered by\ud Soloman W. Golomb. We define a Golomb ruler to be a ruler of length d with n\ud markings where the distance between any two markings is unique. This concept is\ud useful in the field of electrical engineering.\ud We use the fact that a Golomb ruler can be represented as a lattice point in Rm,\ud where the A;-th coordinate represent the k-th measure, to study it from a geometric\ud point of view. It turns out that if we relax the definition of a Golomb ruler to allow\ud real number markings then the set of all Golomb ruler of m measure and length d is\ud a polytope in ...
This thesis studies two combinatorial objects arising from applications in digital information proce...
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regul...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
AbstractA Golomb Ruler is a ruler with integer marks where the distances between every two marks are...
Golomb rulers are special rulers where for any two marks it holds that the distance between them is ...
A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances o...
The Golomb Ruler Problem asks to position n integer marks on a ruler such that all pairwise distance...
The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a rule...
AbstractThe Golomb Ruler problem consists in finding n integers such that all possible differences a...
The Golomb Ruler problem consists in finding n integers such that all possible differences are disti...
A set of positive integers $A$ is called a Golomb ruler if the difference between two distinct ele...
A shape can be defined as the representation of an object or its external boundary so as to characte...
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In seve...
AbstractThe old problem of counting lattice points in euclidean spheres leads to use Jacobi theta fu...
We study the polytopes that arise from the convex hulls of stack-sorting on particular permutations....
This thesis studies two combinatorial objects arising from applications in digital information proce...
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regul...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
AbstractA Golomb Ruler is a ruler with integer marks where the distances between every two marks are...
Golomb rulers are special rulers where for any two marks it holds that the distance between them is ...
A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances o...
The Golomb Ruler Problem asks to position n integer marks on a ruler such that all pairwise distance...
The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a rule...
AbstractThe Golomb Ruler problem consists in finding n integers such that all possible differences a...
The Golomb Ruler problem consists in finding n integers such that all possible differences are disti...
A set of positive integers $A$ is called a Golomb ruler if the difference between two distinct ele...
A shape can be defined as the representation of an object or its external boundary so as to characte...
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In seve...
AbstractThe old problem of counting lattice points in euclidean spheres leads to use Jacobi theta fu...
We study the polytopes that arise from the convex hulls of stack-sorting on particular permutations....
This thesis studies two combinatorial objects arising from applications in digital information proce...
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regul...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...