In this paper, we will use generating functions as a tool to examine\ud three related problems, which can all be expressed in terms of finding natural number solutions to a system of linear equations. We will consider the enumeration of integer lattice points in a polyhedral cone, the\ud enumeration of magic squares, and the enumeration of magic labellings of a pseudograph. Although we will discuss these topics each separately, the work throughout the paper will demonstrate how these seemingly disparate topics are related
We study the number of integer points (”lattice points”) in rational polytopes. We use an associated...
Many compiler techniques depend on the ability to count the number of integer points that satisfy a ...
AMS Subject Classication: 05E Abstract. In this article, we construct and enumerate the magic labeli...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we ...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
AbstractWe present a common generalization of counting lattice points in rational polytopes and the ...
A magic labelling of a set system is a labelling of its points by distinct positive\ud integers so t...
We prove that for any fixed d the generating function of the projection of the set of integer point...
AMS Subject Classication: 05A15, 05B15 Abstract. We enumerate the solutions of a system of a simple ...
Integer optimization is a powerful modeling tool both for problems of practical and more abstract or...
In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhed...
We study the number of integer points (”lattice points”) in rational polytopes. We use an associated...
Many compiler techniques depend on the ability to count the number of integer points that satisfy a ...
AMS Subject Classication: 05E Abstract. In this article, we construct and enumerate the magic labeli...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we ...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
AbstractWe present a common generalization of counting lattice points in rational polytopes and the ...
A magic labelling of a set system is a labelling of its points by distinct positive\ud integers so t...
We prove that for any fixed d the generating function of the projection of the set of integer point...
AMS Subject Classication: 05A15, 05B15 Abstract. We enumerate the solutions of a system of a simple ...
Integer optimization is a powerful modeling tool both for problems of practical and more abstract or...
In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhed...
We study the number of integer points (”lattice points”) in rational polytopes. We use an associated...
Many compiler techniques depend on the ability to count the number of integer points that satisfy a ...
AMS Subject Classication: 05E Abstract. In this article, we construct and enumerate the magic labeli...