Related papers: Semidefinite programming, harmonic analysis and co…
In (Apt et al, TOPLAS 1998) we introduced the imperative programming language Alma-0 that supports declarative programming. In this paper we illustrate the hybrid programming style of Alma-0 by means of various examples that complement…
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum…
This article is an extended version of the minicourse given by the second author at the summer school of the conference "Interactions of quantum affine algebras with cluster algebras, current algebras and categorification", held in June…
These are notes for a summer course given at the PIMS Summer School on Geometric and Topological Aspects of the Representation Theory of Finite Groups in Vancouver, July 27-30 2016.
The accuracies of modern quantum logic clocks have surpassed those of standard atomic fountain clocks. These clocks also provide a greater degree of control, because before and after clock queries, we are able to apply chosen unitary…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum…
This is a review devoted to some results of Algebraic Programming (Computer Algebra) used in treating several problems of general relativity, based mainly on already published articles. The article contains the talk given by the author at…
In this paper, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear programs with random objective coefficients. To this end, assuming…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
This paper can be considered as an extension to our paper [On symplectically harmonic forms on six-dimensional nilmanifolds, Comment. Math. Helv. 76 (2001), n 1, 89-109]. Also, it contains a brief survey of recent results on symplectically…
The source of these notes is a series of lectures given at the CIMPA's summer school "Recent Topics in Geometric Analysis".
We propose the notion of semi-infinite homology for algebras over operads using the relative homology theory for operadic algebras.
This Survey provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program analysis is challenging due to the existence of undecidable…
We discuss semiempirical approaches and parametric methods developed for modeling molecular vibronic spectra. These methods, together with databases of molecular fragments, have proved efficient and flexible for solving various problems…
Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…