Related papers: Refuting Feder, Kinne and Rafiey

We prove that families of semi-orthogonal decompositions do not satisfy the existence part of the valuative criterion for properness, giving a negative answer to a question posed by Belmans, Okawa, and Ricolfi.

A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…

J. Marcinkiewicz and A. Zygmund proved in 1936 that the special $n$-th generalized Riemann derivative ${_2}D_nf(x)$ with nodes $0,1,2,2^2,\ldots, 2^{n-1}$, is equivalent to the $n$-th Peano derivative $f_{(n)}(x)$, for all $n-1$ times Peano…

We prove that the central sequence algebra of a separable C*-algebra is either subhomogeneous or non-exact, confirming a conjecture of Enders and Shulman. We also prove analogous dichotomy for other massive C*-algebras.

We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the…

(I) We study Clifford-Mackey-Rieffel's theory for finite monoid; (II) We prove some results of Theta Representations of finite inverse monoids.

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

Paper withdrawn by the author.

Recently Breuillard and Tointon showed that one reasonable formulation of the polynomial Freiman-Ruzsa conjecture fails for nonabelian groups. We improve and simplify their construction.

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…

Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.

This paper has been withdrawn by the author. The conjecture follows from the finiteness of group von Neumann algebras.

Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain D. An instance of the…

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Harary's conjecture $r(C_3,G)\leq 2q+1$ for every isolated-free graph G with $q$ edges was proved independently by Sidorenko and Goddard and Klietman. In this paper instead of $C_3$ we consider $K_{2,k}$ and seek a sharp upper bound for…

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

Based on the recent work of Arsovski, we confirm a conjecture of Feng, Sun, and Xiang, and we give a shortened proof of Snevily's conjecture.

The purpose of this note is to show by constructing counterexamples that two conjectures of M\'{o}ri and Sz\'{e}kely for the Borel-Cantelli lemma are false.

We prove that the genus $g$, the relative irregularity $q_f$ and the Clifford index $c_f$ of a non-isotrivial fibration $f$ satisfy the inequality $q_f \leq g - c_f$. This gives in particular a proof of Xiao's conjecture for fibrations…

This comment about the article "Hamiltonian for the Zeros of the Riemann Zeta Function", by C. M. Bender, D. C. Brody, and M. P. M\"uller, published recently in Phys. Rev. Lett. (Phys. Rev. Lett., 118, 130201, (2017)) gives arguments…