Related papers: Software for cut-generating functions in the Gomor…
This paper presents GARCON program, illustrating its functionality on a simple HEP analysis example. The program automatically performs rectangular cuts optimization and verification for stability in a multi-dimensional phase space. The…
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner…
We define matrix models that converge to the generating functions of a wide variety of loop models with fugacity taken in sets with an accumulation point. The latter can also be seen as moments of a non-commutative law on a subfactor planar…
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms.…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
I give in this lecture an overview of the features of the Mathematica package SARAH, and explain how it can be used together with other codes to study all aspects of a BSM model. The focus will be on the description of the analytical…
We construct a two-sided discontinuous piecewise linear minimal valid function for the 1-row Gomory--Johnson model which is not extreme, but which is not a convex combination of other piecewise linear minimal valid functions. The new…
It has been recently shown that numerical semiparametric bounds on the expected payoff of fi- nancial or actuarial instruments can be computed using semidefinite programming. However, this approach has practical limitations. Here we use…
Statistical design of experiments is widely used in scientific and industrial investigations. A generalized minimum aberration (GMA) orthogonal array is optimum under the well-established, so-called GMA criterion, and such an array can…
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's…
We recently presented the so-called allagmatic method, which includes a system metamodel providing a framework for describing, modelling, simulating, and interpreting complex systems. Its development and programming was guided by…
We present pygiftgenerator, a python module for systematically preparing a large number of numerical and multiple-choice questions for Moodle-based quizzes oriented to students' formative evaluation. The use of the module is illustrated by…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
Error enhancement properties of data processing algorithms in elementary particle physics measurements are discussed. It is argued that a systematic use of continuous weights instead of hard cuts may reduce errors of the results at the cost…
This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in…
In this paper we study the generating functionals of several random packing processes: the classical Mat\'ern hard-core model; its extensions, the $k$-Mat\'ern models and the $\infty$-Mat\'ern model, which is an example of random sequential…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We construct an algorithm for the minimal model program in dimension three over the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein…
Coleman integrals is a major tool in the explicit arithmetic of algebraic varieties, notably in the study of rational points on curves. One of the inputs to compute Coleman integrals is the availability of an affine model. We develop a…