Sciweavers

24 search results - page 1 / 5
» On sets of integers whose shifted products are powers
Sort
View
IPL
2011
96views more  IPL 2011»
13 years 1 months ago
Restricted compositions and permutations: From old to new Gray codes
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...
Vincent Vajnovszki, Rémi Vernay
EJC
2008
13 years 7 months ago
The distinguishing number of Cartesian products of complete graphs
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...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
WCC
2005
Springer
140views Cryptology» more  WCC 2005»
14 years 26 days ago
Constructions of Complementary Sequences for Power-Controlled OFDM Transmission
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...
Kai-Uwe Schmidt, Adolf Finger
MP
2010
92views more  MP 2010»
13 years 2 months ago
Single item lot-sizing with non-decreasing capacities
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...
Yves Pochet, Laurence A. Wolsey