Related papers: Semidefinite programming, harmonic analysis and co…
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the first in a series of papers in…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an…
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…
An outline is sketched, of applications of the ideas and the mathematical methods presented at the 19th symposium of the Hellenic Nuclear Physics Society (HNPS) in Thessaloniki, May 2010
This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…
We extend \cite{chen2025srkbp} by analyzing the complexity of the $k$-block-positivity testing algorithm that stems from the optimization problem in Definition \ref{definition:SDP-k-block-positivity}. In this paper, we investigate a…
This note is concerned in so called harmonic complex structures introduced by the author previously. I will recall some previous results and emphasize the motivation: Provide an attempt to a fundamental problem in geometry--determining the…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
Probabilistic programming is related to a compositional approach to stochastic modeling by switching from discrete to continuous time dynamics. In continuous time, an operator-algebra semantics is available in which processes proceeding in…
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…
We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…
This is a survey of open problems in different parts of combinatorial and additive number theory. The paper is based on lectures at the Centre de Recerca Matematica in Barcelona on January 23 and January 25, 2008.
This is a survey of four recent papers which deal with the relationship of simple C*-algebras to the problem of computing the spectra of self-adjoint operators in the general case, especially when the spectrum is not discrete. It is an…
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…
The book is devoted to two research areas: (1) Designing programming languages along with their denotational models. A denotational model of a language consists of two many-sorted algebras - an algebra of syntax and an algebra of…
Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing constraints on the structure of such circuits, certain inference…
The ubiquity of technology in our daily lives and the economic stability of the technology sector in recent years, especially in areas with a computer science footing, has led to an increase in computer science enrollment in many parts of…
Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant…