English
Related papers

Related papers: The Euler characteristic, $q$-matroids, and a M\"o…

200 papers

Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…

Combinatorics · Mathematics 2026-02-05 Madeline Brandt , Juliette Bruce , Daniel Corey

This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…

Combinatorics · Mathematics 2020-05-25 Relinde Jurrius , Ruud Pellikaan

In this paper, we introduce morphisms for matroids with coefficients (in the sense of Baker and Bowler) and quiver matroids. We investigate their basic properties, such as functoriality, duality, minors and cryptomorphic characterizations…

Combinatorics · Mathematics 2026-04-14 Manoel Jarra , Oliver Lorscheid , Eduardo Vital

We consider a $q$-analogue of abstract simplicial complexes, called $q$-complexes, and discuss the notion of shellability for such complexes. It is shown that $q$-complexes formed by independent subspaces of a $q$-matroid are shellable.…

Combinatorics · Mathematics 2021-05-20 Sudhir R. Ghorpade , Rakhi Pratihar , Tovohery H. Randrianarisoa

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Combinatorics · Mathematics 2016-08-16 Jose Alejandro Samper

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

Computational Geometry · Computer Science 2011-12-21 Bjarke Hammersholt Roune , Eduardo Sáenz de Cabezón

In this paper we develop the theory of cyclic flats of $q$-matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a $q$-matroid and hence derive a new $q$-cryptomorphism. We introduce the notion…

Combinatorics · Mathematics 2023-02-15 Gianira N. Alfarano , Eimear Byrne

In this survey, we explain how to compute both the quadratic Euler characteristic of nearby cycles, and the motivic monodromy, at a quasi-homogeneous singularity. This gives, for such singularity, a quadratic refinement to the…

Algebraic Geometry · Mathematics 2025-11-12 Ran Azouri

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

It is well known that the Euler characteristic of an odd dimensional compact manifold is zero. An Euler complex is a combinatorial analogue of a compact manifold. We present here an elementary proof of the corresponding result for Euler…

Geometric Topology · Mathematics 2013-02-25 Colin MacLaurin , Guyan Robertson

The M\"obius function of the subgroup lattice of a finite group has been introduced by Hall and applied to investigate several questions. In this paper, we consider the M\"obius function defined on an order ideal related to the lattice of…

Group Theory · Mathematics 2024-07-31 F. Dalla Volta , L. Di Gravina

A matroid is uniform if and only if it has no minor isomorphic to $U_{1,1}\oplus U_{0,1}$ and is paving if and only if it has no minor isomorphic to $U_{2,2}\oplus U_{0,1}$. This paper considers, more generally, when a matroid $M$ has no…

Combinatorics · Mathematics 2021-02-24 George Drummond

Las Vergnas introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted that when computing the Moebius function of these lattices, it was often zero, although he…

Combinatorics · Mathematics 2007-05-23 Rieuwert Blok , Bruce Sagan

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We propose a definition of an Euler characteristic for unbounded chain complexes by taking the (usual) Euler characteristics of successively longer parts of the complex, weighted inversely proportional to the length, and passing to the…

K-Theory and Homology · Mathematics 2026-04-16 Thomas Huettemann , Dan Kucerovsky

Generating functions for the number of commuting m-tuples in the symmetric groups are obtained. We define a natural sequence of ``orbifold Euler characteristics'' for a finite group G acting on a manifold X. Our definition generalizes the…

Combinatorics · Mathematics 2007-05-23 Jim Bryan , Jason Fulman

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

Combinatorics · Mathematics 2026-03-17 Andrew Fulcher

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

Combinatorics · Mathematics 2020-07-20 Roberto Pagaria

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Combinatorics · Mathematics 2016-03-29 Rade T. Živaljević
‹ Prev 1 2 3 10 Next ›