Related papers: Strict refinement property of connected loop-free …
Let $f$ be a transcendental entire function and let $I(f)$ denote the set of points that escape to infinity under iteration. We give conditions which ensure that, for certain functions, $I(f)$ is connected. In particular, we show that…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We show that each refinable map preserves colocal connectedness of the domain while a proximately refinable map does not necessarily. Also, we prove that colocal connectedness is a Whitney property and is not a Whitney reversible property.
We consider finitely presented,residually finite groups $G$ and finitely generated normal subgroups $A$ such that the inclusion $A\hookrightarrow G$ induces an isomorphism from the profinite completion of $A$ to a direct factor of the…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Local superlinear convergence of the semismooth Newton method usually necessitates assumptions on the uniform invertibility of the utilized, generalized Jacobian matrices, such as, e.g., BD- or CD-regularity. For certain composite-type…
This is a survey article on the stable cohomotopy refinement of Seiberg-Witten invariants containing also new results, for example: - Stable cohomotopy groups describe path components of certain mapping spaces. - Relation of stable…
The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…
In previous work we showed that the contact category algebra of a quadrangulated surface is isomorphic to the homology of a strand algebra from bordered sutured Floer theory. Being isomorphic to the homology of a differential graded…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
This article studies the categorical setting of Abramsky, Haghverdi, and Scott's untyped linear combinatory algebras, and relates this to more recent work of Abramsky and Heunen on Frobenius algebras in the infinitary setting. The key to…
Minimum error state discrimination between two mixed states \rho and \sigma can be aided by the receipt of "classical side information" specifying which states from some convex decompositions of \rho and \sigma apply in each run. We…
We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…
We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
Refinement calculus provides a structured framework for the progressive and modular development of programs, ensuring their correctness throughout the refinement process. This paper introduces a refinement calculus tailored for quantum…
We solve a long standing open problem concerning the structure of finite cycles in the category mod A of finitely generated modules over an arbitrary artin algebra A, that is, the chains of homomorphisms $M_0 \stackrel{f_1}{\rightarrow} M_1…