Related papers: Constructing isostatic frameworks for the $\ell^\i…
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald conjectured that the edges of every cubic graph on $4n$…
We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restricted space algorithms for these problems proving the…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Rational homology ellipsoids are certain Liouville domains diffeomorphic to rational homology balls and having Lagrangian pin-wheels as their skeleta. From the point of view of almost toric fibrations, they are a natural generalisation of…
When applying isogeometric analysis to engineering problems, one often deals with multi-patch spline spaces that have incompatible discretisations, e.g. in the case of moving objects. In such cases mortaring has been shown to be…
Periodic frameworks with crystallographic symmetry are investigated from the perspective of a general deformation theory of periodic bar-and-joint structures in $R^d$. It is shown that natural parametrizations provide affine section…
This paper extends graphic statics by describing the forces and moments in any 3D rigid-jointed frame structure in terms of cell complexes using homology theory of algebraic topology. Graphic statics provides a highly geometric way to…
We derive a mixed-dimensional 3D-1D formulation of the electrostatic equation in two domains with different dielectric constants to compute, with an affordable computational cost, the electric field and potential in the relevant case of…
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…
We investigate the two-dimensional elastostatic inclusion problem in an unbounded medium. Building on the recent developments for rigid inclusions \cite{Mattei:2021:EAS} and conductivity inclusions \cite{Jung:2021:SEL}, we extend these…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
We characterise finite and infinitesimal rigidity for bar-joint frameworks in R^d with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be…
We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the…
We develop a new approach to Lagrangian-Floer gluing. The construction of the gluing map is based on the intersection theory in some Hilbert manifold of paths $\mathcal{P} $. We consider some moduli spaces of perturbed holomorphic curves…
This paper presents two existence h-principles, the first for conformal symplectic structures on closed manifolds, and the second for leafwise conformal symplectic structures on foliated manifolds with non empty boundary. The latter…