Learn More
In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of ⌈ n 2 ⌉ white pegs followed immediately by ⌊ n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent(More)
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will(More)
The Oberwolfach problem (OP) asks whether Kn (for n odd) or Kn minus a 1-factor (for n even) admits a 2-factorization where each 2-factor is isomorphic to a given 2-factor F. The order n and the type of the 2-factor F are the parameters of the problem. For n ≤ 17, the existence of a solution has been resolved for all possible parameters. There are also many(More)
The United States Department of Veterans Affairs (VHA) is the largest provider of Hepatitis C Virus (HCV) care and has made considerable effort in facilitating multidisciplinary medical and mental health care for Veterans with HCV. Those with HCV are at high risk for psychiatric and substance use disorders that often negatively impact selection for and(More)
BACKGROUND The rates of obesity and substance abuse are high among US veterans. OBJECTIVE To examine weight loss and substance abuse rates following bariatric surgery in veterans with a history of substance abuse (SA). METHODS A prospective database of consecutive bariatric operations was reviewed. Data for SA patients were compared to patients without(More)
Let ∆(d, n) be the maximum possible diameter of the vertex-edge graph over all d-dimensional polytopes defined by n inequalities. The Hirsch bound holds for particular n and d if ∆(d, n) ≤ n − d. Francisco San-tos recently resolved a question open for more than five decades by showing that ∆(d, 2d) = d + 1 for d = 43; the dimension was then lowered to 20 by(More)
In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of ⌈ n 2 ⌉ white pegs followed immediately by ⌊ n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent(More)
  • 1