Results 41 to 50 of about 22,632 (241)
Phase Transition as an Emergent Phenomenon Analysed by Violation of Structural Invariant (M, BM)
Mendel, 2020 When modeling complex systems, we usually encounter the following difficulties: partiality, large amounts of data and uncertainty of conclusions. The most common approach used for modeling is the physical approach, sometimes reinforced by statistical ...
Jiri Bila, Ali H Reshak, Jan Chysky
doaj +1 more source
The Z-Polynomial of a Matroid [PDF]
Electronic Journal of Combinatorics, 2017 We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion, obtaining a closed
N. Proudfoot, Yuan Xu, Benjamin Young
semanticscholar +1 more source
New light on Bergman complexes by decomposing matroid types [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are certain matroids, called matroid types, too. In order to understand the structure of these faces we decompose matroid types into direct summands.
Martin Dlugosch
doaj +1 more source
The moduli space of matroids [PDF]
, 2018 In the first part of the paper, we clarify the connections between several algebraic objects appearing in matroid theory: both partial fields and hyperfields are fuzzy rings, fuzzy rings are tracts, and these relations are compatible with the respective ...
Baker, Matthew, Lorscheid, Oliver
core +2 more sources
Applications of Matrices to a Matroidal Structure of Rough Sets
Journal of Applied Mathematics, 2013 Rough sets provide an efficient tool for dealing with the vagueness and granularity in information systems. They are widely used in attribute reduction in data mining. There are many optimization issues in attribute reduction.
Jingqian Wang, William Zhu
doaj +1 more source
A lattice point counting generalisation of the Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact
Amanda Cameron, Alex Fink
doaj +1 more source
Strong Algorithms for the Ordinal Matroid Secretary Problem [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 In the ordinal matroid secretary problem (MSP), candidates do not reveal numerical weights, but the decision maker can still discern if a candidate is better than another.
J. A. Soto +2 more
semanticscholar +1 more source
Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture
Discrete Analysis, 2022 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture, Discrete Analysis 2022:2, 50 pp. Suppose one realizes a graph $G$ by taking its vertex set to be a set of points $x_1,\dots,x_n$ in $\mathbb R^d$ and the edge joining $x_i$ to
Katie Clinch +2 more
doaj +1 more source
European Journal of Combinatorics, 2017 A laminar family is a collection $\mathscr{A}$ of subsets of a set $E$ such that, for any two intersecting sets, one is contained in the other. For a capacity function $c$ on $\mathscr{A}$, let $\mathscr{I}$ be $\{I:|I\cap A| \leq c(A)\text{ for all $A\in\mathscr{A}$}\}$.
Fife, Tara, Oxley, James
openaire +2 more sources
$Star^1$-convex functions on tropical linear spaces of complete graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Given a fan $\Delta$ and a cone $\sigma \in \Delta$ let $star^1(\sigma )$ be the set of cones that contain $\sigma$ and are one dimension bigger than $\sigma$ . In this paper we study two cones of piecewise linear functions defined on $\delta$ : the cone
Laura Escobar
doaj +1 more source