English
Related papers

Related papers: The Catalan matroid

200 papers

To a $2\times2$ matrix $G$ with complex entries, we relate the sequence of Laurent polynomial $L_n(z,G)=\tr \big(G\big[\begin{smallmatrix}z&0\\ 0&z^{-1}\end{smallmatrix}\big]G^{\ast}\big)^n$. It turns out that for each \(n\), the family…

Classical Analysis and ODEs · Mathematics 2016-05-17 Victor Katsnelson

In this work, we study matroids over a domain and several classical combinatorial and algebraic invariants related. We define their Grothendieck-Tutte polynomial $T_{\mathcal{M}}(x,y)$, extending the definition given by Fink and Moci in…

Combinatorics · Mathematics 2019-09-04 Alessio Borzì , Ivan Martino

Let $V$ be a vector space of rectangular $n\times k$ matrices annihilating the Cullis' determinant. We show that $\dim(V) \le (n-1)k$, extending Dieudonn{\'{e}}'s result on the dimension of vector spaces of square matrices annihilating the…

Combinatorics · Mathematics 2026-01-21 Alexander Guterman , Andrey Yurkov

The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.

Combinatorics · Mathematics 2020-12-04 Francesca Aicardi

In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…

Combinatorics · Mathematics 2018-11-20 Felix Gotti , Harold Polo

An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…

Combinatorics · Mathematics 2014-04-28 Antoine Genitrini , Cécile Mailler

We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…

Combinatorics · Mathematics 2018-11-28 Elena Barcucci , Antonio Bernini , Stefano Bilotta , Andrea Lattanzi , Renzo Pinzani

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Combinatorics · Mathematics 2024-11-05 Kristóf Bérczi , Áron Jánosik , Bence Mátravölgyi

For each positive integer $k$, we consider five well-studied posets defined on the set of Dyck paths of semilength $k$. We prove that uniquely sorted permutations avoiding various patterns are equinumerous with intervals in these posets.…

Combinatorics · Mathematics 2020-03-13 Colin Defant

We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…

Combinatorics · Mathematics 2026-05-15 Jimmy Dillies

Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…

We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…

Combinatorics · Mathematics 2025-02-10 Luis Ferroni , Benjamin Schröter

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo

We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third…

Combinatorics · Mathematics 2019-05-29 Kolja Knauer , Tilen Marc

Motivated by representation theory we exhibit an interior structure to Catalan sequences and many generalisations thereof. Certain of these coincide with well known (but heretofore isolated) structures. The remainder are new.

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Paul Martin

In this paper, we study symmetric lattice paths. Let $d_{n}$, $m_{n}$, and $s_{n}$ denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schr\"oder paths of length $2n$, respectively. By using Riordan group…

Combinatorics · Mathematics 2009-06-11 Li-Hua Deng , Eva Y. P. Deng , Louis W. Shapiro

We first observe that the relations of the canonical generating isometries of the Cuntz algebra ${\cal O}_N$ are naturally related to the $N$-colored Catalan numbers. For a directed graph $G$, we generalize the Catalan numbers by using the…

Operator Algebras · Mathematics 2007-05-23 Kengo Matsumoto

We construct (q,t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W. The two main ingredients in this construction are Rouquier's formulation of shift functors for the rational Cherednik…

Combinatorics · Mathematics 2009-12-09 Iain Gordon , Stephen Griffeth

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier