English
Related papers

Related papers: Defining bicircular matroids in monadic logic

200 papers

We provide a self-contained proof to so-called Martio's conjecture in the class of mappings of bounded length distortion. Unlike the earlier proofs, our proof is not based on the modulus of continuity estimate of Martio from 1970.

Complex Variables · Mathematics 2022-08-16 Ville Tengvall

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

Combinatorics · Mathematics 2012-12-12 R. A. Pendavingh , S. H. M. van Zwam

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…

Combinatorics · Mathematics 2019-10-03 Laszlo Csirmaz

The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…

Category Theory · Mathematics 2020-12-03 Chris Heunen , Vaia Patta

The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel M. Gelfand , Neil White

We establish a criterion for deciding whether a class of structures is the class of models of a geometric theory inside Grothendieck toposes; then we specialize this result to obtain a characterization of the infinitary first-order theories…

Category Theory · Mathematics 2013-04-26 Olivia Caramello

A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…

Combinatorics · Mathematics 2024-05-03 James Dylan Douthitt , James Oxley

We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…

Combinatorics · Mathematics 2017-09-15 Johannes Carmesin

In this paper, we introduce the terminology of matroids into the study of Zariski-pairs related to rational elliptic surfaces, aiming to simplify the presentation and arguments involved. As an application, we provide new examples of Zariski…

Algebraic Geometry · Mathematics 2019-02-14 Ryutaro Sato , Shinzo Bannai

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim

We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…

Combinatorics · Mathematics 2024-08-06 Alheydis Geiger , Kevin Kuehn , Raluca Vlad

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

Logic in Computer Science · Computer Science 2013-10-02 Paul-André Melliès , Noam Zeilberger

We compute the motive of the classifying stack of an orthogonal group in the Grothendieck ring of stacks over a field of characteristic different from two.

Algebraic Geometry · Mathematics 2018-09-11 Ajneet Dhillon , Matthew B. Young

We give a generalization of the theory of $\mathbb{Z}_2$-graded manifolds to a theory of $\mathcal{I}$-graded manifolds, where $\mathcal{I}$ is a commutative semi-ring with some additional properties. We prove Batchelor's theorem in this…

Differential Geometry · Mathematics 2022-11-09 Shuhan Jiang

We show that, with some technical conditions, an abelian category can be embedded into the category of bimodules over a ring. The case of semisimple rigid monoidal categories is studied in more detail.

Category Theory · Mathematics 2007-05-23 Phung Ho Hai

We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the M\"obius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to…

Combinatorics · Mathematics 2022-10-25 Trygve Johnsen , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

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

We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…

Discrete Mathematics · Computer Science 2009-09-29 Konstantinos Papalamprou , Leonidas Pitsoulis