Results 51 to 60 of about 4,009 (153)
Multidimensional Topological Measure Spaces and Their Applications in Decision‐Making Problems
Advances in Fuzzy Systems, Volume 2026, Issue 1, 2026.This paper presents a generalized framework termed the multidimensional topological measure space (MDTMS), developed through multidimensional fuzzy sets, multidimensional topology, and an associated distance measure. The suggested framework enhances traditional fuzzy models by facilitating a more nuanced representation and examination of intricate ...
Jomal Josen +3 more
wiley +1 more source
Equicovering matroids by distinct bases
European Journal of Combinatorics, 1995 Let \(M\) be a matroid on the set \(E\) of \(m\) elements and suppose that the rank \(r(E)\) divides \(m\). Then \(E\) can be partitioned into distinct bases iff \(| X|/ r(X)\leq m/r(E)\) holds for all \(X\subseteq E\). The cyclic order conjecture (see \textit{Y. Kajitani}, \textit{S. Ueno} and \textit{H. Miyano} [Discrete Math. 72, No.
Fraisse, Pierre, Hell, Pavol
openaire +1 more source
On Some Algorithmic and Structural Results on Flames
Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
Adjacency, Inseparability, and Base Orderability in Matroids
European Journal of Combinatorics, 2000 Two elements in an oriented matroid are inseparable if they have either the same sign in every signed circuit containing them both or opposite signs in every signed circuit containing them both. Two elements of a matroid are adjacent if there is no \({\mathcal M}(K_4)\)-minor using them both, and in which they correspond to a matching of \(K_4\).
Keijsper, J.C.M. +2 more
openaire +4 more sources
Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3401-3407, November 2025.Abstract We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field GF(q)$\textsf {GF}(q)$ and any integer t$t$, every cosimple GF(q)$\textsf {GF}(q)$‐representable matroid with sufficiently large girth contains either M(Kt)$M(K_t)$ or M(Kt)∗$M(K_t)^*$ as a minor.
James Davies +4 more
wiley +1 more source
Positively oriented matroids are realizable [PDF]
, 2013 We prove da Silva's 1987 conjecture that any positively oriented matroid is a positroid; that is, it can be realized by a set of vectors in a real vector space.
Ardila, Federico +2 more
core
Orienting Transversals and Transition Polynomials of Multimatroids
, 2017 Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the Tutte-Martin polynomial.
Brijder, Robert
core +1 more source
Equivariant Hilbert and Ehrhart series under translative group actions
Journal of the London Mathematical Society, Volume 112, Issue 5, November 2025.Abstract We study representations of finite groups on Stanley–Reisner rings of simplicial complexes and on lattice points in lattice polytopes. The framework of translative group actions allows us to use the theory of proper colorings of simplicial complexes without requiring an explicit coloring to be given.
Alessio D'Alì, Emanuele Delucchi
wiley +1 more source
Foundations for a theory of complex matroids
, 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
Approximate‐Guided Representation Learning in Vision Transformer
CAAI Transactions on Intelligence Technology, Volume 10, Issue 5, Page 1459-1477, October 2025.ABSTRACT In recent years, the transformer model has demonstrated excellent performance in computer vision (CV) applications. The key lies in its guided representation attention mechanism, which uses dot‐product to depict complex feature relationships, and comprehensively understands the context semantics to obtain feature weights.
Kaili Wang +4 more
wiley +1 more source