Related papers: Product theorems via semidefinite programming
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
We describe a new continued fraction system in Minkowski space $\mathbb R^{1,1}$, proving convergence, ergodicity with respect to an explicit invariant measure, and Lagrange's theorem. The proof of ergodicity leads us to the question of…
We prove that the module categories of Noether algebras (i.e., algebras module finite over a noetherian center) and affine noetherian PI algebras over a field enjoy the following product property: Whenever a direct product $\prod_{n \in…
Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been…
Weighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path…
Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…
In this paper, we prove that there is a natural correspondence between product identities for theta functions and integer matrix exact covering systems. We show that since $\mathbb{Z}^n$ can be taken as the disjoint union of a lattice…
A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (i.e. those calculi that support general and modular proof-strategies for cut elimination), and at identifying classes of logics that…
Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the…
A discrete group which admits a faithful, finite dimensional, linear representation over a field $\mathbb F$ of characteristic zero is called linear. This note combines the natural structure of semi-direct products with work of A. Lubotzky…
An extension of the WHILE-language is developed for programming game-theoretic mechanisms involving multiple agents. Examples of such mechanisms include auctions, voting procedures, and negotiation protocols. A structured operational…
From the interpretation of Linear Logic multiplicative disjunction as the $\varepsilon$-product defined by Laurent Schwartz, we construct several models of Differential Linear Logic based on usual mathematical notions of smooth maps. This…
In this paper, we show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity. For a relation f subset of X times Y times Z (X,Y,Z are finite sets), let R^{(t), pub}_e (f) denote the…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations,…
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical…
We give a poly-time construction for a combinatorial classic known as Sparse Incomparability Lemma, studied by Erdos, Lovasz, Nesetril, Rodl and others: We show that every Constraint Satisfaction Problem is poly-time equivalent to its…