English
Related papers

Related papers: Relative rank axioms for infinite matroids

200 papers

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Combinatorics · Mathematics 2024-03-07 Kevin Purbhoo

In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the…

Optimization and Control · Mathematics 2011-02-28 Boris S. Mordukhovich , Hung M. Phan

Ranking entities such as algorithms, devices, methods, or models based on their performances, while accounting for application-specific preferences, is a challenge. To address this challenge, we establish the foundations of a universal…

Machine Learning · Computer Science 2026-03-25 Sébastien Piérard , Anaïs Halin , Anthony Cioppa , Adrien Deliège , Marc Van Droogenbroeck

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Logic · Mathematics 2025-02-04 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

Logic · Mathematics 2008-04-21 Abderezak Ould Houcine

Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several other closely related classes of…

Combinatorics · Mathematics 2021-01-13 Kevin Grace

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

Logic · Mathematics 2024-11-05 Diego Bejarano

We show that, given a rank 3 affine root system $\Phi$ with Weyl group $W$, there is a unique oriented matroid structure on $\Phi$ which is $W$-equivariant and restricts to the usual matroid structure on rank 2 subsystems. Such oriented…

Combinatorics · Mathematics 2024-10-16 Grant Barkley , Katherine Tung

A new notion of vertex independence and rank for a finite graph G is introduced. The independence of vertices is based on the boolean independence of columns of a natural boolean matrix associated to G. Rank is the cardinality of the…

Combinatorics · Mathematics 2012-10-29 John Rhodes , Pedro V. Silva

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

In recent years, the question of whether the ranks of elliptic curves defined over $\mathbb{Q}$ are unbounded has garnered much attention. One can create refined versions of this question by restricting one's attention to elliptic curves…

Number Theory · Mathematics 2024-12-12 Harris B. Daniels , Hannah Goodwillie

We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…

Combinatorics · Mathematics 2024-04-03 Omid Amini , Lucas Gierczak

Let b(M) denote the maximal number of disjoint bases in a matroid M. It is shown that if M is a matroid of rank d+1, then for any continuous map f from the matroidal complex M into the d-dimensional Euclidean space there exist t \geq…

Combinatorics · Mathematics 2016-11-29 Imre Bárány , Gil Kalai , Roy Meshulam

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

Combinatorics · Mathematics 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We introduce and compare three natural definitions of the rank of a matrix, called the Barvinok rank, the Kapranov rank and the…

Combinatorics · Mathematics 2007-05-23 M. Develin , F. Santos , B. Sturmfels

Just as Lascar's notion of abstract rank axiomatizes the U-rank, we propose axioms for the ranks $SU^d$ and $SU^f$, the foundation ranks of dividing and forking. We study the relationships between these axioms. As with superstable, we…

Logic · Mathematics 2022-02-15 Santiago Cárdenas-Martín , Rafel Farré

Just a survey on I0: The basics, some things known but never published, some things published but not known.

Logic · Mathematics 2017-07-11 Vincenzo Dimonte

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Logic · Mathematics 2023-05-18 Saeed Salehi

As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…

Combinatorics · Mathematics 2012-03-06 Nathan Bowler , Johannes Carmesin