arXiv subjects

Ileana Streinu

Publications and source records attributed to Ileana Streinu.

At least 19 recordsLinked to original sources

arXiv2025

Nucleation-free independent graphs with implied nonedges

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity matroids with their respective definitions of nucleations and implied nonedges. The first motivation for the inductive constructions of this paper, which generate an especially intractable class of flexible circuits, is to illuminate further obstacles to settling Graver's maximality conjecture that the 3-dimensional generic rigidity matroid is isomorphic to Whiteley's cofactor matroid (the unique maximal matroid in which all graphs isomorphic to $K_5$ are circuits). While none of the explicit examples we provide refutes the maximality conjecture (since their properties hold in both matroids) the construction schemes are useful regardless whether the conjecture is true or false, e.g. for constructing larger (counter)examples from smaller ones. The second motivation is to make progress towards a polynomial-time algorithm for deciding independence in the abovementioned maximal matroid. Nucleation-free graphs with implied nonedges, such as the families constructed in this paper, are the key obstacles that must be dealt with for improving the current state of the art.

math.CO↗

arXiv2023

Enumerating combinatorial resultant decompositions of 2-connected rigidity circuits

A rigidity circuit (in 2D) is a minimal dependent set in the rigidity matroid, i.e. a minimal graph supporting a non-trivial stress in any generic placement of its vertices in $\mathbb R^2$. Any rigidity circuit on $n\geq 5$ vertices can be obtained from rigidity circuits on a fewer number of vertices by applying the combinatorial resultant (CR) operation. The inverse operation is called a combinatorial resultant decomposition (CR-decomp). Any rigidity circuit on $n\geq 5$ vertices can be successively decomposed into smaller circuits, until the complete graphs $K_4$ are reached. This sequence of CR-decomps has the structure of a rooted binary tree called the combinatorial resultant tree (CR-tree). A CR-tree encodes an elimination strategy for computing circuit polynomials via Sylvester resultants. Different CR-trees lead to elimination strategies that can vary greatly in time and memory consumption. It is an open problem to establish criteria for optimal CR-trees, or at least to characterize those CR-trees that lead to good elimination strategies. In [12] we presented an algorithm for enumerating CR-trees where we give the algorithms for decomposing 3-connected rigidity circuits in polynomial time. In this paper we focus on those circuits that are not 3-connected, which we simply call 2-connected. In order to enumerate CR-decomps of 2-connected circuits $G$, a brute force exp-time search has to be performed among the subgraphs induced by the subsets of $V(G)$. This exp-time bottleneck is not present in the 3-connected case. In this paper we will argue that we do not have to account for all possible CR-decomps of 2-connected rigidity circuits to find a good elimination strategy; we only have to account for those CR-decomps that are a 2-split, all of which can be enumerated in polynomial time. We present algorithms and computational evidence in support of this heuristic.

math.CO↗

arXiv2023

Computing Circuit Polynomials in the Algebraic Rigidity Matroid

We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid $\mathcal{A}(\text{CM}_n)$ associated to the Cayley-Menger ideal CM$_n$ for $n$ points in 2D. It relies on combinatorial resultants, a new operation on graphs that captures properties of the Sylvester resultant of two polynomials in this ideal. We show that every rigidity circuit has a construction tree from K4 graphs based on this operation. Our algorithm performs an algebraic elimination guided by such a construction tree, and uses classical resultants, factorization and ideal membership. To highlight its effectiveness, we implemented the algorithm in Mathematica: it took less than 15 seconds on an example where a Gröbner Basis calculation took 5 days and 6 hrs. Additional speed-ups are obtained using non-$K_4$ generators of the Cayley-Menger ideal and simple variations on our main algorithm.

math.CO↗

arXiv2021

Faster algorithms for circuits in the Cayley-Menger algebraic matroid

A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths. For minimally rigid graphs, the double-exponential Gröbner Bases algorithm with an elimination order can be applied, in theory, but it is impractical even for small instances. By relating the problem to the computation of circuit polynomials in the Cayley-Menger ideal, we recently proposed an algebraic-combinatorial approach and an elimination algorithm for circuit polynomials [23]. It is guided by a tree structure whose leaves correspond to complete $K_4$ graphs and whose nodes perform algebraic resultant operations. In this paper we uncover further combinatorial structure in the Cayley-Menger algebraic matroid that leads to an extension of our algorithm. In particular, we generalize the combinatorial resultant operation of [23] to take advantage of the non-circuit generators and irreducible polynomials in the Cayley-Menger ideal and use them as leaves of the tree guiding the elimination. Our new method has been implemented in Mathematica and allows previously unobtainable calculations to be carried out. In particular, the $K_{3,3}$-plus-one circuit polynomial, with over one million terms in 10 variables and whose calculation crashed after several days with the previous method of [23], succeeded now in approx. 30 minutes.

math.CO↗

arXiv2021

Combinatorial Resultants in the Algebraic Rigidity Matroid

Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We introduce combinatorial resultants, a new operation on graphs that captures properties of the Sylvester resultant of two polynomials in the algebraic rigidity matroid. We show that every rigidity circuit has a construction tree from $K_4$ graphs based on this operation. Our algorithm performs an algebraic elimination guided by the construction tree, and uses classical resultants, factorization and ideal membership. To demonstrate its effectiveness, we implemented our algorithm in Mathematica: it took less than 15 seconds on an example where a Groebner Basis calculation took 5 days and 6 hrs.

math.CO↗

arXiv2018

Auxetic regions in large deformations of periodic frameworks

In materials science, auxetic behavior refers to lateral widening upon stretching. We investigate the problem of finding domains of auxeticity in global deformation spaces of periodic frameworks. Case studies include planar periodic mechanisms constructed from quadrilaterals with diagonals as periods and other frameworks with two vertex orbits. We relate several geometric and kinematic descriptions.

math.MG↗

arXiv2017

Periodic auxetics: Structure and design

Materials science has adopted the term of auxetic behavior for structural deformations where stretching in some direction entails lateral widening, rather than lateral shrinking. Most studies, in the last three decades, have explored repetitive or cellular structures and used the notion of negative Poisson's ratio as the hallmark of auxetic behavior. However, no general auxetic principle has been established from this perspective. In the present paper, we show that a purely geometric approach to periodic auxetics is apt to identify essential characteristics of frameworks with auxetic deformations and can generate a systematic and endless series of periodic auxetic designs. The critical features refer to convexity properties expressed through families of homothetic ellipsoids.

math.MG↗

arXiv2016

Auxetic deformations and elliptic curves

The problem of detecting auxetic behavior, originating in materials science and mathematical crystallography, refers to the property of a flexible periodic bar-and-joint framework to widen, rather than shrink, when stretched in some direction. The only known algorithmic solution for detecting infinitesimal auxeticity is based on the rather heavy machinery of fixed-dimension semi-definite programming. In this paper we present a new, simpler algorithmic approach which is applicable to a natural family of 3D periodic bar-and-joint frameworks with 3 degrees-of-freedom. This class includes most zeolite structures, which are important for applications in computational materials science. We show that the existence of auxetic deformations is related to properties of an associated elliptic curve. A fast algorithm for recognizing auxetic capabilities is obtained via the classical Aronhold invariants of the cubic form defining the curve.

math.MG↗

arXiv2016

New principles for auxetic periodic design

We show that, for any given dimension $d\geq 2$, the range of distinct possible designs for periodic frameworks with auxetic capabilities is infinite. We rely on a purely geometric approach to auxetic trajectories developed within our general theory of deformations of periodic frameworks.

math.MG↗

arXiv2016

Geometric deformations of sodalite frameworks

In mathematical crystallography and computational materials science, it is important to infer flexibility properties of framework materials from their geometric representation. We study combinatorial, geometric and kinematic properties for frameworks modeled on sodalite.

math.MG↗

arXiv2015

Geometric auxetics

We formulate a mathematical theory of auxetic behavior based on one-parameter deformations of periodic frameworks. Our approach is purely geometric, relies on the evolution of the periodicity lattice and works in any dimension. We demonstrate its usefulness by predicting or recognizing, without experiment, computer simulations or numerical approximations, the auxetic capabilities of several well-known structures available in the literature. We propose new principles of auxetic design and rely on the stronger notion of expansive behavior to provide an infinite supply of planar auxetic mechanisms and several new three-dimensional structures.

math.MG↗

arXiv2015

Expansive periodic mechanisms

A one-parameter deformation of a periodic bar-and-joint framework is expansive when all distances between joints increase or stay the same. In dimension two, expansive behavior can be fully explained through our theory of periodic pseudo-triangulations. However, higher dimensions present new challenges. In this paper we study a number of periodic frameworks with expansive capabilities in dimension $d\geq 3$ and register both similarities and contrasts with the two-dimensional case.

math.MG↗

arXiv2015

Liftings and stresses for planar periodic frameworks

We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic properties for planar periodic pseudo-triangulations, generalizing features known for their finite counterparts. These properties are then applied to questions originating in mathematical crystallography and materials science, concerning planar periodic auxetic structures and ultrarigid periodic frameworks.

math.MG↗

arXiv2015

Deforming Diamond

For materials science, diamond crystals are almost unrivaled for hardness and a range of other properties. Yet, when simply abstracting the carbon bonding structure as a geometric bar-and-joint periodic framework, it is far from rigid. We study the geometric deformations of this type of framework in arbitrary dimension d, with particular regard to the volume variation of a unit cell.

math.MG↗

arXiv2013

Nucleation-free $3D$ rigidity

When all non-edge distances of a graph realized in $\mathbb{R}^{d}$ as a {\em bar-and-joint framework} are generically {\em implied} by the bar (edge) lengths, the graph is said to be {\em rigid} in $\mathbb{R}^{d}$. For $d=3$, characterizing rigid graphs, determining implied non-edges and {\em dependent} edge sets remains an elusive, long-standing open problem. One obstacle is to determine when implied non-edges can exist without non-trivial rigid induced subgraphs, i.e., {\em nucleations}, and how to deal with them. In this paper, we give general inductive construction schemes and proof techniques to generate {\em nucleation-free graphs} (i.e., graphs without any nucleation) with implied non-edges. As a consequence, we obtain (a) dependent graphs in $3D$ that have no nucleation; and (b) $3D$ nucleation-free {\em rigidity circuits}, i.e., minimally dependent edge sets in $d=3$. It additionally follows that true rigidity is strictly stronger than a tractable approximation to rigidity given by Sitharam and Zhou \cite{sitharam:zhou:tractableADG:2004}, based on an inductive combinatorial characterization. As an independently interesting byproduct, we obtain a new inductive construction for independent graphs in $3D$. Currently, very few such inductive constructions are known, in contrast to $2D$.

cs.CG↗

arXiv2011

Periodic body-and-bar frameworks

Abstractions of crystalline materials known as periodic body-and-bar frameworks are made of rigid bodies connected by fixed-length bars and subject to the action of a group of translations. In this paper, we give a Maxwell-Laman characterization for generic minimally rigid periodic body-and-bar frameworks. As a consequence we obtain efficient polynomial time algorithms for their recognition based on matroid partition and pebble games.

math.MG↗

arXiv2011

Deformations of crystal frameworks

We apply our deformation theory of periodic bar-and-joint frameworks to tetrahedral crystal structures. The deformation space is investigated in detail for frameworks modelled on quartz, cristobalite and tridymite.

math.MG↗

arXiv2011

Frameworks with crystallographic symmetry

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 descriptions for families of frameworks with a specified graph and symmetry. A simple geometric setting for diaplacive phase transitions is obtained. Upper bounds are derived for the number of realizations of minimally rigid periodic graphs.

math.MG↗