English
Related papers

Related papers: Finite matchability under the matroidal Hall's con…

200 papers

There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…

Rings and Algebras · Mathematics 2012-04-18 Petter Brändén

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

Commutative Algebra · Mathematics 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

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

The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family $ (M_i: i\in\Theta) $ of matroids on the common edge set $ E $ is a system $…

Combinatorics · Mathematics 2021-03-30 Attila Joó

We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…

Group Theory · Mathematics 2025-07-25 Sergey V. Gusev

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that…

Group Theory · Mathematics 2013-05-03 Torsten Hoge , Gerhard Roehrle

In this paper, we consider the connectedness of planar self-affine set $T(A,\mathcal{D})$ arising from an integral expanding matrix $A$ with characteristic polynomial $f(x)=x^2+bx+c$ and a digit set $\mathcal{D}=\{0,1,\dots, m\}v$. The…

Dynamical Systems · Mathematics 2015-06-19 Jing-Cheng Liu , Jun Jason Luo , Heng-Wen Xie

It is proved that if $\varphi\colon A\to B$ is a local homomorphism of commutative noetherian local rings, a nonzero finitely generated $B$-module $N$ whose flat dimension over $A$ is at most $\mathrm{edim}\, A - \mathrm{edim}\, B$, is free…

Commutative Algebra · Mathematics 2023-06-22 Sylvain Brochard , Srikanth B. Iyengar , Chandrashekhar Khare

We prove that the existence of a positively defined, invariant Einstein metric $m$ on a connected homogeneous space $G/H$ of a compact Lie group $G$ is the consequence of non-contractibility of some compact set $C=X_{G,H}^{\Sigma}$ (B\"ohm…

Differential Geometry · Mathematics 2013-05-23 Michail M. Graev

For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$…

Combinatorics · Mathematics 2020-08-05 Jeff Kahn

For modules over an artin algebra a linear stability condition is given by a "central charge" and a nonlinear stability condition is given by the wall-crossing sequence of a "green path". Finite Harder-Narasimhan stratifications of the…

Representation Theory · Mathematics 2023-04-05 Kiyoshi Igusa

We transform the method of Glasson into a sufficient condition under which a monoid is non-finitely related, add a new member to the collection of interlocking word-patterns, and use it to show that the monoid $M(ab^2a, a^2b^2)$ is…

Group Theory · Mathematics 2025-07-23 Olga B. Sapir

In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. Firstly, a vector matroid is defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived in terms…

Systems and Control · Computer Science 2017-04-04 Yupeng Yuan , Zhixiong Li , Malekian Reza , Yongzhi Chen , Ying Chen

Let $A$ be a finitary algebra over a finite field $k$, and $A$-$mod$ the category of finite dimensional left $A$-modules. Let $\mathcal{H}(A)$ be the corresponding Hall algebra, and for a positive integer $r$ let $D_{r}(A)$ be the subspace…

Representation Theory · Mathematics 2007-05-23 Dong Yang

Let $G$ be a finite connected graph, and let $T$ be a spanning tree of $G$ chosen uniformly at random. The work of Kirchhoff on electrical networks can be used to show that the events $e_1 \in T$ and $e_2 \in T$ are negatively correlated…

Combinatorics · Mathematics 2022-08-05 June Huh , Benjamin Schröter , Botong Wang

Recently, sufficient conditions of stability or instability for time-delay systems have been proven to be necessary. In this way, a remarkable necessary and sufficient condition has then been developed by Gomez et al. It is presented as a…

Optimization and Control · Mathematics 2022-05-09 Mathieu Bajodek , Frédéric Gouaisbaut , Alexandre Seuret

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

An affine oriented matroid is a combinatorial abstraction of an affine hyperplane arrangement. From it, Novik, Postnikov and Sturmfels constructed a squarefree monomial ideal in a polynomial ring, called an oriented matroid ideal, and got…

Commutative Algebra · Mathematics 2017-11-27 Ryota Okazaki , Kohji Yanagawa

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

Rings and Algebras · Mathematics 2016-03-16 Robert Egrot