Related papers: Closure structures parameterized by systems of iso…
Modal dependence logics are modal logics defined on the basis of team semantics and have the downward closure property. In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those…
Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once; for…
We introduce a general and compositional, yet simple, framework that allows us to derive soundness and expressiveness results for modal logics characterizing behavioural equivalences or metrics (also known as Hennessy-Milner theorems). It…
Aperture synthesis observations with full polarisation have long been used to study the magnetic fields of synchrotron emitting sources. Recently proposed closure invariants give us a powerful method for extracting information from measured…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
We study cutoff results for parameterized verification and synthesis of guarded protocols, as introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of processes whose transitions are enabled or disabled depending on…
A syntactic model is presented for the specification of finite-state synchronous digital logic systems with complex input/output interfaces, which control the flow of data between opaque computational elements, and for the composition of…
We show that parameterized versions of splitting theorems in Morse theory can be effectively used to generalize some famous bifurcation theorems for potential operators. In particular, such generalizations based on the author's recent…
We consider differential operators $A$ that can be represented by means of a so-called closure relation in terms of a simpler operator $A_{\operatorname{ext}}$ defined on a larger space. We analyze how the spectral properties of $A$ and…
Let $X$ be a reduced connected $k$-scheme pointed at a rational point $x \in X(k)$. By using tannakian techniques we construct the Galois closure of an essentially finite $k$-morphism $f:Y\to X$ satisfying the condition…
In the preprint we present an outline of the one dimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvabilty by radicals, by elementary…
For commuting linear operators $P_0,P_1,..., P_\ell$ we describe a range of conditions which are weaker than invertibility. When any of these conditions hold we may study the composition $P=P_0P_1... P_\ell$ in terms of the component…
We study diverse parametrized versions of the operad of associative algebra, where the parameter are taken in an associative semigroup $\Omega$ (generalization of matching or family associative algebras) or in its cartesian square…
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a general fashion, we define master stability equations and…
The design and implementation of static analyzers has become increasingly systematic. Yet for a given language or analysis feature, it often requires tedious and error prone work to implement an analyzer and prove it sound. In short, static…
This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
In this preprint we present an outline of the multidimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvability by radicals, by…
We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism class of their absolute Galois groups. Our results concern two cases: saturated PAC structures and non-saturated…