中文
相关论文

相关论文: Lattice path matroids: enumerative aspects and Tut…

200 篇论文

The main theme of this dissertation is retooling methods to work for different situations. I have taken the method derived by O'Hara and simplified by Zeilberger to prove unimodality of $q$-binomials and tweaked it. This allows us to create…

组合数学 · 数学 2018-04-18 Bryan Ek

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

组合数学 · 数学 2017-08-24 Jianqiang Feng , Wenli Liu , Ximei Bai , Zhenheng Li

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

组合数学 · 数学 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…

组合数学 · 数学 2019-02-04 Clément Dupont , Alex Fink , Luca Moci

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Melou , Gilles Schaeffer

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

组合数学 · 数学 2011-07-08 Harald Fripertinger , Marcel Wild

partial abstract: The $q$-state Potts model partition function (equivalent to the Tutte polynomial) for a lattice strip of fixed width $L_y$ and arbitrary length $L_x$ has the form…

统计力学 · 物理学 2009-10-31 Shu-Chiuan Chang , Robert Shrock

We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…

组合数学 · 数学 2023-11-28 Douglas M. Chen , Mario Sanchez , John Veliz , Zhiyan Ying

An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my. The set of these paths can be equipped with a lattice structure,…

From the configuration of a matroid (which records the size and rank of the cyclic flats and the containments among them, but not the sets), one can compute several much-studied matroid invariants, including the Tutte polynomial and a…

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

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

高能物理 - 理论 · 物理学 2009-10-28 S. Boukraa , J-M. Maillard , G. Rollet

The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…

逻辑 · 数学 2019-06-14 Luigi Santocanale

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

组合数学 · 数学 2025-08-14 Luis Ferroni , Alex Fink

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…

组合数学 · 数学 2017-10-05 Federico Ardila

We characterise the digraphs for which the multipaths, that is disjoint unions of directed paths, yield a matroid. For such graphs, called MP-digraphs, we prove that the Tutte polynomial of the multipath matroid is related to counting…

组合数学 · 数学 2024-09-24 Luigi Caputi , Carlo Collari , Sabino Di Trani

We introduce and study filtrations of a matroid on a linearly ordered ground set, which are particular sequences of nested sets. A given basis can be decomposed into a uniquely defined sequence of bases of minors, such that these bases have…

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

We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…

组合数学 · 数学 2021-11-11 John Machacek

In this work, we explore the combinatorics arising from the quiver generating series of the unreduced $r$-colored HOMFLY-PT polynomial $\bar{P}_r(a,q)$ for some twist-knots and double twist knots. By taking the limit $a = 0$ and $q = 1$, we…

几何拓扑 · 数学 2026-05-05 Aditya Dwivedi , Ramadevi Pichai

We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…

组合数学 · 数学 2007-08-30 Jesper Lykke Jacobsen

In this paper, we introduce the concept of the Tutte polynomials of genus $g$ and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tutte polynomials. The Tutte polynomials are matroid…

组合数学 · 数学 2019-08-16 Tsuyoshi Miezaki , Manabu Oura , Tadashi Sakuma , Hidehiro Shinohara