Related papers: Finite connectivity in infinite matroids
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We show that the infinite matroid intersection conjecture of Nash-Williams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure…
Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…
We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…
The aim of this note is to derive some invariants at infinity for open 3-manifolds in the framework of Topological Quantum Field Theories. These invariants may be used to test if an open manifold is simply connected at infinity as we done…
Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…
Submodular setfunctions play an important role in potential theory, and a perhaps even more important role in combinatorial optimization. The analytic line of research goes back to the work of Choquet; the combinatorial, to the work of Rado…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
In this paper we introduce two theories of finite type invariants for framed links with fixed linking matrix. We show that these thepries are related to the theory of Vassiliev invariants of framed links. We also study the corresponding…
In this article we study certain notions of `tameness' for the persistence modules studied in topological data analysis. In particular, we show that after adding infinitary points the so called finitely determined modules become finitely…
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…
We extend the modular invariance property of the trace functions of vertex operator algebra on the set of irreducible modules (Zhu's theory) to the case of trace functions of intertwining operators.
The purpose of this paper is to describe several applications of finiteness properties of $F$-finite $F$-modules recently discovered by M. Hochster to the study of Frobenius maps on injective hulls, Frobenius near-splittings and to the…
We introduce motivic zeta functions for matroids. These zeta functions are defined as sums over the lattice points of Bergman fans, and in the realizable case, they coincide with the motivic Igusa zeta functions of hyperplane arrangements.…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…
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".
We develop the basic theory of matrix-valued Weyl-Titchmarsh M-functions and the associated Green's matrices for whole-line and half-line self-adjoint Hamiltonian finite difference systems with separated boundary conditions.