English
Related papers

Related papers: On graphic splitting of regular matroids

200 papers

In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…

Combinatorics · Mathematics 2019-04-16 Gi-Sang Cheon , Ji-Hwan Jung , Sergey Kitaev , Seyed Ahmad Mojallal

Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…

Combinatorics · Mathematics 2021-03-26 Pavel Galashin , Alexander Postnikov

The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both the class of lifted-graphic matroids and the class of frame matroids, each of which generalises the class of graphic…

Combinatorics · Mathematics 2022-05-26 Rong Chen

We review remarkable results in several mathematical scenarios, including graph theory, division algebras, cross product formalism and matroid theory. Specifically, we mention the following subjects: (1) the Euler relation in graph theory,…

History and Overview · Mathematics 2011-11-14 J. A. Nieto

This document is a blueprint for the formalization in Lean of the structural theory of regular matroids underlying Seymour's decomposition theorem. We present a modular account of regularity via totally unimodular representations, show that…

Combinatorics · Mathematics 2026-01-06 Ivan Sergeev , Martin Dvorak , Cameron Rampell , Mark Sandey , Pietro Monticone

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

Commutative Algebra · Mathematics 2009-02-14 Christopher A. Francisco , Huy Tai Ha , Adam Van Tuyl

A formula for computing the metric dimension of a simple graph, having no singleton twin, is given. A sufficient condition for a simple graph to have the exchange property, for resolving sets, is found. Some families of power graphs of…

Combinatorics · Mathematics 2016-04-01 Usman Ali , Ghulam Abbas , Syed Ahtisham Bokhary

Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…

Combinatorics · Mathematics 2017-05-04 Gui-Xian Tian , Jing-Xiang He , Shu-Yu Cui

Second-order equations of motion on a group manifold that appear in a large class of so-called chiral theories are presented. These equations are presented and explicitely solved for cases of semi-simple, finite-dimensional Lie groups. With…

High Energy Physics - Theory · Physics 2007-05-23 Z. Hasiewicz , P. Siemion

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

Discrete Mathematics · Computer Science 2013-06-21 Tomás Feder , Pavol Hell , Oren Shklarsky

We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two commuting structures of a crystal graph on these matrices.…

Combinatorics · Mathematics 2007-05-23 Marc A. A. van Leeuwen

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…

Data Structures and Algorithms · Computer Science 2019-02-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh , Meirav Zehavi

In this article we continue our analysis of Schr\"odinger operators on arbitrary graphs given as certain Laplace operators. In the present paper we give the proof of the composition rule for the scattering matrices. This composition rule…

Mathematical Physics · Physics 2007-05-23 Vadim Kostrykin , Robert Schrader

Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…

Combinatorics · Mathematics 2011-11-10 Audrey Lee , Ileana Streinu , Louis Theran

This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…

Combinatorics · Mathematics 2022-06-02 Bob Lutz

A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…

Numerical Analysis · Mathematics 2019-07-23 Lucia Romani , Alberto Viscardi

The crossing properties of the matrix elements of non-local operators, parameterized by Generalized Parton Distribution, are considered. They are especially simple in terms of the Double Distributions which are common for the various…

High Energy Physics - Phenomenology · Physics 2009-11-07 O. V. Teryaev

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

Combinatorics · Mathematics 2017-04-21 Matthew Baker , Nathan Bowler

We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are…

Information Theory · Computer Science 2020-02-21 Trygve Johnsen , Hugues Verdure

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim