English
Related papers

Related papers: Elastic elements in 3-connected matroids

200 papers

A matroid $N$ is said to be triangle-rounded in a class of matroids $\mathcal{M}$ if each $3$-connected matroid $M\in \mathcal{M}$ with a triangle $T$ and an $N$-minor has an $N$-minor with $T$ as triangle. Reid gave a result useful to…

Combinatorics · Mathematics 2021-01-14 João Paulo Costalonga , Xianqiang Zhou

Halin proved that every minimally $k$-connected graph has a vertex of degree $k$. More generally, does every minimally vertically $k$-connected matroid have a $k$-element cocircuit? Results of Murty and Wong give an affirmative answer when…

Combinatorics · Mathematics 2022-05-27 James Oxley , Zach Walsh

Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…

Combinatorics · Mathematics 2012-11-27 João Paulo Costalonga

In linear elasticity, we decompose the elasticity tensor into two irreducible pieces with 15 and 6 independent components, respectively. The {\it vanishing} of the piece with 6 independent components corresponds to the Cauchy relations.…

Condensed Matter · Physics 2007-05-23 Friedrich W. Hehl , Yakov Itin

If S is a set of matroids, then the matroid M is S-fragile if, for every element e in E(M), either M\e or M/e has no minor isomorphic to a member of S. Excluded-minor characterizations often depend, implicitly or explicitly, on…

Combinatorics · Mathematics 2015-05-01 Carolyn Chun , Deborah Chun , Dillon Mayhew , Stefan H. M. van Zwam

Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.

Combinatorics · Mathematics 2018-12-05 Ganesh Mundhe , Y. M. Borse

For a matroid $N$, a matroid $M$ is $N$-connected if every two elements of $M$ are in an $N$-minor together. Thus a matroid is connected if and only if it is $U_{1,2}$-connected. This paper proves that $U_{1,2}$ is the only connected…

Combinatorics · Mathematics 2018-07-24 Zachary Gershkoff , James Oxley

Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…

Combinatorics · Mathematics 2017-06-27 James Oxley , Charles Semple , Geoff Whittle

Unlike conventional two-dimensional (2D) semiconductor superlattices, moir\'{e} patterns in 2D materials are flexible and their electronic, magnetic, optical, and mechanical properties depend on their topography. Within a…

Mesoscale and Nanoscale Physics · Physics 2022-11-07 Alexandre Artaud , Nicolas Rougemaille , Sergio Vlaic , Vincent T. Renard , Nicolae Atodiresei , Johann Coraux

For affine monoids of dimension 2 with embedding dimension 2 and 3, we study the problem of determining when a vector is an element of the monoid, and the problem of determining the elasticity of a monoid element.

Commutative Algebra · Mathematics 2018-12-10 Jackson Autry , Vadim Ponomarenko

We call a matroid element "loose" if it is contained in no circuits of size less than the rank of the matroid. A matroid in which all elements are loose is a paving matroid. Acketa determined all binary paving matroids, while Oxley…

Combinatorics · Mathematics 2025-01-15 Jagdeep Singh , Thomas Zaslavsky

A new formalism is used for a Monte Carlo determination of the elastic constants of a two-dimensional net of fixed connectivity. The net is composed of point-like atoms each of which is tethered to six neighbors by a bond limiting the…

Statistical Mechanics · Physics 2009-10-31 Oded Farago , Yacov Kantor

The sticky polymatroid conjecture states that any two extensions of the polymatroid have an amalgam if and only if the polymatroid has no non-modular pairs of flats. We show that the conjecture holds for polymatroids on five or less…

Information Theory · Computer Science 2020-02-04 Laszlo Csirmaz

We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a…

Combinatorics · Mathematics 2009-02-06 Dillon Mayhew , Gordon Royle , Geoff Whittle

In linear elasticity, a fourth order elasticity (stiffness) tensor of 21 independent components completely describes deformation properties of a material. Due to Voigt, this tensor is conventionally represented by a $6\times 6$ symmetric…

Classical Physics · Physics 2022-11-08 Yakov Itin

A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…

Combinatorics · Mathematics 2018-08-01 Peter Nelson , Kazuhiro Nomoto

An orthotropic metamaterial is composed of elements arrayed periodically in space. The element includes two cuboid structures. The first structure is the basic structure of the element, and the second structure is the transformation of the…

Applied Physics · Physics 2023-09-08 Jiang Ke

A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam