中文
相关论文

相关论文: Finite matchability under the matroidal Hall's con…

200 篇论文

We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…

组合数学 · 数学 2026-03-17 Dániel Garamvölgyi , Bill Jackson , Tibor Jordán , Soma Villányi

Let $M$ be a matroid on a finite ground set $E$, and suppose that the automorphism group of $M$ acts transitively on $E$. We show the following: if $X_1,\ldots,X_K$ are sampled independently from a distribution $p$ on $E$, then the…

组合数学 · 数学 2026-05-25 Mladen Kovačević

This paper investigates infinite matroids from a categorical perspective. We prove that the category of infinite matroids is a proto-exact category in the sense of Dyckerhoff and Kapranov, thereby generalizing our previous result on the…

组合数学 · 数学 2021-09-01 Chris Eppolito , Jaiung Jun

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent…

环与代数 · 数学 2009-09-16 Ian D. Morris

The multivariate Tutte polynomial $\hat Z_M$ of a matroid $M$ is a generalization of the standard two-variable version, obtained by assigning a separate variable $v_e$ to each element $e$ of the ground set $E$. It encodes the full structure…

组合数学 · 数学 2012-05-25 Adam Bohn , Peter J. Cameron , Peter Müller

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

组合数学 · 数学 2025-01-27 Irfan Alam

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

一般拓扑 · 数学 2009-10-20 Yevgen Polulyakh , Iryna Yurchuk

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

组合数学 · 数学 2015-09-02 João Paulo Costalonga

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

组合数学 · 数学 2024-01-22 Pu Gao , Peter Nelson

Z-mapping graph is a balanced bipartite graph $G$ of a digraph $D$ by split each vertex of $D$ into a pair of vertices of $G$. Based on the property of the $G$, it is proved that if $D$ is strong connected and $G$ is Hamiltonian, then $D$…

离散数学 · 计算机科学 2008-12-24 Guohun Zhu

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

逻辑 · 数学 2026-05-07 Alexander Usvyatsov

Brylawski and Seymour independently proved that if $M$ is a connected matroid with a connected minor $N$, and $e \in E(M) - E(N)$, then $M \backslash e$ or $M / e$ is connected having $N$ as a minor. This paper proves an analogous but…

组合数学 · 数学 2019-08-28 Zachary Gershkoff , James Oxley

We introduce a geometric generalization of Hall's marriage theorem. For any family $F = \{X_1, \dots, X_m\}$ of finite sets in $\mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_i\in X_i$ for every $1\leq i…

组合数学 · 数学 2016-02-02 Andreas Holmsen , Leonardo Martinez-Sandoval , Luis Montejano

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

组合数学 · 数学 2025-09-17 Nathan Bowler , Attila Joó

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

交换代数 · 数学 2026-01-09 Lisa Nicklasson , Manolis C. Tsakiris

We study the realization spaces of matroids and hyperplane arrangements. First, we define the notion of naive dimension for the realization space of matroids and compare it with the expected dimension and the algebraic dimension, exploring…

组合数学 · 数学 2024-10-30 Emiliano Liwski , Fatemeh Mohammadi

Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…

组合数学 · 数学 2023-03-14 Xiangying Chen

Refining a theorem of Zarhin, we prove that given a $g$-dimensional abelian variety $X$ and an endomorphism $u$ of $X$, there exists a matrix $A \in \operatorname{M}_{2g}(\mathbb{Z})$ such that each Tate module $T_\ell X$ has a…

代数几何 · 数学 2025-10-15 Bjorn Poonen , Sergey Rybakov

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

群论 · 数学 2010-08-17 E. P. Vdovin , V. I. Zenkov

Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a…

形式语言与自动机理论 · 计算机科学 2013-06-12 Shubh Narayan Singh , K. V. Krishna