Related papers: Semidefinite programming, harmonic analysis and co…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a…
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
This text was written and used for a MAP Summer School at the University of Genova, August 28 to September 2, 2006. Available since then on the web site of the second author, it has been used and referenced by several colleagues working in…
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…
We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…
This paper introduces a new structure of commutative semiring, generalizing the tropical semiring, and having an arithmetic that modifies the standard tropical operations, i.e. summation and maximum. Although our framework is combinatorial,…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
These notes are for the author's lectures, "Integral Reduction and Applied Algebraic Geometry Techniques" in the School and Workshop on Amplitudes in Beijing 2016. I introduce the applications of algebraic geometry methods on multi-loop…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
This is set of notes prepared for the Summer School on non-Abelian Hodge theory in Abbaye de Saint-Jacut de la Mer June, 6-19, 2022. We cover the following topics: Lecture 1. Harmonic Maps Between Riemannian Manifolds Lecture 2. Existence…
This is an expanded version of the notes by the second author of the lectures on Hitchin systems and their quantization given by the first author at the Beijing Summer Workshop in Mathematics and Mathematical Physics ``Integrable Systems…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We give an introduction to the structure theory of extended affine Lie algebras, which provide a common framework for finite-dimensional semisimple, affine and toroidal Lie algebras. The notes are based on a lecture series given during the…
We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…