Results 51 to 60 of about 275 (182)
The multivariate arithmetic Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two.
Petter Brändèn, Luca Moci
doaj +1 more source
Proceedings of the American Mathematical Society, 1971 There are several known results concerning how matroids can be induced from given matroids by a bipartite graph and the properties that are inherited in this way. The purpose of this note is to extend some of these results to the situation where the bipartite graph is replaced by an arbitrary directed graph.
openaire +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Flows on Simplicial Complexes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Given a graph $G$, the number of nowhere-zero $\mathbb{Z}_q$-flows $\phi _G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\mathbb{Z} _q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove ...
Matthias Beck, Yvonne Kemper
doaj +1 more source
The Electronic Journal of Combinatorics, 2018 Regular matroids are binary matroids with no minors isomorphic to the Fano matroid $F_7$ or its dual $F_7^*$. Seymour proved that 3-connected regular matroids are either graphs, cographs, or $R_{10}$, or else can be decomposed along a non-minimal exact 3-separation induced by $R_{12}$.
openaire +2 more sources
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James G. Oxley, Haidong Wu
openaire +1 more source
The geometry of zonotopal algebras II: Orlik–Terao algebras and Schubert varieties
Proceedings of the London Mathematical Society, Volume 132, Issue 6, June 2026.Abstract Zonotopal algebras, introduced by Postnikov–Shapiro–Shapiro, Ardila–Postnikov, and Holtz–Ron, show up in many different contexts, including approximation theory, representation theory, Donaldson–Thomas theory, and hypertoric geometry. In the first half of this paper, we construct a perfect pairing between the internal zonotopal algebra of a ...
Colin Crowley, Nicholas Proudfoot
wiley +1 more source
Matroidal Structure of Rough Sets Based on Serial and Transitive Relations
Journal of Applied Mathematics, 2012 The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of
Yanfang Liu, William Zhu
doaj +1 more source
A Miyaoka–Yau inequality for hyperplane arrangements in CPn$\mathbb {CP}^n$
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract Let H$\mathcal {H}$ be a hyperplane arrangement in CPn$\mathbb {CP}^n$. We define a quadratic form Q$Q$ on RH$\mathbb {R}^{\mathcal {H}}$ that is entirely determined by the intersection poset of H$\mathcal {H}$. Using the Bogomolov–Gieseker inequality for parabolic bundles, we show that if a∈RH$\mathbf {a}\in \mathbb {R}^{\mathcal {H}}$ is ...
Martin de Borbon, Dmitri Panov
wiley +1 more source
Discrete Mathematics, 1979 Simoes-Pereira has defined [5,6,7] a matroidal family of graphs and has proved the existence of four matroidal families, called F"1F"2F"3and F"4 the set of polygons [@d]. Andreae [1] has shown that for every n, integer, n>=2, there is a matroidal family M"n (F"4=M"2, F"1=M"3).
openaire +2 more sources