Results 31 to 40 of about 511 (171)
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Analyzing single-valued neutrosophic fuzzy graphs through matroid perspectives
Ain Shams Engineering JournalWe hope to present this paper on the emergence of a novel category of matroids derived from single-valued neutrosophic (SVN) fuzzy-graphs. The findings of this study make a substantial contribution to both matroid theory and the field of neutrosophic ...
S.M. Balaji, D. Meiyappan, R. Sujatha
doaj +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
Journal of Combinatorial Theory, Series B, 1978 AbstractLet M be an oriented matroid. One can define exactly two assignments of +1 and −1 to permutations of bases of M canonically associated with the orientation of M.
openaire +1 more source
Finding the circuits of a matroid
, 1976 Given the bases of a matroid, this paper presents a primal algorithm and a dual algorithm for finding the circuits of the ...
Minieka, Edward
core +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 MathematicsIn this work, we explore the application of modulus in matroid theory, specifically, the modulus of the family of bases of matroids. This study not only recovers various concepts in matroid theory, including the strength, fractional arboricity, and principal partitions, but also offers new insights.
Huy Truong, Pietro Poggi-Corradini
openaire +2 more sources
Osculating geometry and higher‐order distance Loci
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
Random packing by matroid bases and triangles
, 1995 Let M be a matroid on a finite set E(M). Then M is packable by bases if E(M) is the disjoint union of bases. A partial packing of M is a collection of disjoint bases whose union is a proper subset of E(M).
Akkari, Safwan
core +1 more source
A tropical approach to rigidity: Counting realisations of frameworks
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source