Related papers: Corona Rigidity
A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
We address one of the open problems in quantization theory recently listed by Rieffel. By developping in detail Connes' tangent groupoid principle and using previous work by Landsman, we show how to construct a strict, flabby quantization,…
We obtain estimates in the corona theorem for the algebra of analytic functions in the unit disc whose nth derivative is bounded, and its subalgebras defined by the boundary continuity of the nth derivative. The corona theorem for such…
We introduce a criterion, resilience, which allows properties of a dataset (such as its mean or best low rank approximation) to be robustly computed, even in the presence of a large fraction of arbitrary additional data. Resilience is a…
Let $\alpha$ be a coprime automorphism of a group $G$ of prime order and let $P$ be an $\alpha$-invariant Sylow $p$-subgroup of $G$. Assume that $p\notin \pi(C_G(\alpha))$. Firstly, we prove that $G$ is $p$-nilpotent if and only if…
A quantization over a manifold can be seen as a way to construct a differential operator with prescribed principal symbol. The quantization map is moreover required to be a linear bijection. It is known that there is in general no natural…
We show how singularities shape the evolution of rational discrete dynamical systems. The stabilisation of the form of the iterates suggests a description providing among other things generalised Hirota form, exact evaluation of the…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
The theory of noncommutative geometry provides an interesting mathematical background for developing new physical models. In particular, it allows one to describe the classical Standard Model coupled to Euclidean gravity. However,…
We prove a rigidity theorem in Poisson geometry around compact Poisson submanifolds, using the Nash-Moser fast convergence method. In the case of one-point submanifolds (fixed points), this immediately implies a stronger version of Conn's…
We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…
Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…
We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…
We investigate the structure of quantum proof systems by establishing collapse results that reveal simplifications in their complexity landscape. By extending classical theorems such as the Karp-Lipton theorem to quantum settings and…
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…
This is the second article of a sequence of research on deformations of Q-curvature. In the previous one, we studied local stability and rigidity phenomena of Q-curvature. In this article, we mainly investigate the volume comparison with…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…