English
Related papers

Related papers: A splitter theorem for elastic elements in $3$-con…

200 papers

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Combinatorics · Mathematics 2013-11-28 Vanessa Chatelain , Jorge Ramirez Alfonsin

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

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 $C_1$ and $C_2$ are circuits in a matroid $M$ with $e_1$ in $C_1-C_2$ and $e$ in $C_1\cap C_2$, then $M$ has a circuit $C_3$ such that $e\in C_3\subseteq (C_1\cup C_2)-e$. This strong circuit elimination axiom is inherently asymmetric. A…

Combinatorics · Mathematics 2025-08-04 Christine Cho , James Oxley , Suijie Wang

This paper uses 3D grain-scale finite element (FE) simulations to appraise the classical scattering theory of plane longitudinal wave propagation in untextured polycrystals with statistically equiaxed grains belonging to the seven crystal…

Materials Science · Physics 2022-08-10 Ming Huang , Stanislav I. Rokhlin , Michael J. S. Lowe

The isotropic matroid $M[IAS(G)]$ of a graph $G$ is a binary matroid, which is equivalent to the isotropic system introduced by Bouchet. In this paper we discuss four notions of connectivity related to isotropic matroids and isotropic…

Combinatorics · Mathematics 2017-07-07 Lorenzo Traldi , Robert Brijder

For an atomic domain $D$, the $elasticity$ $\rho(D)$ of $D$ is defined as $\sup\{r/s: \pi_1\cdots \pi_r = \rho_1 \cdots \rho_s,~ \text{where each $\pi_i, \rho_j$ is irreducible}\}$; the elasticity provides a concrete measure of the failure…

Number Theory · Mathematics 2025-06-03 Steve Fan , Paul Pollack

The fundamental building blocks in band theory are band representations (BRs): bands whose infinitely-numbered Wannier functions are generated (by action of a space group) from a finite number of symmetric Wannier functions centered on a…

Strongly Correlated Electrons · Physics 2020-09-10 A. Alexandradinata , J. Höller , Chong Wang , Hengbin Cheng , Ling Lu

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Combinatorics · Mathematics 2025-06-30 Rebecca Monks , Anthony Nixon

We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.

Combinatorics · Mathematics 2017-03-09 Carolyn Chun , Deborah Chun , Steven D. Noble

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

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

In this paper, we consider time-harmonic elastic wave scattering governed by the Lam\'e system. It is known that the elastic wave field can be decomposed into the shear and compressional parts, namely, the pressure and shear waves that are…

Analysis of PDEs · Mathematics 2015-09-15 Hongyu Liu , Jingni Xiao

We classify all matroids with at most 8 elements that have the half-plane property, and we provide a list of some matroids on 9 elements that have, and that do not have the half-plane property. Furthermore, we prove that several classes of…

Combinatorics · Mathematics 2023-10-25 Mario Kummer , Büşra Sert

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

We study a class of models for brittle fracture: elastic theory models which allow for cracks but not for plastic flow. We show that these models exhibit, at all finite temperatures, a transition to fracture under applied load similar to…

Materials Science · Physics 2009-10-28 Alex Buchel , James P. Sethna

Magnetic elastomers are appealing materials from an application point of view: they combine the mechanical softness and deformability of polymeric substances with the addressability by external magnetic fields. In this way, mechanical…

Soft Condensed Matter · Physics 2015-06-22 Elshad Allahyarov , Andreas M. Menzel , Lei Zhu , Hartmut Löwen

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

Combinatorics · Mathematics 2026-04-23 Mattias Ehatamm , Peter Nelson , Fernanda Rivera Omana

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…

Combinatorics · Mathematics 2011-10-05 Mike Develin , Jeremy L. Martin , Victor Reiner