Results 91 to 100 of about 22,632 (241)
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
On the k-volume rigidity of a simplicial complex in ℝ d
Forum of Mathematics, SigmaWe define a generic rigidity matroid for k-volumes of a simplicial complex in $\mathbb {R}^d$ and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic d-rigidity matroid on the same vertex set (namely, the case
Alan Lew +3 more
doaj +1 more source
Detection of Emergent Situations in Complex Systems by Structural Invariant (MB, M)
Mendel, 2017 The paper introduces complete description of the detection method that uses structural invariant Matroid and its Bases (MB, M). There are recapitulated essential concepts from the used knowledge field as “complex system, emergent situations (A, B, C ...
Jiri Bila, Martin Novak
doaj +1 more source
Some characteristics of matroids through rough sets [PDF]
, 2012 At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid, as a branch of
Su, Lirun, Zhu, William
core
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
Matroid Bandits: Fast Combinatorial Optimization with Learning [PDF]
, 2014 A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only if the ...
Ashkan, Azin +4 more
core
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
A notion of minor-based matroid connectivity
, 2018 For a matroid $N$, a matroid $M$ is $N$-connected if every two elements of $M$ are in an $N$-minor together. Thus a matroid is connected if and only if it is $U_{1,2}$-connected.
Gershkoff, Zachary, Oxley, James
core +1 more source
A circle method approach to K‐multimagic squares
Journal of the London Mathematical Society, Volume 112, Issue 3, September 2025.Abstract In this paper, we investigate K$K$‐multimagic squares of order N$N$. These are N×N$N \times N$ magic squares that remain magic after raising each element to the k$k$th power for all 2⩽k⩽K$2 \leqslant k \leqslant K$. Given K⩾2$K \geqslant 2$, we consider the problem of establishing the smallest integer N2(K)$N_2(K)$ for which there exist ...
Daniel Flores
wiley +1 more source
, 2014 We propose an algebraic combinatorial method for solving large sparse linear systems of equations locally - that is, a method which can compute single evaluations of the signal without computing the whole signal. The method scales only in the sparsity of
Király, Franz J, Theran, Louis
core +1 more source