On k-Column Sparse Packing Programs

We consider the class of packing integer programs (PIPs) that are column sparse, i.e. there is a specified upper bound k on the number of constraints that each variable appears in. We give an (ek+o(k))-approximation algorithm for k-column sparse PIPs, improving on recent results of $k^2\cdot 2^k$ and $O(k^2)$. We also show that the integrality gap of our linear programming relaxation is at least 2k-1; it is known that k-column sparse PIPs are $\Omega(k/ \log k)$-hard to approximate. We also extend our result (at the loss of a small constant factor) to the more general case of maximizing a submodular objective over k-column sparse packing constraints.Comment: 19 pages, v3: additional detail

A new foundational crisis in mathematics, is it really happening?

The article reconsiders the position of the foundations of mathematics after the discovery of HoTT. Discussion that this discovery has generated in the community of mathematicians, philosophers and computer scientists might indicate a new crisis in the foundation of mathematics. By examining the mathematical facts behind HoTT and their relation with the existing foundations, we conclude that the present crisis is not one. We reiterate a pluralist vision of the foundations of mathematics. The article contains a short survey of the mathematical and historical background needed to understand the main tenets of the foundational issues.Comment: Final versio

Market split and basis reduction: towards a solution of the Cornuejols-Dawande instances

Previously, G. Cornuejols and M. Dawande (1998) proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branch-and-bound. They offered these market split instances as a challenge to the integer programming community. The market split problem can be formulated as a system of linear diophantine equations in 0-1 variables. We use the algorithm of K. Aardal et al. (1998) based on lattice basis reduction. This algorithm is not restricted to deal with market split instances only but is a general method for solving systems of linear diophantine equations with bounds on the variables. We show computational results from solving both feasibility and optimization versions of the market split instances with up to 7 equations and 60 variables and discuss various branching strategies and their effect on the number of enumerated nodes. To our knowledge, the largest feasibility and optimization instances solved before had 6 equations and 50 variables, and 4 equations and 30 variables, respectively. We also present a probabilistic analysis describing how to compute the probability of generating infeasible market split instances. By generating instances in the way prescribed by Cornuejols and Dawande, one obtains relatively many feasible instances for sizes larger than 5 equations and 40 variable

Some Varieties of Equational Logic (Extended Abstract)

... been a major theme of Joseph Goguen’s research, perhaps even the major theme. One strand of this work concerns algebraic datatypes. Recently there has been some interest in what one may call algebraic computation types. As we will show, these are also given by equational theories, if one only understands the notion of equational logic in somewhat broader senses than usual. One moral of our work is that, suitably considered, equational logic is not tied to the usual first-order syntax of terms and equations. Standard equational logic has proved a useful tool in several branches of computer science, see, for example, the RTA conference series [9] and textbooks, such as [1]. Perhaps the possibilities for richer varieties of equational logic discussed here will lead to further applications. We begin with an explanation of computation types. Starting around 1989, Eugenio Moggi introduced the idea of monadic notions of computation [11, 12

Demographic, clinical and antibody characteristics of patients with digital ulcers in systemic sclerosis: data from the DUO Registry

OBJECTIVES: The Digital Ulcers Outcome (DUO) Registry was designed to describe the clinical and antibody characteristics, disease course and outcomes of patients with digital ulcers associated with systemic sclerosis (SSc). METHODS: The DUO Registry is a European, prospective, multicentre, observational, registry of SSc patients with ongoing digital ulcer disease, irrespective of treatment regimen. Data collected included demographics, SSc duration, SSc subset, internal organ manifestations, autoantibodies, previous and ongoing interventions and complications related to digital ulcers. RESULTS: Up to 19 November 2010 a total of 2439 patients had enrolled into the registry. Most were classified as either limited cutaneous SSc (lcSSc; 52.2%) or diffuse cutaneous SSc (dcSSc; 36.9%). Digital ulcers developed earlier in patients with dcSSc compared with lcSSc. Almost all patients (95.7%) tested positive for antinuclear antibodies, 45.2% for anti-scleroderma-70 and 43.6% for anticentromere antibodies (ACA). The first digital ulcer in the anti-scleroderma-70-positive patient cohort occurred approximately 5 years earlier than the ACA-positive patient group. CONCLUSIONS: This study provides data from a large cohort of SSc patients with a history of digital ulcers. The early occurrence and high frequency of digital ulcer complications are especially seen in patients with dcSSc and/or anti-scleroderma-70 antibodies