Related papers: A candidate for a solution to Wall's D(2) problem

The Hardy-Littlewood inequality on $\mathbb{T}$ compares the $L^p$-norm of a function with a weighted $\ell^p$-norm of its Fourier coefficients. The approach has recently been studied for compact homogeneous spaces and we study a natural…

For r at least 3, p at least 2, we classify all actions of the groups Diff^r_c(R) and Diff^r_+(S1) by C^p -diffeomorphisms on the line and on the circle. This is the same as describing all nontrivial group homomorphisms between groups of…

We show that a Hausdorff, ample groupoid $\mathcal{G}$ can be completely recovered from the $I$-norm completion of $C_c(\mathcal{G})$. More generally, we show that this is also the case for the algebra of symmetrized $p$-pseudofunctions, as…

We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…

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 the current paper we provide a proof of NP-completeness for the CFP problem with the fractional grouping efficacy objective. For this purpose we first consider the CFP with the linear objective minimizing the total number of exceptions…

For any $n\geq k\geq l\in\mathbb{N},$ let $S(n,k,l)$ be the set of all those non-negative definite matrices $a\in M_{n}(\mathbb{C})$ with $l\leq\text{rank }a\leq k$. Motivated by applications to $C^{*}$-algebra theory, we investigate the…

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…

Every proper closed subgroup of a connected Hausdorff group must have index at least c, the cardinality of the continuum. 70 years ago Markov conjectured that a group G can be equipped with a connected Hausdorff group topology provided that…

Given a diagram of Pi-algebras (graded groups equipped with an action of the primary homotopy operations), we ask whether it can be realized as the homotopy groups of a diagram of spaces. The answer given here is in the form of an…

Let $s_d(p,a) = \min \{k | a = \sum_{i=1}^{k}a_i^d, a_i\in \ff_p^*\}$ be the smallest number of d-th powers in the finite field F_p, sufficient to represent the number a in F_p^*. Then $$g_d(p) = max_{a in F_p^*} s_d(p,a)$$ gives an answer…

A classic theorem of T. Ando characterises operators that have numerical radius at most one as operators that admit a certain positive 2x2 operator matrix completion. In this paper we consider variants of Ando's theorem, in which the…

In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…

A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…

A natural strengthening of an algorithm for the (promise) constraint satisfaction problem is its singleton version: we first fix a variable to an element from its domain, then run the algorithm, and remove the element from the domain if the…

We prove existence and regularity results for weak solutions of non linear elliptic systems with non variational structure satisfying $(p,q)$-growth conditions. In particular we are able to prove higher differentiability results under a…

If $\phi$ is an analytic selfmap of the disk (not an elliptic automorphism) the Denjoy-Wolff Theorem predicts the existence of a point $p$ with $|p|\leq 1$ such that the iterates $\phi_{n}$ converge to $p$ uniformly on compact subsets of…

We show that the equation associated with a group word $w \in G \ast {\mathbf F}_2$ can be solved over a hyperlinear group $G$ if its content - that is its augmentation in ${\mathbf F}_2$ - does not lie in the second term of the lower…

Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…