中文
相关论文

相关论文: Improved bounds for Rota's Basis Conjecture

200 篇论文

We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show…

组合数学 · 数学 2023-10-24 Matt DeVos , Daryl Funk , Luis Goddyn , Gordon Royle

Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…

组合数学 · 数学 2017-10-31 Louis Esperet , Jean-Florent Raymond

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are regarded as disjoint unions of two subsets of the ground set {1,...,t} of the…

组合数学 · 数学 2020-08-25 Andrey O. Matveev

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

组合数学 · 数学 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where $0<q<1$. Consequently, we can sample…

数据结构与算法 · 计算机科学 2019-01-23 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant

The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered…

组合数学 · 数学 2018-07-19 Emeric Gioan , Michel Las Vergnas

Versions of Bailey's lemma which change the base from q to q^2 or q^3 are given. Iterates of these versions give many new versions of multisum Rogers-Ramanujan identities. We also prove Melzer's conjectures for the Fermionic forms of the…

组合数学 · 数学 2007-05-23 David Bressoud , Mourad Ismail , Dennis Stanton

We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let $V_1,\ldots,V_n \subset R^d$ be $n$ disjoint sets of points (of $n$ `colors'). Suppose that for every $V_i$ and every point $v \in…

组合数学 · 数学 2014-06-09 Zeev Dvir , Christian Tessier-Lavigne

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

The algebraic formulation of the derivation and integration related by the First Fundamental Theorem of Calculus (FFTC) gives rise to the notion of differential Rota-Baxter algebra. The notion has a remarkable list of categorical…

环与代数 · 数学 2026-01-14 Li Guo , Aniruddha Talele , Shilong Zhang , Shanghua Zheng

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

几何拓扑 · 数学 2018-11-14 Joseph Gordon , Gaiane Panina

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

组合数学 · 数学 2023-01-10 Tianyu Liu

Subject to announced results by Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids.

组合数学 · 数学 2021-08-17 Ben Clark , Kevin Grace , James Oxley , Stefan H. M. van Zwam

Brown has shown that the Stanley-Reisner ring of the broken circuit complex of a graph has a linear system of parameters which is defined in terms of the circuits and cocircuits of the graph. Later on Brown and Sagan conjectured a special…

组合数学 · 数学 2010-06-01 Andri Egilsson , Martina Kubitzke

We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.

组合数学 · 数学 2022-10-12 Mario Midence-Ordóñez

We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be…

数据结构与算法 · 计算机科学 2021-01-27 Heng Guo , Mark Jerrum

We study the gaps $\Delta p_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen…

组合数学 · 数学 2020-01-06 Christian Gaetz , Praveen Venkataramana

We focus on checking the validity of the half-plane property on two prominent classes of transversal matroids, namely lattice path matroids and bicircular matroids. We show that lattice path matroids satisfy the half-plane property.…

组合数学 · 数学 2024-02-12 Ayush Kumar Tewari

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Omer Gimenez

In this article we prove the subrank of a generic tensor in $\mathbb{C}^{n,n,n}$ to be $Q(n) = \lfloor\sqrt{3n - 2}\rfloor$ by providing a lower bound to the known upper bound. More generally, we find the generic subrank of tensors of all…

代数几何 · 数学 2024-08-15 Paweł Pielasa , Matouš Šafránek , Anatoli Shatsila