English
Related papers

Related papers: On $k$-Connected $\Gamma$-Extensions of Binary Mat…

200 papers

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

Combinatorics · Mathematics 2009-10-19 Julia Böttcher , Klaas P. Pruessmann , Anusch Taraz , Andreas Würfl

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized…

Combinatorics · Mathematics 2013-05-15 Xueliang Li , Yaping Mao , Yuefang Sun

The $es$-splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But for matroids representable over $GF(p),(p>2),$ called $p$-matroids, the $es$-splitting operation may yield Eulerian matroids. In this work,…

Combinatorics · Mathematics 2022-11-29 Uday Jagadale , Prashant Malavadkar , Sachin Gunjal , M. M. Shikare

We introduce the \Gamma-extension of the spectrum of the Laplacian of a Riemannian orbifold, where \Gamma is a finitely generated discrete group. This extension, called the \Gamma-spectrum, is the union of the Laplace spectra of the…

Differential Geometry · Mathematics 2014-06-27 Carla Farsi , Emily Proctor , Christopher Seaton

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

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Combinatorics · Mathematics 2019-12-23 Manuel Aprile , Samuel Fiorini

An analysis of extension of Hamiltonian operators from lower order to higher order of matrix paves a way for constructing Hamiltonian pairs which may result in hereditary operators. Based on a specific choice of Hamiltonian operators of…

solv-int · Physics 2016-09-08 Wen-Xiu Ma , Maxim Pavlov

Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…

Rings and Algebras · Mathematics 2026-02-26 Chandrasekhar Gokavarapu , D. Madhusudhana Rao

We study the closure operators of polymatroids from a lattice theoretic point of view. We show that polymatroid closure operators relate to lattices enriched with a generating set in the same way that matroids relate to geometric lattices.…

Combinatorics · Mathematics 2021-12-10 William Gustafson

There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is…

Combinatorics · Mathematics 2025-06-30 Leonardo Martínez-Sandoval , Kolja Knauer

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

Geometric Topology · Mathematics 2026-02-03 Carmen Caprau , Victoria Wiest

L. Lovasz has shown that Sperner's combinatorial lemma admits a generalization involving a matroid defined on the set of vertices of the associated triangulation. Inspired by this result we prove that classical Ky Fan's theorem admits an…

Combinatorics · Mathematics 2007-10-11 Rade T. Zivaljevic

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

Combinatorics · Mathematics 2025-01-28 Toru Hasunuma

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

Discrete Mathematics · Computer Science 2014-01-06 Michael A. Bekos , Martin Gronemann , Chrysanthi N. Raftopoulou

The paper considers a Clifford extension of the Grassmann algebra, in which operators are built from Grassmann variables and by the derivatives with respect to them. It is shown that a subalgebra which is isomorphic to the usual matrix…

General Mathematics · Mathematics 2016-11-03 V. V. Monakhov

The stable mod 2 cohomologies of the spectra for connective real and complex K-theories are well known and easy to work with. However, the known bases are in terms of the anti-automorphism of Milnor basis elements. We offer simple bases in…

K-Theory and Homology · Mathematics 2024-04-19 Donald M. Davis , W. Stephen Wilson

An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…

Combinatorics · Mathematics 2025-02-25 Jérémie Guilhot , Cédric Lecouvey , Pierre Tarrago

In this paper, we give a complete characterization of binary matroids with no $P_9$-minor. A 3-connected binary matroid $M$ has no $P_9$-minor if and only if $M$ is one of the internally 4-connected non-regular minors of a special…

Combinatorics · Mathematics 2014-10-06 Guoli Ding , Haidong Wu

In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…

Dynamical Systems · Mathematics 2016-12-20 Mehdi Fatehi Nia

A tract $F$ is an algebraic structure where multiplication is defined but addition is only partially defined. They were introduced by Baker and Bowler as a unified framework to study generalisations of matroids, including oriented and…

Combinatorics · Mathematics 2024-06-06 Ben Smith