For a matroid $M$ on $X$ with closure operator $\tau:2^X\to 2^X$ let $c(M)=\min\{|S|:\tau(X\setminus S)\neq X\}$. This is an invariant because if $M$ and $M'$ are isomorphic (i.e. if flats of $M$ are bijective images of flats of $M'$) then $c(M)=c(M')$ likewise note if $M$ is the graphic matroid of any undirected graph $G$ then $c(M)=\lambda(G)$ is the edge connectivity of $G$ also in particular if $M$ is a gammoid then $c(M)$ is equal to the maximum number of pairwise disjoint bases of $M$. Anyway probably over thinking this as I'm very new to matroid theory, perhaps studying the dual of $M$ might simplify things?
2026-03-26 22:19:31.1774563571
Does this matroid invariant have a name?
103 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in TERMINOLOGY
- The equivalent of 'quantum numbers' for a mathematical problem
- Does approximation usually exclude equality?
- Forgot the name of a common theorem in calculus
- Name of some projection of sphere onto $\mathbb{R}^2$
- What is $x=5$ called??
- Is there a name for this operation? $f(a, b) = a + (1 - a)b$
- When people say "an algebra" do they always mean "an algebra over a field"?
- What is the term for "in one $n$-space"?
- The product of disjoint cycles
- What about the 'geometry' in 'geometric progression'?
Related Questions in LINEAR-PROGRAMMING
- Proving dual convex cone property
- Linear algebra: what is the purpose of passive transformation matrix?
- Building the model for a Linear Programming Problem
- Show that $ \ x_ 0 \ $ cannot be an optimal solution
- Is there any way to model this situation in integer programming?
- How to Solve a Linear Programming Problem in $n$ Dimension Space?
- How to solve a linear program without any given data?
- Constraints for continuous path within graph with at least one obligatory node in path
- Select the smallest strict positive value from a list of variables in a linear program.
- How to add nonnegative constraint to an LP problem
Related Questions in MATROIDS
- Do these special substring sets form a matroid?
- how to prove that the dual of a matroid satisfies the exchange property?
- Proof of uniform matrix being transversal matrix by selecting singletons
- Smallest matroid containing two disjoint maximal elements of cardinality $K$?
- How much does the number of connected components of a graph grow in the case below?
- Given bases $A$, $B$ of a matroid there is a one-to-one mapping $\omega$ from $A$ to $B$ such that $(A - {a}) \cup {\omega(a)}$ is independent
- How to list all circuits of an oriented matroid and all circuits of its contraction of a vertex by hand?
- Relationship between Affine Dependence and Linear Dependence in Oriented Matroids?
- Contraction of oriented matroid as related to polytope?
- Why is this not a matroid?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
This is the cogirth of the matroid. Note that a set $S$ satisfies $\tau (X\setminus S)\neq X$ if and only if $X\setminus S$ is not spanning. This is the same as asking that $S$ is a dependent set in $M^*$. Thus, your condition can be rewritten as $$c(M)=\min\{|S| : S\text{ is a dependent set of }M^*\}$$ which is the definition of cogirth.