相关论文: Pseudo-loop conditions
We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…
We investigate the rank of pseudovarieties defined by several of the variants of nilpotency conditions for semigroups in the sense of Mal'cev. For several of them, we provide finite bases of pseudoidentities. We also show that the…
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished…
We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that…
We study rings of real-valued continuous functions in terms of pseudocomplementation conditions on various lattices attached to their prime spectrum. We fully characterize pseudocomplementation in all cases and have an almost complete…
This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski,…
We investigate Mal'cev conditions described by equations whose variables runs over the set of all compatible reflexive relations. Let $p \leq q$ be an equation in the language $\{\wedge, \circ,+\}$. We give a characterization of the class…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…
Given a semialgebraic set-valued map $F \colon \mathbb{R}^n \rightrightarrows \mathbb{R}^m$ with closed graph, we show that the map $F$ is Holder metrically subregular and that the following conditions are equivalent: (i) $F$ is an open map…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template…
Pseudo algebraically closed, pseudo real closed, and pseudo $p$-adically closed fields are examples of unstable fields that share many similarities, but have mostly been studied separately. In this text, we propose a unified framework for…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
It is known that any finite idempotent algebra that satisfies a nontrivial Maltsev condition must satisfy the linear one-equality Maltsev condition (a variant of the term discovered by M. Siggers and refined by K. Kearnes, P. Markovi\'c,…
We explore various formality and finiteness properties in the differential graded algebra models for the Sullivan algebra of piecewise polynomial rational forms on a space. The 1-formality property of the space may be reinterpreted in terms…
We study the measure theoretic properties of typical C 0 maps of the interval. We prove that any ergodic measure is pseudo-physical, and conversely, any pseudo-physical measure is in the closure of the ergodic measures, as well as in the…
The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…