Related papers: On Finite Bases for Weak Semantics: Failures versu…
We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…
We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
In this article we define a special class of weak expectations for a representation of a separable unital C*-algebra, called decomposable weak expectation. We give necessary and sufficient conditions for such kind of weak expectations to…
We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation. There is a natural classification of these processes into decidable, intermediate and complete.…
In this paper we find necessary and sufficient conditions for the weak convergence of c-free convolution of pairs of measures, where the measures are assumed to be infinitesimal and their support may be unbounded. These results are obtained…
Methods of Lie group analysis of differential equations are extended to weak solutions of (linear and nonlinear) PDEs, where the term ``weak solution'' comprises the following settings: (a) Distributional solutions. (b) Solutions in…
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…
The outcome of a weak quantum measurement conditioned to a subsequent postselection (a weak value protocol) can assume peculiar values. These results cannot be explained in terms of conditional probabilistic outcomes of projective…
We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
We give a summary of the theory of (weak) quantum vertex $\C((t))$-algebras and the association of quantum affine algebras with (weak) quantum vertex $\C((t))$-algebras.
We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
We prove a functional central limit theorem for partial sums of symmetric stationary long range dependent heavy tailed infinitely divisible processes with a certain type of negative dependence. Previously only positive dependence could be…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
We initiate the mathematical study of the boundary Carrollian conformal algebra (BCCA), an infinite-dimensional Lie algebra recently discovered in the context of Carrollian physics. The BCCA is an intriguing object from both physical and…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…