Results 81 to 90 of about 22,632 (241)
Bijections for lattice paths between two boundaries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We prove that on the set of lattice paths with steps $N=(0,1)$ and $E=(1,0)$ that lie between two boundaries $B$ and $T$, the two statistics `number of $E$ steps shared with $B$' and `number of $E$ steps shared with $T$' have a symmetric joint ...
Sergi Elizalde, Martin Rubey
doaj +1 more source
, 2012 In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids.
Liu, Yanfang, Zhu, William
core
Matroid configurations and symbolic powers of their ideals [PDF]
, 2015 Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals generalize Stanley ...
A. Geramita +3 more
semanticscholar +1 more source
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
SELECTION OF SOLUTIONS FOR DESIGNING OPEN SYSTEMS BASED ON ANALYSIS OF VARIANTS WITH RANDOM WEIGHTS
Российский технологический журнал, 2018 A new one-parameter approach to the selection of optimal solutions for the design of complex systems is proposed. The approach is based on the analysis of a tree of variants with random weights (here weight is a certain non-negative quantity: for example,
A. A. Pastushkov, V. K. Batovrin
doaj +1 more source
A matroid associated with a phylogenetic tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Special issue PRIMA ...
Andreas Dress +2 more
doaj +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
Graphs and Matroids Weighted in a Bounded Incline Algebra
The Scientific World Journal, 2014 Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most ...
Ling-Xia Lu, Bei Zhang
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
Maximum size binary matroids with no AG(3,2)-minor are graphic [PDF]
, 2013 We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound.
Kung, Joseph P. S. +3 more
core