Results 91 to 100 of about 4,343 (225)
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James G. Oxley, Haidong Wu
openaire +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
Simulating quantum computations with Tutte polynomials
npj Quantum Information, 2021 We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids.
Ryan L. Mann
doaj +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
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
Discrete Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Will Agnew-Svoboda +5 more
openaire +3 more sources
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
Minimum partition of a matroid into independent subsets
, 1965 A matroid M is a finite set M of elements with a family of subsets, called independent, such that (1) every subset of an independent set is independent, and (2) for every subset A of M, all maximal independent subsets of A have the same cardinality ...
Edmonds, Jack
core +1 more source
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
Journal of Graph Theory, Volume 109, Issue 4, Page 446-453, August 2025.ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source