Related papers: A counter-example to Baranyai's combinatorial char…
Let $k$ be a field of arbitrary characteristic, $A$ be a domain and $K=\mathrm{frac}(A)$. Then (1) All exponential maps of $k^{[3]}$ are rigid, and we give a necessary and sufficient condition for the triangularity of $\delta \in…
Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…
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…
We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or $K_{1,3}$) frequently appears as one of forbidden subgraphs. Recently, Furuya and Tsuchiya compared two classes generated by different…
We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.
We discuss several counterexamples to a rigidity conjecture of K. Khanin, which states that under some quantitative condition on non-existence of periodic orbits, $C^0$ conjugacy implies $C^1$ (even $C^\infty$) conjugacy. We construct…
We propose new symmetry-adapted rigidity matrices to analyze the infinitesimal rigidity of arbitrary-dimensional bar-joint frameworks with Abelian point group symmetries. These matrices define new symmetry-adapted rigidity matroids on…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
Extending the discovery by Giles Gardam of a concrete counterexample to Kaplansky's unit conjecture in characteristic 2, a family of counterexamples for every prime characteristic is presented.
The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…
Birational Calabi-Yau threefolds in the same deformation family provide a `weak' counterexample to the global Torelli problem, as long as they are not isomorphic. In this paper, it is shown that deformations of certain desingularized…
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is…
The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We give a cohomological characterization of Gromov relative hyperbolicity. As an application we prove a converse to the combination theorem for graphs of relatively hyperbolic groups given in a previous paper of the first author. We build…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…
We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…
Miyanishi proved that the ring of invariants of any $\mathbb{G}_a$ action on $\mathbb{A}^3$ is $\mathbb{A}^2$, when the field $k$ has zero characteristic. However, it is not known if this result holds when $k$ has positive characteristic.…