Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

First order convergence of matroids

Tools
- Tools
+ Tools

Kardos, Frantisek, Králʼ, Daniel, Liebenau, Anita and Mach, Lukáš (2017) First order convergence of matroids. European Journal of Combinatorics, 59 . pp. 150-168. doi:10.1016/j.ejc.2016.08.005

[img] PDF
WRAP_Kral_folim-matroids.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (599Kb)
Official URL: http://dx.doi.org/10.1016/j.ejc.2016.08.005

Request Changes to record.

Abstract

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini–Schramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling. We establish the matroid counterpart of this result: every first order convergent sequence of matroids with bounded branch-depth representable over a fixed finite field has a limit modeling, i.e., there exists an infinite matroid with the elements forming a probability space that has asymptotically the same first order properties. We show that neither of the bounded branch-depth assumption nor the representability assumption can be removed.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Matroids, Convergence, Combinatorial analysis
Journal or Publication Title: European Journal of Combinatorics
Publisher: Academic Press
ISSN: 0195-6698
Official Date: January 2017
Dates:
DateEvent
January 2017Published
7 September 2016Available
13 August 2016Accepted
26 January 2015Submitted
Volume: 59
Page Range: pp. 150-168
DOI: 10.1016/j.ejc.2016.08.005
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Seventh Framework Programme (European Commission) (FP7), Engineering and Physical Sciences Research Council (EPSRC)
Grant number: Grant agreement no. 259385 (FP7), EP/M025365/1 (EPSRC)
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us