Results 11 to 20 of about 55 (54)
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
Modeling of Complex Systems by Means of Partial Algebras
Mendel, 2019 Complex systems are very hard to describe by some unified language and calculus. In cases when their nature is very heterogeneous is possible to use with advantage state description.
Jiri Bila +2 more
doaj +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
When is the graph of a random 0/1 polytope a clique?
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract We study graph‐theoretic properties of random 0/1$0/1$ polytopes. Specifically, let Qpn⊆{0,1}n$Q_p^n \subseteq \lbrace 0,1\rbrace ^n$ be a random subset where each point is included independently with probability p$p$, and consider the graph Gp$G_p$ of the polytope conv(Qpn)$\operatorname{conv}(Q_p^n)$.
Catherine Babecki +2 more
wiley +1 more source
Analyzing single-valued neutrosophic fuzzy graphs through matroid perspectives
Ain Shams Engineering JournalWe hope to present this paper on the emergence of a novel category of matroids derived from single-valued neutrosophic (SVN) fuzzy-graphs. The findings of this study make a substantial contribution to both matroid theory and the field of neutrosophic ...
S.M. Balaji, D. Meiyappan, R. Sujatha
doaj +1 more source
Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Lower bounds for cube‐ideal set‐systems
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi +3 more
wiley +1 more source
An algorithm for determining the bases of a regular matroid
Journal of Numerical Analysis and Approximation Theory, 1988 Not available.
Dănuţ Marcu
doaj +2 more sources
Skew shapes, Ehrhart positivity, and beyond
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A classical result by Kreweras (1965) allows one to compute the number of plane partitions of a given skew shape and bounded parts as certain determinants. We prove that these determinants expand as polynomials with nonnegative coefficients.
Luis Ferroni +2 more
wiley +1 more source