Related papers: Semidefinite programming, harmonic analysis and co…
These notes contain part of the lectures of an introductory course on orthogonal polynomials and special functions that I gave in the joint PhD Program in Mathematics UC|UP in the academic years 2015-2016 (at University of Porto) and…
Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big…
In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…
We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…
This article is a semitutorial-style survey of computability logic. An extended online version of it is maintained at http://www.csc.villanova.edu/~japaridz/CL/ .
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
In a recent paper by Harrison et al., the concept of program completion is extended to a large class of programs in the input language of the ASP grounder gringo. We would like to automate the process of generating and simplifying…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
These notes are a summary of the problem session discussions at various CANT (Combinatorial and Additive Number Theory Conferences). Currently they include all years from 2009 through 2019 (inclusive); the goal is to supplement this file…
This index covers the lecture notes and the final course project reports for COMP6411 Summer 2010 at Concordia University, Montreal, Canada, Comparative Study of Programming Languages by 4 teams trying compare a set of common criteria and…
These are expanded and revised notes for a minicourse entitled "Affine W-algebras", which took place as part of the thematic month "Quantum Symmetries" at the Centre de Recherches Mathematiques in Montreal, Canada in October 2022. The first…
In this series of lectures presented at the CIMPA Winter School on Discrete Integrable Systems in Pondicherry, India, in February, 2003 we give a review of the application of Lie point symmetries, and their generalizations to the study of…
We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we provide a unified global…
This paper collects and extends the lectures I gave at the "XXIV International Fall Workshop on Geometry and Physics" held in Zaragoza (Spain) August 31 - September 4, 2015. Within these lectures I review the formulation of Quantum…
The growth of tropical geometry has generated significant interest in the tropical semiring in the past decade. However, there are other semirings in tropical algebra that provide more information, such as the symmetrized (max, +),…
This chapter is based on lectures on Randomized Numerical Linear Algebra from the 2016 Park City Mathematics Institute summer school on The Mathematics of Data.
These are detailed notes for a lecture on "Non-associative Algebraic Structures: Classification and Structure" which I presented as a part of my Agrega\c{c}\~ao em Matem\'atica e Applica\c{c}\~oes (University of Beira Interior, Covilh\~a,…
Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard…
We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming.
In this work we calibrate two different analytic models of semilocal strings by constraining the values of their free parameters. In order to do so, we use data obtained from the largest and most accurate field theory simulations of…