Related papers: A Bisimulation-Invariance-Based Approach to the Se…
A classification, according to invariant theory, of non-constant invariant Abel ODEs known as solvable and found in the literature is presented. A set of new integrable classes depending on one or no parameters, derived from the analysis of…
We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
An obstruction theory for representing homotopy classes of surfaces in 4-manifolds by immersions with pairwise disjoint images is developed, using the theory of non-repeating Whitney towers. The accompanying higher-order intersection…
The BFV-formalism was introduced to handle classical systems, equipped with symmetries. It associates a differential graded Poisson algebra to any coisotropic submanifold $S$ of a Poisson manifold $(M,\Pi)$. However the assignment…
We demonstrate how path integrals often used in problems of theoretical physics can be adapted to provide a machinery for performing Bayesian inference in function spaces. Such inference comes about naturally in the study of inverse…
A pseudoclassical model for P,T-invariant system of topologically massive U(1) gauge fields is analyzed. The model demonstrates a nontrivial relationship between continuous and discrete symmetries and reveals a phenomenon of ``classical…
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…
It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…
We construct an obstruction theory for relative Hilbert schemes in the sense of Behrend-Fantechi and compute it explicitly for relative Hilbert schemes of divisors on smooth projective varieties. In the special case of curves on a surface…
This paper presents algebraic methods for the study of polynomial relative invariants, when the group G formed by the symmetries and relative symmetries is a compact Lie group. We deal with the case when the subgroup H of symmetries is…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…
Probabilistic inferences distill knowledge from graphs to aid human make important decisions. Due to the inherent uncertainty in the model and the complexity of the knowledge, it is desirable to help the end-users understand the inference…
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…
The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…