24 search results - page 1 / 5 » On sets of integers whose shifted products are powers |
49
Voted
JCT
2008
15 years 12 days ago
2008
115
click to vote
IPL
2011
14 years 7 months ago
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
102
click to vote
EJC
2008
15 years 15 days ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
82
Voted
WCC
2005
Springer
15 years 6 months ago
2005
Springer
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
90
Voted
MP
2010
14 years 7 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...