Results 41 to 50 of about 14,016 (208)

A Miyaoka–Yau inequality for hyperplane arrangements in CPn$\mathbb {CP}^n$

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

Applications of Matrices to a Matroidal Structure of Rough Sets

open access: yesJournal of Applied Mathematics, 2013
Rough sets provide an efficient tool for dealing with the vagueness and granularity in information systems. They are widely used in attribute reduction in data mining. There are many optimization issues in attribute reduction.
Jingqian Wang, William Zhu
doaj   +1 more source

Infinite Matroids and Determinacy of Games [PDF]

open access: yes, 2013
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that the class of ...
Bowler, Nathan, Carmesin, Johannes
core  

On the rank functions of $\mathcal{H}$-matroids

open access: yes, 2016
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm.
Sano, Yoshio
core   +2 more sources

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

Linear Algebraic Relations among Cardinalities of Sets of Matroid Functions

open access: yesMathematics, 2023
We introduce a unifying approach for invariants of finite matroids that count mappings to a finite set. The aim of this paper is to show that if the cardinalities of mappings with fixed values on a restricted set satisfy contraction–deletion rules, then ...
Martin Kochol
doaj   +1 more source

Foundations for a theory of complex matroids

open access: yes, 2012
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids.
Anderson, Laura, Delucchi, Emanuele
core   +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

Orthogonal matroids over tracts

open access: yesForum of Mathematics, Sigma
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 establish basic ...
Tong Jin, Donggyu Kim
doaj   +1 more source

Interval positroid varieties and a deformation of the ring of symmetric functions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Define the interval rank $r_[i,j] : Gr_k(\mathbb C^n) →\mathbb{N}$ of a k-plane V as the dimension of the orthogonal projection $π _[i,j](V)$ of V to the $(j-i+1)$-dimensional subspace that uses the coordinates $i,i+1,\ldots,j$.
Allen Knutson, Mathias Lederer
doaj   +1 more source

Home - About - Disclaimer - Privacy