English
Related papers

Related papers: Intertwining connectivities in representable matro…

200 papers

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

Commutative Algebra · Mathematics 2026-01-09 Lisa Nicklasson , Manolis C. Tsakiris

Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…

Combinatorics · Mathematics 2026-03-11 Jannis Koulman , Oliver Lorscheid

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

A partially ordered set P is representable if there is a bounded distributive lattice such that its ordered set of prime ideals is order-isomorphic to P. We show that if the order components of a poset P are representable, then so is P.…

Logic · Mathematics 2007-05-30 Michael E. Adams , Dominic van der Zypen

This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].

Combinatorics · Mathematics 2017-11-23 Jon Henry Sanders

The light-cone approach is reviewed. This method allows to find the underlying quantum field theory for any integrable lattice model in its gapless regime. The relativistic spectrum and S-matrix follows straightforwardly in this way through…

High Energy Physics - Theory · Physics 2009-09-25 H. J. de Vega

A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…

Combinatorics · Mathematics 2011-09-07 Ben Clark , Geoff Whittle

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…

Combinatorics · Mathematics 2023-04-18 Houshan Fu , Chunming Tang , Suijie Wang

We study intertwining relations for matrix one-dimensional, in general, non-Hermitian Hamiltonians by matrix differential operators of arbitrary order. It is established that for any matrix intertwining operator Q_N^- of minimal order N…

Quantum Physics · Physics 2013-07-18 Andrey V. Sokolov

We address the question of when a covering of the boundary of a surface can be extended to a covering of the surface (equivalently: when is there a branched cover with a prescribed monodromy). If such an extension is possible, when can the…

Geometric Topology · Mathematics 2014-02-26 Manfred Droste , Igor Rivin

Following up on our previous work, we study single-element extensions of transversal valuated matroids. We show that tropical presentations of valuated matroids with a minimal set of finite entries enjoy counterparts of the properties…

Combinatorics · Mathematics 2025-03-12 Alex Fink , Jorge Alberto Olarte

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

Let $\mathcal{M}$ and $\mathcal{N}$ be two matroids on the same ground set $V$. Let $A_1,\dots,A_{2n-1}$ be sets which are independent in both $\mathcal{M}$ and $\mathcal{N}$, satisfying $|A_i|\geq \textrm{min}(i,n)$ for all $i$. We show…

Combinatorics · Mathematics 2025-11-06 Eli Berger , Daniel McGinnis

We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

Combinatorics · Mathematics 2015-11-17 Konstantinos Papalamprou , Leonidas Pitsoulis

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable…

Combinatorics · Mathematics 2019-08-01 Dillon Mayhew , Mike Newman , Geoff Whittle

We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.

Combinatorics · Mathematics 2014-09-24 Nathan Bowler , Johannes Carmesin

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…

Combinatorics · Mathematics 2017-05-02 Attila Joó

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

Rings and Algebras · Mathematics 2021-05-03 G. Grätzer , H. Lakser

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler
‹ Prev 1 8 9 10 Next ›