Results 61 to 70 of about 275 (182)

Orthogonal Matroids [PDF]

open access: yesJournal of Algebraic Combinatorics, 2001
In [Usp. Mat. Nauk 42, No. 2, 107-134 (1987; Zbl 0629.14035), Sov. Math., Dokl. 35, 63-66 (1987); translation from Dokl. Akad. Nauk SSSR 292, 524-528 (1987; Zbl 0645.22005), and Russ. Math. Surv. 42, No. 2, 133-168 (1987; Zbl 0639.14031)] \textit{I. M. Gelfand} and \textit{V. V. Serganova} generalize the notion of matroid to Coxeter matroids.
Vince, Andrew, White, Neil
openaire   +1 more source

Osculating geometry and higher‐order distance Loci

open access: yesJournal 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

A tropical approach to rigidity: Counting realisations of frameworks

open access: yesJournal 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

Modular elimination in matroids and oriented matroids

open access: yesEuropean Journal of Combinatorics, 2011
We introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo's axioms for flats. This new point of view leads to a corresponding strengthening of the circuit axioms for oriented matroids.
openaire   +2 more sources

Toric amplitudes and universal adjoints

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 2, February 2026.
Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley   +1 more source

Geometric Lattice Structure of Covering-Based Rough Sets through Matroids

open access: yesJournal of Applied Mathematics, 2012
Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in ...
Aiping Huang, William Zhu
doaj   +1 more source

Unipancyclic matroids

open access: yesDiscrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Will Agnew-Svoboda   +5 more
openaire   +3 more sources

On higher Jacobians, Laplace equations, and Lefschetz properties

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract Let A$A$ be a standard graded Artinian K$\mathbb {K}$‐algebra over a field of characteristic zero. We prove that the failure of strong Lefschetz property (SLP) for A$A$ is equivalent to the osculating defect of a certain rational variety.
Charles Almeida   +2 more
wiley   +1 more source

Covering-Based Rough Sets on Eulerian Matroids

open access: yesJournal of Applied Mathematics, 2013
Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets.
Bin Yang, Ziqiong Lin, William Zhu
doaj   +1 more source

Renormalization group-like proof of the universality of the Tutte polynomial for matroids [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters are solutions
G. Duchamp   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy