English
Related papers

Related papers: Finite connectivity in infinite matroids

200 papers

The satellite endofunctors are used to extend the definition of linkage of ideals to the linkage of totally finitely presented functors. The new notion for linkage works over a larger class of rings and is consistent with the functorial…

Representation Theory · Mathematics 2015-10-14 Jeremy Russell

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

Rings and Algebras · Mathematics 2018-03-30 Daniel P. Bossaller , Sergio R. López-Permouth

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

Combinatorics · Mathematics 2025-08-03 Houshan Fu

We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

In this note, we explain how to prove several basic results about finite index extensions of irreducible local M\"obius covariant nets in the setting of Connes fusion.

Operator Algebras · Mathematics 2025-07-21 Bin Gui

Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…

Functional Analysis · Mathematics 2007-05-23 Yury Grabovsky , Omar Hijab , Igor Rivin

Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…

Logic in Computer Science · Computer Science 2025-03-06 C. B. Aberlé , Chris Martens , Frank Pfenning

We study fractality of unbounded sets of finite Lebesgue measure at infinity by introducing the notions of Minkowski dimension and content at infinity. We also introduce the Lapidus zeta function at infinity, study its properties and…

Mathematical Physics · Physics 2023-04-27 Goran Radunović

On contact manifolds we describe a notion of (contact) finite-type for linear partial differential operators satisfying a natural condition on their leading terms. A large class of linear differential operators are of finite-type in this…

Differential Geometry · Mathematics 2010-03-11 Michael Eastwood , A. Rod Gover

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

We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids (which is not possible for…

Discrete Mathematics · Computer Science 2013-06-11 Lukas Mach , Tomas Toufar

In this work, the notions of normal cones at infinity to unbounded sets and limiting and singular subdifferentials at infinity for extended real value functions are introduced. Various calculus rules for these notions objects are…

Optimization and Control · Mathematics 2023-08-01 Do Sang Kim , Minh Tung Nguyen , Tien Son Pham

A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…

Combinatorics · Mathematics 2017-03-06 Amanda Cameron , Dillon Mayhew

A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of…

Combinatorics · Mathematics 2026-03-13 Wayne Ge , James Oxley

An identity is proved connecting two finite sums of inverse tangents. This identity is discretized version of Jacobi's imaginary transformation for the modular angle from the theory of elliptic functions. Some other related identities are…

General Mathematics · Mathematics 2020-10-06 Martin Nicholson

We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on…

Combinatorics · Mathematics 2012-01-10 Gary Gordon

This book studies ultrafilters on connectivity systems, that is, on pairs \((X,f)\) where \(X\) is a finite set and \(f:2^{X}\to \mathbb{N}\) is a symmetric submodular function. Ultrafilters, which play a fundamental role in topology and…

Combinatorics · Mathematics 2026-04-17 Takaaki Fujita

A Vitali-type theorem for vector lattice-valued modulars with respect to filter convergence is proved. Some applications are given to modular convergence theorems for moment operatorsin the vector lattice setting, and also for the Brownian…

Functional Analysis · Mathematics 2015-07-24 Antonio Boccuto , Domenico Candeloro , Anna Rita Sambucini

The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…

Combinatorics · Mathematics 2019-03-04 Carolyn Chun , Iain Moffatt , Steven D. Noble , Ralf Rueckriemen
‹ Prev 1 4 5 6 7 8 10 Next ›