Related papers: A parametrized version of the Borsuk Ulam theorem
For nonautonomous and nonlinear differential and difference equations depending on a parameter, we formulate sufficient conditions under which they exhibit $C^k$, $k\in \N$ shadowing with respect to a parameter. Our results are applicable…
We consider decomposition spaces $\R^3/G$ that are manifold factors and admit defining sequences consisting of cubes-with-handles. Metrics on $\R^3/G$ constructed via modular embeddings into Euclidean spaces promote the controlled topology…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
In this paper, we prove existence of symmetric homoclinic orbits for the suspension bridge equation $u""+\beta u" + e^u-1=0$ for all parameter values $\beta \in [0.5,1.9]$. For each $\beta$, a parameterization of the stable manifold is…
We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
We study the problem of subharmonic bifurcations for analytic systems in the plane with perturbations depending periodically on time, in the case in which we only assume that the subharmonic Melnikov function has at least one zero. If the…
In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and…
Given an algorithm of resolution of singularities satisfying certain conditions (``good algorithms''), natural notions of simultaneous algorithmic resolution, or equiresolution, for families of embedded schemes (parametrized by a reduced…
We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows:…
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
We consider a "twisted" noncommutative join procedure for unital $C^*$-algebras which admit actions by a compact abelian group $G$ and its discrete abelian dual $\Gamma$, so that we may investigate an analogue of Baum-Dabrowski-Hajac…
Game comonads, introduced by Abramsky, Dawar and Wang, and developed by Abramsky and Shah, give a categorical semantics for model comparison games. We present an axiomatic account of Feferman-Vaught-Mostowski (FVM) composition theorems…
We study the spaces of polynomials stratified into the sets of polynomial with fixed number of roots inside certain semialgebraic region $\Omega$, on its border, and at the complement to its closure. Presented approach is a generalisation,…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
We provide the first definition of \emph{Misiurewicz parameter} for the unicritical family of algebraic correspondences $ z^r + c$, with $ r > 1$ rational, and prove that, at every Misiurewicz parameter, the correspondence uniformly expands…
We introduce an analog to the notion of Polish space for spaces of weight $\leq\kappa$, where $\kappa$ is an uncountable regular cardinal such that $\kappa^{<\kappa}=\kappa$. Specifically, we consider spaces in which player II has a winning…